Abstract
Given a class \({\mathcal C}\) of geometric objects and a point set P, a \({\mathcal C}\)-matching of P is a set M = {C 1, ...,C k } of elements of \({\mathcal C}\) such that each C i contains exactly two elements of P. If all of the elements of P belong to some C i , M is called a perfect matching; if in addition all the elements of M are pairwise disjoint we say that this matching M is strong. In this paper we study the existence and properties of \({\mathcal C}\)-matchings for point sets in the plane when \({\mathcal C}\) is the set of circles or the set of isothetic squares in the plane.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Czyzowicz, J., Rivera-Campo, E., Urrutia, J., Zaks, J.: Guarding rectangular art galleries. Discrete Mathematics 50, 149–157 (1994)
Dillencourt, M.: Toughness and Delaunay Triangulations. Discrete and Computational Geometry 5(6), 575–601 (1990); Preliminary version in Proc. of the 3rd Annual Symposium on Computational Geometry, Waterloo, pp. 186–194 (1987)
Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The Rectangle of Influence Drawability Problem. Discrete and Computational Geometry 5(6), 575–601 (1990)
Pach, J. (ed.): Towards a Theory of Geometric Graphs, Amer. Math. Soc., Contemp. Math. Series, p. 342 (2004)
Preparata, F.P., Shamos, M.I.: Computational Geometry. An Introduction. Springer, Heidelberg (1995)
Sharir, M.: On k-Sets in Arrangements of Curves and Surfaces. Discrete and Computational Geometry 6, 593–613 (1991)
Tutte, W.T.: A theorem on planar graphs. Trans. Amer. Math. Soc. 82, 99–116 (1956)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ábrego, B.M. et al. (2005). Matching Points with Circles and Squares. In: Akiyama, J., Kano, M., Tan, X. (eds) Discrete and Computational Geometry. JCDCG 2004. Lecture Notes in Computer Science, vol 3742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589440_1
Download citation
DOI: https://doi.org/10.1007/11589440_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30467-8
Online ISBN: 978-3-540-32089-0
eBook Packages: Computer ScienceComputer Science (R0)