Constrained geodesic centers of a simple polygon

DOI10.4230/LIPICS.SWAT.2016.29MaRDI QIDQ5369531zbMATH OpenOpenAlexFDO

Authors Eunjin Oh, Wanbin Son, Hee-Kap Ahn

Publication date 17 October 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.SWAT.2016.29

zbMATH Keywords

constrained centerfacility locationfarthest-point Voronoi diagramgeodesic distancesimple polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 4051002
• Computing the geodesic center of a simple polygon
• The 2-center problem in a simple polygon

Cited in

(7)

• Restricted center problems under polyhedral gauges
• Facility location on a polyhedral surface
• The polygon burning problem
• Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
• Geodesic order types
• scientific article; zbMATH DE number 7030514 (Why is no real title available?)
• Geodesic order types

This page was built for publication: Constrained geodesic centers of a simple polygon

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