Voronoi diagrams—a survey of a fundamental geometric data structure
Open Access
- 1 September 1991
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 23 (3) , 345-405
- https://doi.org/10.1145/116873.116880
Abstract
No abstract availableKeywords
This publication has 169 references indexed in Scilit:
- Minimal roughness property of the Delaunay triangulationComputer Aided Geometric Design, 1990
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Geodesic methods in quantitative image analysisPattern Recognition, 1984
- On the complexity ofd- dimensional Voronoi diagramsArchiv der Mathematik, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Location of multiple points in a planar subdivisionInformation Processing Letters, 1979
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979
- Biological shape and visual science (part I)Journal of Theoretical Biology, 1973
- Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.Journal für die reine und angewandte Mathematik (Crelles Journal), 1908