论文信息 - A Faster Algorithm for the Two-Center Decision Problem

A Faster Algorithm for the Two-Center Decision Problem

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.

John Hershberger

[1] Micha Sharir,et al. Planar geometric location problems and maintaining the width of a planar set , 1991, SODA '91.

[2] Gerhard J. Woeginger,et al. Geometric Clusterings , 1991, J. Algorithms.

[3] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[4] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[5] Subhash Suri,et al. Finding Tailored Partitions , 1991, J. Algorithms.

[6] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..