A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
From MaRDI portal
(Redirected from Publication:5116518)
A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (scientific article; zbMATH DE number 7236462)
A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (scientific article; zbMATH DE number 7236462)
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
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cites work
- 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
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- 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
- Scanning multiple sequences via cache memory
- Triangulating a simple polygon in linear time
- Updating a balanced search tree in 0(1) rotations
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cited in
(16)- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
- scientific article; zbMATH DE number 3889235 (Why is no real title available?)
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
- scientific article; zbMATH DE number 7559212 (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
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
- Kinetic geodesic Voronoi diagrams in a simple polygon
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
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 Q5116518)
