The Discrete 2-Center Problem

@article{Agarwal1998TheD2,
  title={The Discrete 2-Center Problem},
  author={Pankaj K. Agarwal and Micha Sharir and Emo Welzl},
  journal={Discrete & Computational Geometry},
  year={1998},
  volume={20},
  pages={287-305}
}
Abstract. We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; that is, computing two congruent disks of smallest possible radius, centered at two points of P , whose union covers P . Our algorithm runs in time O(n4/3log5n) . 
BETA

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 34 CITATIONS

Computing Maximally Separated Sets in the Plane

VIEW 6 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Ball hulls, ball intersections, and 2-center problems for gauges

  • Contributions to Discrete Mathematics
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Minimum Sum Dipolar Spanning Tree in R^3

  • Comput. Geom.
  • 2010
VIEW 1 EXCERPT
CITES BACKGROUND