Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons

DOI10.1137/1.9781611975482.25MaRDI QIDQ5236206zbMATH OpenOpenAlexFDO

Authors Eunjin Oh

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.25

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• The geodesic farthest-point Voronoi diagram in a simple polygon

Cited in

(22)

• Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
• A new algorithm for Euclidean shortest paths in the plane
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• On the geodesic Voronoi diagram of point sites in a simple polygon
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
• Computing geodesic furthest neighbors in simple polygons
• Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
• The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
• Conic nearest neighbor queries and approximate Voronoi diagrams
• Kinetic geodesic Voronoi diagrams in a simple polygon
• scientific article; zbMATH DE number 3889235 (Why is no real title available?)
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
• scientific article; zbMATH DE number 5046292 (Why is no real title available?)
• Towards space efficient two-point shortest path queries in a polygonal domain
• scientific article; zbMATH DE number 7559212 (Why is no real title available?)
• Improved dynamic geodesic nearest neighbor searching in a simple polygon
• 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

This page was built for publication: Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236206)