LIPIcs.SOCG.2015.209.pdf
- Filesize: 0.57 MB
- 15 pages
Document
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
Authors
-
Part of:
Volume:
31st International Symposium on Computational Geometry (SoCG 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-06-12
Cite AsGet BibTex
Hee Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, and Eunjin Oh. A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 209-223, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.SOCG.2015.209
https://doi.org/10.4230/LIPIcs.SOCG.2015.209
Abstract
Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in P. The geodesic center of P is the unique point in P that minimizes the largest geodesic distance to all other points of P. In 1989, Pollack, Sharir and Rote [Disc. & Comput. Geom. 89] showed an O(n log n)-time algorithm that computes the geodesic center of P. Since then, a longstanding question has been whether this running time can be improved (explicitly posed by Mitchell [Handbook of Computational Geometry, 2000]). In this paper we affirmatively answer this question and present a linear time algorithm to solve this problem.
Keywords
- Geodesic distance
- facility location
- 1-center problem
- simple polygons
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads