Covering Convex Polygons by Two Congruent Disks
share
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.
READ FULL TEXT