David Eppstein - Publications

• Faster construction of planar two-centers.
  D. Eppstein.
  Tech. Rep. 96-12, ICS, UCI, 1996.
  8th ACM-SIAM Symp. Discrete Algorithms, New Orleans, 1997, pp. 131–138.

  Improving on a recent breakthrough of Sharir, we use data structures from "Dynamic three-dimensional linear programming" to find two circular disks of minimum radius covering a set of points in the Euclidean plane, in randomized expected time O(n log² n).

  (SODA paper – DREI and SODA talk slides)

Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.