Guarding galleries where no point sees a small area

Israel Journal of Mathematics

Volumn 104, Issue , 1998, Pages 1-16

  Valtr, Pavel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032438217     PISSN: 00212172     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02897056     Document Type: Article

References (7)

1. H. Edelsbrunner, Computational Geometry, Springer-Verlag, Berlin, 1987.
2. D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, Discrete and Computational Geometry 2 (1987), 127-151.
3. G. Kalai and J. Matoušek, Guarding galleries where every point sees a large area, Israel Journal of Mathematics 101 (1997), 125-139.
4. L. Kavraki, J-C. Latombe, R. Motwani and P. Raghavan, Randomized query processing in robot motion planning, Proceedings of the 27th ACM Symposium on Theoretical Computation, 1995.
5. J. Komlós, J. Pach and G. Woeginger, Almost tight bounds for ∈-nets, Discrete and Computational Geometry 7 (1992), 163-173.
6. P. Valtr, On galleries with no bad points, submitted.
7. 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.