On visibility and covering by convex sets

Israel Journal of Mathematics

Volumn 113, Issue , 1999, Pages 341-379

  Matoušek, Jiří ^a   Valtr, Pavel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033482659     PISSN: 00212172     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02780184     Document Type: Article

References (12)

1. M. Breen and D. C. Kay, General decomposition theorems for m-convex sets in the plane, Israel Journal of Mathematics 24 (1976), 217-233.
2. R. P. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161-166.
3. H. G. Eggleston, A condition for a compact plane set to be a union of finitely many convex sets, Proceedings of the Cambridge Philosophical Society 76 (1974), 61-66.
4. P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463-470.
5. A. Gyarfás, Problems from the world surrounding perfect graphs, Zastosowonia Matematyki 19 (1987), 413-441.
6. n, Israel Journal of Mathematics 8 (1971), 39-52.
7. M. Kojman, M. Perles and S. Shelah, Sets in a Euclidean space which are not a countable union of convex subsets, Israel Journal of Mathematics 70 (1990), 313-342.
8. J. Lawrence, W. Hare, Jr., and J. Kenelly, Finite unions of convex sets, Proceedings of the American Mathematical Society 34 (1972), 225-228.
9. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
10. [O'R87] J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
11. 6 convex sets, Israel Journal of Mathematics 70 (1990), 305-312.
12. F. Valentine, A three-point convexity property, Pacific Journal of Mathematics 34 (1957), 1227-1235.