Constrained Square-Center Problems

Given a set P of n points in the plane, we seek two squares whose center points belong to P, their union contains P, and the area of the larger square is minimal. We present efficient algorithms for three variants of this problem: In the first the squares axe axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free to rotate independently.

[1]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Mark H. Overmars,et al.  Maintenance of configurations in the plane (revised edition) , 1981 .

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

[4]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[5]  Michael Segal.  On Piercing Sets of Axis-Parallel Rectangles and Rings , 1997, ESA.

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

[7]  Frank Nielsen,et al.  On piercing sets of objects , 1996, SCG '96.

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

[9]  Kurt Mehlhorn,et al.  Multi-dimensional searching and computational geometry , 1984 .

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

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

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

[13]  Matthew J. Katz,et al.  Optimal Line Bipartitions of Point Sets , 1999, Int. J. Comput. Geom. Appl..

[14]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[15]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[17]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[18]  Branko Grünbaum,et al.  Intersection properties of boxes in Rd , 1982, Comb..

[19]  Micha Sharir,et al.  An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..

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

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