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 whe
ther the points can be covered by two disks of the specified radii. Th
is note presents an O(n2) algorithm for the problem, which improves th
e previous O(n2 log n) algorithm.