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

Bibliographic notes on voronoi diagrams

Published

Author(s)

Javier Bernal

Abstract

This paper presents a comprehensive annotated bibliography on various theoretical and algorithmic aspects of Voronoi diagrams and related diagrams. Bibliographic notes on the relationship between Voronoi diagrams and solutions to the Euclidean traveling salesman problem are also presented.
Citation
NIST Interagency/Internal Report (NISTIR) - 5164
Report Number
5164
NIST Pub Series
NIST Interagency/Internal Report (NISTIR)
Pub Type
NIST Pubs

Download Paper

DOI Link

Keywords

Algorithm, arrangement, complexity, convex hull, Delaunay triangulation, power diagram, traveling salesman problem, Voronoi diagram

Citation

Bernal, J. (1993), Bibliographic notes on voronoi diagrams, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/NIST.IR.5164 (Accessed October 1, 2025)

Issues

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

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