Weak ε-nets for points on a hypersphere

Discrete and Computational Geometry

Volumn 18, Issue 1, 1997, Pages 83-91

  Bradford, P G ^a   Capoyleas, V ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040601070     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009309     Document Type: Article

References (19)

1. N. Alon, I. Bárány, Z. Füredi, and D. Kleitman. Point selections and weak ε-nets for convex hulls. Combin. Probab. Comput. 1 (1992), 189-200.
2. N. Alon and J. Spencer. The Probabilistic Method. Wiley, New York, 1992.
3. J. Beck and W. Chen. Irregularities of Distributions. Cambridge Tracts in Mathematics, Vol. 89. Cambridge University Press, Cambridge, 1987.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. Assoc. Comput. Mach. 36 (1989), 929-965.
5. V. Capoyleas. An upper bound for weak ε-nets of points on a circle. In: Intuitive Geometry (K. Böröczky and G. Fejes Tóth, eds.). Coll. Math. Soc. J. Bolyai, vol. 63. North-Holland, 1994, pp. 63-66.
6. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, and E. Welzl. Improved bounds on weak ε-nets for convex sets. In: Proceedings of the Symposium on the Theory of Computing (STOC), vol. 25. ACM Press, New York, 1993, pp. 495-504.
7. B. Chazelle and E. Welzl. Quasi-optimal range searching and VC-dimensions. Discrete Comput. Geom. 4 (1989), 467-490.
8. H. T. Croft, K. J. Falconer, and R. K. Guy. Unsolved Problems in Geometry. Unsolved Problems in Intuitive Mathematics, vol. 2. Springer-Verlag, New York, 1991.
9. E. Danzer. Personal Communication.
10. R. Dudley. Central limit theorems for empirical measures. Ann. Probab. 6 (1978), 899-929.
11. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol. 2. Springer-Verlag, New York, 1988.
12. D. Haussler and E. Welzl. ε-Nets and simplex range queries. Discrete Comput. Geom. 2 (1987), 127-151.
13. J. Komlós, J. Pach, and G. Woeginger. Almost tight bounds for ε-nets. Discrete Comput. Geom. 7 (1992), 163-173.
14. J. Matoušek. Epsilon-nets and computational geometry. In: New Trends in Discrete and Computational Geometry (J. Pach, ed.), Chapter 3. Algorithms and Combinatrics, vol. 10. Springer-Verlag, New York, 1993.
15. J. Matoušek, R. Seidel, and E. Welzl. How to net a lot with a little: Small ε-nets for disks and halfspaces. In: Proceedings of ACM Symp. Comput. Geom., vol. 6. ACM Press, New York, 1990, pp. 16-22.
16. K. Mulmuley. Computational Geometry - An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.
17. J. Pach and G. Woeginger. Some new bounds for epsilon-nets. In: Proceedings of the 6th Comput. Geom. Conf. ACM Press, New York, 1990, pp. 10-15.
18. M. Sharir and P. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge, 1995.
19. R. Wenocur and R. Dudley. Some Vapnik-Chervonenkis classes. Discrete Math. 33 (1981), 313-318.