The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon

DOI10.4230/LIPIcs.SoCG.2016.56zbMath1387.68272OpenAlexW2504974170MaRDI QIDQ3132892

Eunjin Oh, Hee-Kap Ahn, Luis Barba

Publication date: 30 January 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2016.56

zbMATH Keywords

simple polygonsgeodesic distancefarthest-point Voronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

The geodesic 2-center problem in a simple polygon ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon ⋮ Unnamed Item ⋮ Voronoi diagrams for a moderate-sized point-set in a simple polygon ⋮ The geodesic farthest-point Voronoi diagram in a simple polygon ⋮ \(L_1\) geodesic farthest neighbors in a simple polygon and related problems