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 4, 2024)
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.
Expected 0(N) and 0(N4/3) Algorithms for Constructing Voronoi Diagrams in Two and Three Dimensions
Published
Author(s)
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
Pub Type
NIST Pubs
Download Paper
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created November 1, 1987, Updated November 10, 2018