Covering Convex Polygons by Two Congruent Disks
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(n\log 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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2021
- DOI:
- 10.48550/arXiv.2105.02483
- arXiv:
- arXiv:2105.02483
- Bibcode:
- 2021arXiv210502483C
- Keywords:
-
- Computer Science - Computational Geometry
- E-Print:
- 21 pages, 7 figures