Abstract
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.
Work by M. Katz and K. Kedem has been supported by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanities. K. Kedem has also been supported by the U.S.-Israeli Binational Science Foundation, and by the Mary Upson Award, College of Engineering, Cornell University.
Preview
Unable to display preview. Download preview PDF.
References
P. Agarwal and M. Sharir, “Planar geometric location problems”, Algorithmica 11 (1994), 185–195.
P. Agarwal, M. Sharir, E. Welzl, “The discrete 2-center problem”, Proc. 13th ACM Symp. on Computational Geometry, 147–155, 1997.
R. Cole, “Parallel merge sort”, SIAM J. Computing 17(4) (1988), 770–785.
M. de Berg, M. van Kreveld, M. Overmars and O. Schwartzkopf, Computational Geometry, Algorithms and Applications, Springer-Verlag, 1997.
L. Danzer and B. Grünbaum, “Intersection properties of boxes in Rd”, Combinatorica 2(3) (1982), 237–246.
O. Devillers and M. J. Katz, “Optimal line bipartitions of point sets”, Int. J. Comput. Geom. and Appls, to appear.
D. Eppstein, “Faster construction of planar two-centers”, Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 131–138, 1997.
G.N. Frederickson and D.B. Johnson, “Generalized selection and ranking: sorted matrices”, SIAM J. Computing 13 (1984), 14–30.
A. Glozman, K. Kedem and G. Shpitalnik, “Efficient solution of the two-line center problem and other geometric problems via sorted matrices”, Proc. 4th Workshop Algorithms Data Struct., Lecture Notes in Computer Science (955), 26–37, 1995.
J.W. Jaromczyk and M. Kowaluk, “Orientation independent covering of point sets in R2 with pairs of rectangles or optimal squares”, Proc. European Workshop on Computational Geometry, Lecture Notes in Computer Science (871), 71–78, 1996.
J.W. Jaromczyk and M. Kowaluk, “The two-line center problem from a polar view: A new algorithm and data structure”, Proc. 4th Workshop Algorithms Data Struct., Lecture Notes in Computer Science (955), 13–25, 1995.
M.J. Katz and F. Nielsen, “On piercing sets of objects”, Proc. 12th ACM Symp. on Computational Geometry, 113–121, 1996.
M.J. Katz and M. Sharir, “An expander-based approach to geometric optimization”, SIAM J. Computing 26 (1997), 1384–1408.
N. Megiddo, “Applying parallel computation algorithms in the design of serial algorithms”, J. ACM 30 (1983), 852–865.
K. Mehlhorn, Multi-dimensional Searching and Computational Geometry, in “Data Structures and Algorithms”, vol. 3, Springer-Verlag, 1984.
M.H. Overmars and J. van Leeuwen, “Maintenance of configurations in the plane”, J. Comput. Syst. Sci. 23 (1981), 166–204.
M. Segal, “On the piercing of axis-parallel rectangles and rings”, Proc. 5th European Symp. on Algorithms, Lecture Notes in Computer Science (1284), 430–442, 1997.
M. Sharir, “A near-linear algorithm for the planar 2-center problem”, Proc. 12th ACM Symp. on Computational Geometry, 106–112, 1996.
M. Sharir and P. Agarwal, Davenport-Shintzel sequences and their applications, Cambridge University Press, New-York, 1995.
M. Sharir and E. Welzl, “Rectilinear and polygonal p-piercing and p-center problems”, Proc. 12th ACM Symp. on Computational Geometry, 122–132, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katz, M.J., Kedem, K., Segal, M. (1998). Constrained square-center problems. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054358
Download citation
DOI: https://doi.org/10.1007/BFb0054358
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64682-2
Online ISBN: 978-3-540-69106-8
eBook Packages: Springer Book Archive