Abstract
The geodesic k-center problem in a simple polygon with n vertices consists in the following. Find k points, called centers, in the polygon to minimize the maximum geodesic distance from any point of the polygon to its closest center. In this paper, we focus on the case where k = 2 and present an exact algorithm that returns an optimal geodesic 2-center in O(n2 log2 n) time.
Cite
CITATION STYLE
Oh, E., De Carufel, J. L., & Ahn, H. K. (2015). The 2-center problem in a simple polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9472, pp. 307–317). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
