| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6868397 | Computational Geometry | 2018 | 17 Pages |
Abstract
In the geodesic 2-center problem in a simple polygon with n vertices, we find a set S of two points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in S. In this paper, we present an O(n2log2â¡n)-time algorithm for this problem using O(n) space.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn,