Conflict-free coloring of points and simple regions in the plane

Discrete and Computational Geometry

Volumn 34, Issue 1, 2005, Pages 47-70

  Har Peled, Sariel ^a   Smorodinsky, Shakhar ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22544437596     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-005-1162-6     Document Type: Article

References (19)

1. [AKS] N. Alon, M. Krivelevich, and B. Sudakov. Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser: B, 77:73-82, 1998.
2. [AS] N. Alon and J. H. Spencer. The Probabilistic Method, 2nd edn. Wiley Interscience, New York, 2000.
3. [BKOS] M. De Berg, M. Van Kreveld, M. H. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications, 2nd edn. Springer-Verlag, New York, 2000.
4. [C] B. Chazelle. The Discrepancy Method. Cambridge University Press, Cambridge, 2000.
5. [CS] K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
6. [Ef] A.Efrat. The complexity of the union of (α, β)-covered objects. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 134-142, 1999.
7. [ELRS] G. Even, Z. Lotker, D. Ron, and S. Smorodinsky. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J. Comput., 33(1):94-136. 2003.
8. [Er] J. Erickson. Nice point sets can have nasty delaunay triangulations. Discrete Comput. Geom., 30(1):109-132, 2003.
9. [ES] A. Efrat and M. Sharir. On the complexity of the union of fat convex objects in the plane. Discrete Comput. Geom., 23:171-189, 2000.
10. [HW] D. Haussler and E. Welzl. Nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
11. [KLPS] K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
12. [Ma] J. Matoušek. Geometric Discrepancy. Springer-Verlag, New York, 1999.
13. [Mu] K. Mulmuley. Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994.
14. [PA] J. Pach and P. K. Agarwal. Combinatorial Geometry. Wiley, New York, 1995.
15. [PT] J. Pach and G. Tóth. Conflict free colorings. In Discrete and Computational Geometry, The Goodman-Pollack Festschrift, pages 665-671. Springer-Verlag, Heidelberg, 2003.
16. [Sa] N. Sauer. On the density of families of sets. J. Combin. Theory Ser. A, 13:145-147, 1972.
17. [SA] M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
18. [Sm] S. Smorodinsky. Combinatorial Problems in Computational Geometry. Ph.D. thesis, School of Computer Science, Tel Aviv University, Tel Aviv, 2003.
19. [W] D. B. West. Introduction to Graph Theory, 2nd edn., Prentice-Hall, Englewood Cliffs, NJ, 2001.