Faster Construction of Planar Two-Centers

Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).

• Type: Conference
• Year: 1997
• Where: SODA
• Authors: David Eppstein
• Keywords: Algorithms, Minimum-radius Circular Disks, Randomized Expected Time, SODA 1997