Rectilinear Static and Dynamic Discrete 2-center Problems

In this paper we consider several variants of the discrete 2- center problem. The problem is: Given a set S of n demand points and a set C of m supply points, find two "minimal" axis-parallel squares (or rectangles) centered at the points of C that cover all the points of S. We present efficient solutions for both the static and dynamic versions of the problem (i.e. points of S are allowed to be inserted or deleted) and also consider the problem in fixed d, d ≥ 3 dimensional space. For the static version in the plane we give an optimal algorithm.

[1]  Jerzy W. Jaromczyk,et al.  The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure , 1995, WADS.

[2]  Klara Kedem,et al.  On Some Geometric Selection and Optimization Problems via Sorted Matrices , 1995, WADS.

[3]  Micha Sharir,et al.  The Discrete 2-Center Problem , 1997, SCG '97.

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

[5]  C. Bajaj.  Geometric Optimization and Computational Complexity , 1984 .

[6]  Subhash Suri,et al.  Finding tailored partitions , 1989, SCG '89.

[7]  Michael Segal,et al.  Constrained Square-Center Problems , 1998, SWAT.

[8]  Z. Drezner.  On the rectangular p‐center problem , 1987 .

[9]  Bernard Chazelle,et al.  A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

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

[11]  Doron Nussbaum,et al.  Rectilinear p-piercing problems , 1997, ISSAC.

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

[13]  Micha Sharir,et al.  Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

[14]  Sergey Bereg,et al.  Covering a set of points by two axis-parallel boxes , 1997, CCCG.

[15]  Jerzy W. Jaromczyk,et al.  An efficient algorithm for the Euclidean two-center problem , 1994, SCG '94.

[16]  Micha Sharir,et al.  An expander-based approach to geometric optimization , 1993, SCG '93.

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

[18]  Chanderjit Bajaj.  Geometric optimization and computational complexity (algebra, algorithms, robotics) , 1984 .

[19]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .