Abstract
For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by precisely r members of the family, all of which have the same color. For r = 2, this answers a question of S. Smorodinsky [S06].
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
Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-free coloring for rectangle ranges using \(\tilde{O}(n^{.382}+\epsilon)\) colors. In: Proc. 19th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 181–187 (2007)
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Geometric range spaces colorings (manuscript)
Brass, P., Pach, J., Moser, W.: Research Problems in Discrete Geometry. Springer, Berlin (2005)
Chen, X., Pach, J., Szegedy, M., Tardos, G.: Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Structures and Algorithms (submitted)
Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict–free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J. Comput. 33, 94–136 (2003)
Har-Peled, S., Smorodinsky, S.: Conflict-free coloring of points and simple regions in the plane. Discrete and Computational Geometry 34, 47–70 (2005)
Keszegh, B.: Weak conflict-free colorings of point sets and simple regions. In: Canad. Conf. on Computational Geometry (CCCG 2007), Ottawa (2007)
Kříž, I., Nešetřil, J.: Chromatic number of Hasse diagrams, eyebrows and dimension. Order 8, 41–48 (1991)
Mani-Levitska, P., Pach, J.: Decomposition problems for multiple coverings with unit balls, (manuscript) (1987), http://www.math.nyu.edu/pach/publications/unsplittable.pdf
Matoušek, J., Přívětivý, A.: The minimum independence number of a Hasse diagram. Combinatorics, Probability and Computing 15, 473–475 (2006)
Pach, J.: Decomposition of multiple packing and covering. Kolloquium über Diskrete Geometrie, pp. 169–178. Salzburg (1980)
Pach, J.: Covering the plane with convex polygons. Discrete and Computational Geometry 1, 73–81 (1986)
Pach, J., Tardos, G., Tóth, G.: Indecomposable coverings. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol. 4381, pp. 135–148. Springer, Heidelberg (2007)
Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. In: Proc. 23rd ACM Symposium on Computational Geometry, pp. 133–137. ACM Press, New York (2007)
Smorodinsky, S.: On the chromatic number of some geometric hypergraphs. In: Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2006), pp. 316–323. ACM Press, New York (2006)
Tardos, G., Tóth, G.: Multiple coverings of the plane with triangles. Discrete and Computational Geometry 38, 443–450 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pach, J., Tardos, G. (2008). Coloring Axis-Parallel Rectangles. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)