Discrete 2-center problem

Journal Article

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 log n). 4/3 5

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Sharir, M; Welzl, E

Published Date

  • January 1, 1997

Published In

  • Proceedings of the Annual Symposium on Computational Geometry

Start / End Page

  • 147 - 155

Digital Object Identifier (DOI)

  • 10.1145/262839.262921

Citation Source

  • Scopus