Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams

@article{Guibas1983PrimitivesFT,
title={Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams},
author={Leonidas J. Guibas and Jorge Stolfi},
journal={Proceedings of the fifteenth annual ACM symposium on Theory of computing},
year={1983}
}
• Published 1 December 1983
• Computer Science
• Proceedings of the fifteenth annual ACM symposium on Theory of computing
We discuss the following problem: given n points in the plane (the “sites”), and an arbitrary query point q, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites, and then locating the query point in one of its regions. We give two algorithms, one that constructs the Voronoi diagram in O(n lg n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, the Delaunay triangulation, and…
947 Citations
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.
Lecture 7: Voronoi diagrams
• 2010
We introduce a critical idea of EGC, the technique of root bounds. This will be addressed through the study of Fortune's algorithm for computing the Voronoi diagram of a set of points. The algorithms
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
• Computer Science, Mathematics
2009 Sixth International Symposium on Voronoi Diagrams
• 2009
A general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions is presented and it is proved that through randomization, the expected running time becomes near-optimal in the worst case.
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
• Mathematics, Computer Science
ISVD
• 2009
A general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions is presented and it is proved that through randomization, the expected running time becomes near-optimal in the worst case.
Storing the Subdivision o f a Polyhedral Surface
• 2005
A common structure arising in computational geometry is the subdivision of a plane defined by the faces of a straight-line planar graph. We consider a natural generalization of this structure on a
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.
The power of geometric duality
• Computer Science, Mathematics
24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
• 1983
A new formulation of the notion of duality that allows the unified treatment of a number of geometric problems is used, to solve two long-standing problems of computational geometry and to obtain a quadratic algorithm for computing the minimum-area triangle with vertices chosen among n points in the plane.
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
• Mathematics, Computer Science