On the Planar Two-Center Problem and Circular Hulls

19 Feb 2020 Wang Haitao

Given a set $S$ of $n$ points in the Euclidean plane, the two-center problem is to find two congruent disks of smallest radius whose union covers all points of $S$. Previously, Eppstein [SODA'97] gave a randomized algorithm of $O(n\log^2n)$ expected time and Chan [CGTA'99] presented a deterministic algorithm of $O(n\log^2 n\log^2\log n)$ time... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL GEOMETRY
  • DATA STRUCTURES AND ALGORITHMS