Guarding galleries where every point sees a large area

Israel Journal of Mathematics

Volumn 101, Issue , 1997, Pages 125-139

  Kalai, Gil ^a,b   Matoušek, Jiří ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013546785     PISSN: 00212172     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02760925     Document Type: Article

References (18)

1. N. Alon and D. Kleitman, Piercing convex sets and the Hadwiger Debrunner (p, q) problem, Advances in Mathematics 96 (1992), 103-112.
2. P. Assouad, Densite et dimension, Annales de l'Institut Fourier (Grenoble) 33 (1983), 233-282.
3. A. Broder, M. Dyer, A. Frieze, P. Raghavan and E. Upfal, unpublished.
4. J. Eckhoff, Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen, Journal für die reine und angewandte Mathematik 313 (1980), 171-188.
5. H. Everett, Visibility graph recognition, PhD thesis, Technical Report 231/90, University of Toronto, 1990.
6. D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, Discrete and Computational Geometry 2 (1987), 127-151.
7. E. Hlawka, J. Schoißengeier and R. Taschner, Geometric and Analytic Number Theory, Springer-Verlag, Berlin, 1991.
8. L. Kavraki, J-C. Latombe, R. Motwani and P. Raghavan, Randomized processing in robot path planning, Proceedings of the 27th ACM Symposium on Theoretical Computation, 1995, pp. 353-362.
9. J. Molnár, Über den zweidimensionalen topologischen Satz von Helly, Matematikai Lapok 8 (1957), 108-114.
10. J. Nešetřil and V. Rödl, Simple proof of the existence of restricted Ramsey graphs by means of a partite construction, Combinatorica 1 (1981), 199-202.
11. J. O'Rourke, Computational geometry column 18, International Journal of Computational Geometry and Applications 3 (1993), 107-113; also in SIGACT News 24:1 (1993), 20-25.
12. J. O'Rourke, Computational geometry column 18, International Journal of Computational Geometry and Applications 3 (1993), 107-113; also in SIGACT News 24:1 (1993), 20-25.
13. W. Rudin, Functional Analysis, 2nd edn., McGraw-Hill, New York, 1991.
14. N. Sauer, On the density of families of sets, Journal of Combinatorial Theory. Series A 13 (1972), 145-147.
15. S. Shelah, A combinatorial problem, stability and order for models and theories in infinitary languages, Pacific Journal of Mathematics 41 (1972), 247-261.
16. T. Shermer, Several short results in the combinatorics of visibility, Technical Report 91-02, School of Computing Science, Simon Fraser University, British Columbia.
17. P. Valtr, Guarding galleries where no point sees a small area, KAM Series (technical report) 96-305, Department of Applied Mathematics, Charles University, Prague, 1996.
18. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory of Probability and its Applications 16 (1971), 264-280.