Abstract
We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at any time, any sequence of p(k) consecutive points, for some function p, contains at least one point of each color.
We prove that no such function p(k) exists in general. However, in the restricted case in which points appear gradually, but never disappear, we give a coloring algorithm guaranteeing the property at any time with p(k) = 3k − 2. This can be interpreted as coloring point sets in ℝ2 with k colors such that any bottomless rectangle containing at least 3k − 2 points contains at least one point of each color. Here a bottomless rectangle is an axis-aligned rectangle whose bottom edge is below the lowest point of the set. For this problem, we also prove a lower bound p(k) > ck, where c > 1.67. Hence, for every k there exists a point set, every k-coloring of which is such that there exists a bottomless rectangle containing ck points and missing at least one of the k colors.
Chen et al. (2009) proved that no such function p(k) exists in the case of general axis-aligned rectangles. Our result also complements recent results from Keszegh and Pálvölgyi on cover-decomposability of octants (2011, 2012).
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
Aloupis, G., Cardinal, J., Collette, S., Imahori, S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S., Taslakian, P.: Colorful strips. Graphs and Combinatorics 27(3), 327–339 (2011)
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. Discrete & Computational Geometry 44(3), 706–723 (2010)
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Coloring geometric range spaces. Discrete & Computational Geometry 41(2), 348–362 (2009)
Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer (2005)
Chen, X., Pach, J., Szegedy, M., Tardos, G.: Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct. Algorithms 34(1), 11–23 (2009)
Dean, A.M., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar k-visibility graphs. J. Graph Algorithms Appl. 11(1), 45–59 (2007)
Gibson, M., Varadarajan, K.R.: Optimally decomposing coverings with translates of a convex polygon. Discrete & Computational Geometry 46(2), 313–333 (2011)
Keszegh, B.: Weak conflict-free colorings of point sets and simple regions. In: CCCG, pp. 97–100 (2007)
Keszegh, B., Pálvölgyi, D.: Octants are cover-decomposable. Discrete & Computational Geometry 47(3), 598–609 (2012)
Keszegh, B., Pálvölgyi, D.: Octants are cover-decomposable into many coverings. CoRR, abs/1207.0672 (2012)
Pach, J.: Covering the plane with convex polygons. Discrete & Computational Geometry 1, 73–81 (1986)
Pach, J., Tardos, G.: Coloring axis-parallel rectangles. J. Comb. Theory, Ser. A 117(6), 776–782 (2010)
Pach, J., Tardos, G.: Tight lower bounds for the size of epsilon-nets. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry, SoCG 2011, pp. 458–463 (2011)
Pach, J., Tardos, G., Tóth, G.: Indecomposable coverings. In: CJCDGCGT, pp. 135–148 (2005)
Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. Comput. Geom. 42(2), 127–133 (2009)
Pálvölgyi, D.: Indecomposable coverings with concave polygons. Discrete & Computational Geometry 44(3), 577–588 (2010)
Pálvölgyi, D., Tóth, G.: Convex polygons are cover-decomposable. Discrete & Computational Geometry 43(3), 483–496 (2010)
Smorodinsky, S., Yuditsky, Y.: Polychromatic coloring for half-planes. J. Comb. Theory, Ser. A 119(1), 146–154 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asinowski, A. et al. (2013). Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. In: Dehne, F., Solis-Oba, R., Sack, JR. (eds) Algorithms and Data Structures. WADS 2013. Lecture Notes in Computer Science, vol 8037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40104-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-40104-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40103-9
Online ISBN: 978-3-642-40104-6
eBook Packages: Computer ScienceComputer Science (R0)