Covering and piercing disks with two centers

We give exact and approximation algorithms for two-center problems when the input is a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in D intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks.

[1]  Kyung-Yong Chwa,et al.  Two-Center Problems for a Convex Polygon (Extended Abstract) , 1998, ESA.

[2]  Maarten Löffler,et al.  Largest bounding box, smallest diameter, and related problems on imprecise points , 2007, Comput. Geom..

[3]  Timothy M. Chan.  More planar two-center algorithms , 1999, Comput. Geom..

[4]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

[5]  Micha Sharir.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1997, Discret. Comput. Geom..

[6]  Kyung-Yong Chwa,et al.  Two-center problems for a convex polygon , 1998 .

[7]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[8]  Pankaj K. Agarwal,et al.  Exact and Approximation Algortihms for Clustering , 1997 .

[9]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[10]  Nimrod Megiddo.  On the ball spanned by balls , 1989, Discret. Comput. Geom..

[11]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[12]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[13]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[14]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[15]  Bernd Gärtner,et al.  The smallest enclosing ball of balls: combinatorial structure and algorithms , 2003, SCG '03.

[16]  Michael T. Goodrich,et al.  Fixed-dimensional parallel linear programming via relative ε-approximations , 1996, SODA '96.

[17]  Zvi Drezner,et al.  The Planar Two-Center and Two-Median Problems , 1984, Transp. Sci..

[18]  Timothy M. Chan.  Deterministic algorithms for 2-d convex programming and 3-d online linear programming , 1997, SODA '97.