Packing Two Disks into a Polygonal Environment

: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P, and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on any input, is O(n log n). This is optimal in the algebraic decision tree model of computation.

• Type: Conference
• Year: 2001
• Where: COCOON
• Authors: Prosenjit Bose, Pat Morin, Antoine Vigneron
• Keywords: COCOON 2001, Combinatorics, Equal Radius Disks, Polygon P, Simple Randomized Algorithm