The 2-center problem in a simple polygon

DOI10.1007/978-3-662-48971-0_27MaRDI QIDQ3459871zbMATH OpenOpenAlexFDO

Authors Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_27

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

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

Cited in

(6)

• The geodesic 2-center problem in a simple polygon
• Syzygies in the two center problem
• On the 2-center problem under convex polyhedral distance function
• Constrained geodesic centers of a simple polygon
• The Visibility Center of a Simple Polygon
• Kinetic geodesic Voronoi diagrams in a simple polygon

This page was built for publication: The 2-center problem in a simple polygon

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