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(n 4/3log5 n) .
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received July 18, 1997, and in revised form March 17, 1998.
Rights and permissions
About this article
Cite this article
Agarwal, P., Sharir, M. & Welzl, E. The Discrete 2-Center Problem . Discrete Comput Geom 20, 287–305 (1998). https://doi.org/10.1007/PL00009387
Issue Date:
DOI: https://doi.org/10.1007/PL00009387