NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Expected 0(N) and 0(N4/3) Algorithms for Constructing Voronoi Diagrams in Two and Three Dimensions

Published

Author(s)

Javier Bernal

Abstract

Bentley, Weide and Yao have proposed an expected 0(N) cell technique for computing Voronoi diagrams in two dimensions that does not generalize readily to three. In this paper their work is further developed and generalized to produce expected 0(N ) and 0(N4/3) algorithms for constructing Voronoi diagrams in two and three dimensions, respectively. Computational experience is presented for the algorithm in two dimensions.
Citation
NIST Interagency/Internal Report (NISTIR) - 87-3679
Report Number
87-3679
NIST Pub Series
NIST Interagency/Internal Report (NISTIR)
Pub Type
NIST Pubs

Download Paper

DOI Link

Citation

Bernal, J. (1987), Expected 0(N) and 0(N4/3) Algorithms for Constructing Voronoi Diagrams in Two and Three Dimensions, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/NBS.IR.87-3679 (Accessed October 25, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created November 1, 1987, Updated November 10, 2018
Was this page helpful?