Conference
Cited 0 time in 
Cited 1 time in 
Cited 1 time in
Metadata Downloads
Covering Convex Polygons by Two Congruent Disks
- Title
- Covering Convex Polygons by Two Congruent Disks
- Authors
- Choi, Jongmin; Jeong, Dahye; Ahn, Hee-Kap
- Date Issued
- 2021-07-05
- Publisher
- Springer Science and Business Media Deutschland GmbH
- Abstract
- We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an O(nlog n) -time algorithm for the two-center problem for a convex polygon, where n is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem.
- Article Type
- Conference
- Citation
- 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, page. 165 - 178, 2021-07-05
- 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.