The geodesic 2-center problem in a simple polygon

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 (n(2) log(2) n)-time algorithm for this problem using O (n) space. (C) 2018 Elsevier B.V. All rights reserved.11Nsciescopu