A faster algorithm for the two-center decision problem

https://doi.org/10.1016/0020-0190(93)90153-ZGet rights and content

Abstract

The planar two-center decision problem can be stated as follows: Given a set of n points in the plane and two radii r1 and r2, determine whether the points can be covered by two disks of the specified radii. This note presents an O(n2) algorithm for the problem, which improves the previous O(n2 log n) algorithm.

References (7)

There are more references available in the full text version of this article.

Cited by (0)

View full text