Dynamic Conflict-Free Colorings in the Plane

Authors Mark de Berg, Aleksandar Markovic

Thumbnail PDF


  • Filesize: 488 kB
  • 13 pages

Document Identifiers

Author Details

Mark de Berg
Aleksandar Markovic

Cite AsGet BibTex

Mark de Berg and Aleksandar Markovic. Dynamic Conflict-Free Colorings in the Plane. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 27:1-27:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


We study dynamic conflict-free colorings in the plane, where the goal is to maintain a conflict-free coloring (CF-coloring for short) under insertions and deletions. - First we consider CF-colorings of a set S of unit squares with respect to points. Our method maintains a CF-coloring that uses O(log n) colors at any time, where n is the current number of squares in S, at the cost of only O(log n) recolorings per insertion or deletion We generalize the method to rectangles whose sides have lengths in the range [1, c], where c is a fixed constant. Here the number of used colors becomes O(log^2 n). The method also extends to arbitrary rectangles whose coordinates come from a fixed universe of size N, yielding O(log^2 N log^2 n) colors. The number of recolorings for both methods stays in O(log n). - We then present a general framework to maintain a CF-coloring under insertions for sets of objects that admit a unimax coloring with a small number of colors in the static case. As an application we show how to maintain a CF-coloring with O(log^3 n) colors for disks (or other objects with linear union complexity) with respect to points at the cost of O(log n) recolorings per insertion. We extend the framework to the fully-dynamic case when the static unimax coloring admits weak deletions. As an application we show how to maintain a CF-coloring with O(sqrt(n) log^2 n) colors for points with respect to rectangles, at the cost of O(log n) recolorings per insertion and O(1) recolorings per deletion. These are the first results on fully-dynamic CF-colorings in the plane, and the first results for semi-dynamic CF-colorings for non-congruent objects.
  • Conflict-free colorings
  • Dynamic data structures


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, and Saurabh Ray. Conflict-free coloring for rectangle ranges using o(n^.382) colors. Discrete & Computational Geometry, 48(1):39-52, 2012. URL: http://dx.doi.org/10.1007/s00454-012-9425-5.
  2. Boris Aronov, Mark de Berg, Esther Ezra, and Micha Sharir. Improved bounds for the union of locally fat objects in the plane. SIAM Journal on Computing, 43:534-572, 2014. Google Scholar
  3. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, and Shakhar Smorodinsky. Online conflict-free colouring for hypergraphs. Combinatorics, Probability & Computing, 19(4):493-516, 2010. URL: http://dx.doi.org/10.1017/S0963548309990587.
  4. Jon Louis Bentley and James B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, 1(4):301-358, 1980. Google Scholar
  5. Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, and Shakhar Smorodinsky. Strong conflict-free coloring for intervals. Algorithmica, 70(4):732-749, 2014. URL: http://dx.doi.org/10.1007/s00453-014-9929-x.
  6. Ke Chen. How to play a coloring game against a color-blind adversary. In Proceedings of the 22nd ACM Symposium on Computational Geometry, pages 44-51, 2006. URL: http://dx.doi.org/10.1145/1137856.1137865.
  7. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jiří Matoušek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, and Emo Welzl. Online conflict-free coloring for intervals. SIAM Journal on Computing, 36(5):1342-1359, 2007. URL: http://dx.doi.org/10.1137/S0097539704446682.
  8. Ke Chen, Haim Kaplan, and Micha Sharir. Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Transactions on Algorithms, 5(2):16:1-16:24, 2009. URL: http://dx.doi.org/10.1145/1497290.1497292.
  9. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 3rd edition, 2009. Google Scholar
  10. Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd ed. edition, 2008. Google Scholar
  11. Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, and Gerhard Woeginger. Dynamic and kinetic conflict-free coloring of intervals with respect to points. In Proceedings of the 28th International Symposium on Algorithms and Computation, 2017. Google Scholar
  12. Mark de Berg and Aleksandar Markovic. Dynamic conflict-free colorings in the plane. CoRR, abs/1709.10466, 2017. Google Scholar
  13. Robert P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51(1):161-166, 1950. URL: http://www.jstor.org/stable/1969503.
  14. Guy Even, Zvi Lotker, Dana Ron, and Shakhar Smorodinsky. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM Journal on Computing, 33(1):94-136, 2003. URL: http://dx.doi.org/10.1137/S0097539702431840.
  15. Sariel Har-Peled and Shakhar Smorodinsky. Conflict-free coloring of points and simple regions in the plane. Discrete & Computational Geometry, 34(1):47-70, 2005. URL: http://dx.doi.org/10.1007/s00454-005-1162-6.
  16. Elad Horev, Roi Krakovski, and Shakhar Smorodinsky. Conflict-free coloring made stronger. In Proceedings ot the 12th Scandinavian Symposium and Workshops on Algorithm Theory, pages 105-117, 2010. URL: http://dx.doi.org/10.1007/978-3-642-13731-0_11.
  17. Shakhar Smorodinsky. Combinatorial Problems in Computational Geometry. PhD thesis, Tel-Aviv University, 2003. Google Scholar
  18. Shakhar Smorodinsky. Conflict-free coloring and its applications. CoRR, abs/1005.3616, 2010. URL: http://arxiv.org/abs/1005.3616.