Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons

DOI10.1137/1.9781611975482.25zbMath1431.68119OpenAlexW4250008887MaRDI QIDQ5236206

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)

Related Items

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons ⋮ Farthest-point Voronoi diagrams in the presence of rectangular obstacles ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Unnamed Item