Sciweavers

SODA
1997
ACM
115views Algorithms» more  SODA 1997»
14 years 7 days ago
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).
David Eppstein