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

DOI10.1145/1542362.1542402MaRDI QIDQ5370718zbMATH OpenOpenAlexFDO

Authors Sang Won Bae, Kyung-Yong Chwa

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)

Recommendations

• Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
• The geodesic farthest-point Voronoi diagram in a simple polygon
• Farthest-polygon Voronoi diagrams
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
• Farthest-Polygon Voronoi Diagrams

Cited in

(9)

• Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
• scientific article; zbMATH DE number 140459 (Why is no real title available?)
• Farthest-polygon Voronoi diagrams
• The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
• Farthest-Polygon Voronoi Diagrams
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• The geodesic diameter of polygonal domains
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
• 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

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