A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
From MaRDI portal
Publication:2300726
Abstract: The geodesic Voronoi diagram of m point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell share the same nearest site under the geodesic distance. The best known lower bound for the construction time is Omega( n + m log m ), and a matching upper bound is a long-standing open question. The state-of-the-art construction algorithms achieve O( (n+m) log (n+m) ) and O( n+m log m log^2 n ) time, which are optimal for m=Omega(n) and m=O( n / log^3 n ), respectively. In this paper, we give a construction algorithm with O( n+m( log m+ log^2 n) ) time, and it is nearly optimal in the sense that if a single Voronoi vertex can be computed in O( log n ) time, then the construction time will become the optimal O( n+m log m ). In other words, we reduce the problem of constructing the diagram in the optimal time to the problem of computing a single Voronoi vertex in O( log n ) time.
Recommendations
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cites work
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- A new data structure for shortest path queries in a simple polygon
- Algorithms and Data Structures
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal Point Location in a Monotone Subdivision
- Optimal shortest path queries in a simple polygon
- Triangulating a simple polygon in linear time
- Updating a balanced search tree in 0(1) rotations
- Voronoi diagrams and Delaunay triangulations
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cited in
(12)- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
- scientific article; zbMATH DE number 4051001 (Why is no real title available?)
- ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
- scientific article; zbMATH DE number 3889235 (Why is no real title available?)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams
This page was built for publication: A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300726)
