On lazy randomized incremental construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
The Voronoi diagram of curved objects
Proceedings of the eleventh annual symposium on Computational geometry
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
On deletion in Delaunay triangulations
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A near-optimal heuristic for minimum weight triangulation of convex polygons
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Splitting a Delaunay Triangulation in Linear Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
Weighted skeletons and fixed-share decomposition
Computational Geometry: Theory and Applications
Voronoi diagram computations for planar NURBS curves
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization
Computational Geometry: Theory and Applications
Flipping to robustly delete a vertex in a delaunay tetrahedralization
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Fast segment insertion and incremental construction of constrained delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Let P be a list of points in the plane such that the points of P taken in order form the vertices of a convex polygon. We introduce a simple, linear expected-time algorithm for finding the Voronoi diagram of the points in P. Unlike previous results on expected-time algorithms for Voronoi diagrams, this method does not require any assumptions about the distribution of points. With minor modifications, this method can be used to design fast algorithms for certain problems involving unrestricted sets of points. For example, fast expected-time algorithms can be designed to delete a point from a Voronoi diagram, to build an order k Voronoi diagram for an arbitrary set of points, and to determine the smallest enclosing circle for points at the vertices of a convex hull.