Conflict-Free Coloring of Points and Simple Regions in the Plane
- First Online:
- Cite this article as:
- Har-Peled, S. & Smorodinsky, S. Discrete Comput Geom (2005) 34: 47. doi:10.1007/s00454-005-1162-6
- 85 Views
We study conflict-free colorings, where the underlying set systems arise in geometry. Our main result is a general framework for conflict-free coloring of regions with low union complexity. A coloring of regions is conflict-free if for any covered point in the plane, there exists a region that covers it with a unique color (i.e., no other region covering this point has the same color). For example, we show that we can conflict-free color any family of n pseudo-discs with O(log n) colors.