Coloring geometric range spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4957 LNCS, Issue , 2008, Pages 146-157

  Aloupis, Greg ^a,b   Cardinal, Jean ^a,b   Collette, Sébastien ^a,b   Langerman, Stefan ^a,b   Smorodinsky, Shakhar ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b Communauté Française de Belgique ARC ^*

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROBLEM SOLVING; SINGULAR VALUE DECOMPOSITION; COLOR; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS);

GEOMETRIC RANGE SPACES; HALFSPACES; COLOR REGIONS; HALF-SPACES; INFORMATICS; K POINTS; LATIN AMERICAN; RANGE SPACES; UPPER BOUNDS;

COMPUTATIONAL GEOMETRY; OPTICAL PROPERTIES;

EID: 43049122777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_13     Document Type: Conference Paper

References (15)

1. Aigner, M., Ziegler, G.M.: Proofs from the book. Springer, Heidelberg (1998)
2. Buchsbaum, A., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2007) (2007)
3. Chan, T.M.: Low-dimensional linear programming with violations. SIAM Journal on Computing 34(4), 879-893 (2005)
4. Chen, X., Pach, J., Szegedy, M., Tardos, G.: Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles (manuscript, 2006)
5. Lick, D.R., White, A.T.: k-degenerate graphs. Canadian Journal on Mathematics 12, 1082-1096 (1970)
6. Pach, J.: Decomposition of multiple packing and covering. In: 2. Kolloq. über Diskrete Geom., Inst. Math. Univ. Salzburg, pp. 169-178 (1980)
7. Pach, J.: Personal communication (2007)
8. Pach, J., Tardos, G.: Personal communication (2006)
9. 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)
10. Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. In: Proc. of the 23rd ACM Symposium on Computational Geometry, pp. 133-137 (2007)
11. Sharir, M.: On k-sets in arrangement of curves and surfaces. Discrete & Computational Geometry 6, 593-613 (1991)
12. Smorodinsky, S.: On the chromatic number of some geometric hypergraphs. SIAM Journal on Discrete Mathematics (to appear)
13. Smorodinsky, S., Sharir, M.: Selecting points that are heavily covered by pseudocircles, spheres or rectangles. Combinatorics, Probability and Computing 13(3), 389-411 (2004)
14. Tucker, A.: Coloring a family of circular arcs. SIAM Journal of Applied Mathematics 229(3), 493-502 (1975)
15. Tukey, J.: Mathematics and the picturing of data. In: Proceedings of the International Congress of Mathematicians, vol. 2, pp. 523-531 (1975)