The geodesic 2-center problem in a simple polygon
SCIE
SCOPUS
- Title
- The geodesic 2-center problem in a simple polygon
- Authors
- Oh, Eunjin; De Carufel, Jean-Lou; Ahn, Hee-Kap
- Date Issued
- 2018-10
- Publisher
- ELSEVIER SCIENCE BV
- 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 (n(2) log(2) n)-time algorithm for this problem using O (n) space. (C) 2018 Elsevier B.V. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/95638
- DOI
- 10.1016/j.comgeo.2018.02.008
- ISSN
- 0925-7721
- Article Type
- Article
- Citation
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, vol. 74, page. 21 - 37, 2018-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.