# Voronoi diagrams—a survey of a fundamental geometric data structure

@article{Aurenhammer1991VoronoiDS,
title={Voronoi diagrams—a survey of a fundamental geometric data structure},
author={Franz Aurenhammer},
journal={ACM Comput. Surv.},
year={1991},
volume={23},
pages={345-405}
}
• F. Aurenhammer
• Published 1 September 1991
• Computer Science
• ACM Comput. Surv.
Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more practically oriented, areas of computer science— such as computer graphics, computer-aided design, robotics, pattern recognition, and operations research—give rise to problems that inherently are geometrical. This is one reason computational geometry has attracted enormous research interest in the past decade and is a well-established area today. (For standard sources…
4,172 Citations
Highest order Voronoi diagram optimization
• Computer Science
2017 5th International Conference on Information and Communication Technology (ICoIC7)
• 2017
Left with Least-Angle Movement (LAM) method for construction Highest Order Voronoi Diagram that change data structure to scale up data that can be processed.
The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
The question is formalized precisely, and it is shown that the answer is positive in the case of Rd, or in (possibly infinite dimensional) uniformly convex normed spaces, assuming there is a common positive lower bound on the distance between the sites.
Intrinsic computation of voronoi diagrams on surfaces and its application
A sweep circle algorithm for construct Voronoi diagrams in parallel and the Saddle Vertex Graph to efficiently compute discrete geodesics on meshes are presented and one application of CVT and discrete geodeics, anisotropic shape distribution on meshes is proposed.
On the hausdorff and other cluster Voronoi diagrams
This dissertation studies certain cluster Voronoi diagrams from the perspective of their construction algorithms and algorithmic applications, and establishes a connection between these diagrams and the stabbing circle problem for segments in the plane.
Transactions on Computational Science IX - Special Issue on Voronoi Diagrams in Science and Engineering
• Computer Science
Trans. Comput. Sci.
• 2010
A general framework for computing Voronoi diagrams of different classes of sites under various distance functions in R is presented, and it is proved that through randomization, the expected running time becomes near-optimal in the worst case.
NSF CAREER Proposal : Approximation Algorithms for Geometric Computing 1 Overview
• Computer Science
• 2002
The proposal outlines a challenging career development plan focusing on research in a broad cross-section of computational geometry, building on and significantly broadening the PI’s successful work in the field over the last several years.
Lectures on discrete geometry
• J. Matousek
• Mathematics
Graduate texts in mathematics
• 2002
This book is primarily a textbook introduction to various areas of discrete geometry, in which several key results and methods are explained, in an accessible and concrete manner, in each area.
Calculating Voronoi Diagrams using Convex Sweep Curves
A generalization of the sweep line method of Fortune was developed, and a sweep algorithm based on sweep circles was implemented; this algorithms runs with O(n · log n) time and O( n) space requirements, which is optimal.

## References

SHOWING 1-10 OF 286 REFERENCES
A practical algorithm for computing the Delaunay triangulation for convex distance functions
A number of generalizations of the Voronoi diagram have been presented, including an algorithm for general distance measures that Minkowski called convex distance functions, where the “unit circle” can be defined to be any convex shape.
Computational Geometry&#8212;A Survey
• Computer Science, Mathematics
IEEE Transactions on Computers
• 1984
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
• Computer Science
STOC
• 1983
Two algorithms are given, one that constructs the Voronoi diagram of the given sites, and another that inserts a new site in O(n) time, based on the use of the Vor onoi dual, the Delaunay triangulation, and are simple enough to be of practical value.
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
• Computer Science
Int. J. Comput. Geom. Appl.
• 1992
The insertion or deletion of a site involves little more than the construction of a single convex hull in three-space, and the order-k Voronoi diagram for n sites can be computed in time and optimal space by an on-line randomized incremental algorithm.
Optimal Point Location in a Monotone Subdivision
• Computer Science
SIAM J. Comput.
• 1986
A substantial refinement of the technique of Lee and Preparata for locating a point in $\mathcal{S}$ based on separating chains is exhibited, which can be implemented in a simple and practical way, and is extensible to subdivisions with edges more general than straight-line segments.
Simplified Voronoi diagrams
• Computer Science
SCG '87
• 1987
A Voronoi diagram V is defined based on a measure of distance which is not a true metric, which has lower algebraic complexity than the usual definition, which is a considerable advantage in motion planning problems with many degrees of freedom.
Voronoi Diagrams from Convex Hulls
Two-Dimensional Voronoi Diagrams in the Lp-Metric
• D. Lee
• Computer Science
J. ACM
• 1980
Many proximity problems revolving a set of points, such as finding the nearest neighbor of a given point, finding the minimum spamung tree, findmg the smallest circle enclosing the point set, etc., can be solved very efficiently via the Voronoi diagram.
New applications of random sampling in computational geometry
This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry. One new algorithm creates a search structure for arrangements of hyperplanes by
Further applications of random sampling to computational geometry
This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry by creating a search structure for arrangements of hyperplanes by sampling the hyperplanes and using information from the resulting arrangement to divide and conquer.