A Near-Linear Algorithm for the Planar 2-Center Problem

@inproceedings{Sharir1996ANA,
  title={A Near-Linear Algorithm for the Planar 2-Center Problem},
  author={Micha Sharir},
  booktitle={Symposium on Computational Geometry},
  year={1996}
}
We present an 0( n logg n)-time algorithm for computing the 2-center of a set S of n points in the plane (that is, a pair of congruent disks of smallest radius whose union covers S), improving the previous 0( nz log n)time algorithm of [9]. The 2-Center Problem Let S be a set of n points in the plane. The i?-center problem for S is to cover S by (the union of) two congruent closed disks whose radius is as small as possible. This is a special case of the general p-center problem, where we wish… CONTINUE READING

Similar Papers

Loading similar papers…