Algorithms for packing two circles in a convex polygon
We consider algorithms for packing two circles in a given 77,-vert ex convex polygon. The first algorithm outputs a pair of equal non-overlapping circles of maximum radius and has running time O(n). The second algorithm outputs a pair of non-overlapping circles whose sum of radii is maximum and has running time 0(n2).
Bose, P, Czyzowicz, J. (Jurek), Kranakis, E, & Maheshwari, A. (2000). Algorithms for packing two circles in a convex polygon.