Computing k-Centers On a Line

In this paper we consider several instances of the k-center on a line problem where the goal is, given a set of points S in the plane and a parameter k >= 1, to find k disks with centers on a line l such that their union covers S and the maximum radius of the disks is minimized. This problem is a constraint version of the well-known k-center problem in which the centers are constrained to lie in a particular region such as a segment, a line, and a polygon. We first consider the simplest version of the problem where the line l is given in advance; we can solve this problem in O(n log^2 n) time. We then investigate the cases where only the orientation of the line l is fixed and where the line l can be arbitrary. We can solve these problems in O(n^2 log^2 n) time and in O(n^4 log^2 n) expected time, respectively. For the last two problems, we present (1 + e)-approximation algorithms, which run in O((1/e) n log^2 n) time and O((1/e^2) n log^2 n) time, respectively.

[1]  Dan Halperin,et al.  Improved construction of vertical decompositions of three-dimensional arrangements , 2002, SCG '02.

[2]  Prosenjit Bose,et al.  Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications , 1996, Proceedings of CG International '96.

[3]  Jirí Matousek,et al.  Randomized Optimal Algorithm for Slope Selection , 1991, Inf. Process. Lett..

[4]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

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

[6]  Esther M. Arkin,et al.  Minimum-cost coverage of point sets by disks , 2006, SCG '06.

[7]  Nimrod Megiddo.  On the Complexity of Some Geometric Problems in Unbounded Dimension , 1990, J. Symb. Comput..

[8]  Endre Szemerédi,et al.  An Optimal-Time Algorithm for Slope Selection , 1989, SIAM J. Comput..

[9]  William L. Steiger,et al.  Randomizing Optimal Geometric Algorithms , 1993, CCCG.

[10]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[11]  Frank Nielsen,et al.  Maintenance of a Piercing Set for Intervals with Applications , 2000, Algorithmica.

[12]  Greg N. Frederickson,et al.  Optimal algorithms for tree partitioning , 1991, SODA '91.

[13]  Sandip Das,et al.  Variations of Base-Station Placement Problem on the Boundary of a Convex Region , 2008, Int. J. Found. Comput. Sci..

[14]  Prosenjit Bose,et al.  Smallest enclosing circle centered on a query line segment , 2008, CCCG.

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

[16]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[17]  Timothy M. Chan.  Geometric Applications of a Randomized Optimization Technique , 1998, SCG '98.

[18]  Tammy Drezner,et al.  Competitive Facility Location in the Plane , 1995 .

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

[20]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[21]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[22]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

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

[24]  Timothy M. Chan,et al.  Approximating the piercing number for unit-height rectangles , 2005, CCCG.

[25]  Richard C. T. Lee,et al.  The slab dividing approach to solve the EuclideanP-Center problem , 2005, Algorithmica.

[26]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[27]  Sandip Das,et al.  Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone , 2005, ICDCIT.