An Efficient Algorithm for the Euclidean Two-Center Problem

@inproceedings{Jaromczyk1994AnEA,
  title={An Efficient Algorithm for the Euclidean Two-Center Problem},
  author={Jerzy W. Jaromczyk and Miroslaw Kowaluk},
  booktitle={Symposium on Computational Geometry},
  year={1994}
}
We present a new algorithm for the two-center problem: “Given a set <italic>S</italic> of <italic>n</italic> points in the real plane, find two closed discs whose union contains all of the points and the radius of the larger disc is minimized.” An almost quadratic <italic>O</italic>(<italic>n</italic><supscrpt>2</supscrpt>log<italic>n</italic>) solution is given. The previously best known algorithms for the two-center problem have time complexity <italic>O</italic>(<italic>n</italic><supscrpt>2… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS