The geodesic farthest-site Voronoi diagram in a polygonal domain with holes

DOI10.1145/1542362.1542402zbMath1380.68378OpenAlexW1998475554MaRDI QIDQ5370718

Kyung-Yong Chwa, Sang Won Bae

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1542362.1542402

zbMATH Keywords

geodesicpolygonal domaintight upper boundfarthest-site Voronoi diagramshortest obstacle-free path

Mathematics Subject Classification ID

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

Related Items (5)

The geodesic diameter of polygonal domains ⋮ An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons ⋮ Farthest-point Voronoi diagrams in the presence of rectangular obstacles ⋮ Farthest-polygon Voronoi diagrams ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon

This page was built for publication: The geodesic farthest-site Voronoi diagram in a polygonal domain with holes