The 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(n4/3 log5 n).

Full Text

Duke Authors

Cited Authors

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

Published Date

  • January 1, 1998

Published In

Volume / Issue

  • 20 / 3

Start / End Page

  • 287 - 305

International Standard Serial Number (ISSN)

  • 0179-5376

Digital Object Identifier (DOI)

  • 10.1007/PL00009387

Citation Source

  • Scopus