A lower bound for weak epsi;-nets in high dimension

Discrete and Computational Geometry

Volumn 28, Issue 1, 2002, Pages 45-48

  Matoušek, Jiří ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036665945     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0090-3     Document Type: Article

References (8)

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(3): 189-200, 1992.
2. N. Alon and D. Kleitman. Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem. Adv. in Math., 96(1):103-112, 1992.
3. I. Bárány and Z. Füredi. Computing the volume is difficult. Discrete Comput. Geom., 2:319-326, 1987.
4. Y. Benyamini and J. Lindenstrauss. Nonlinear Functional Analysis, Vol. I. Colloquium Publications 48. American Mathematical Society, Providence, RI, 1999.
5. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, and M. Simmonovits. Deterministic and randomized polynomial-time approximation of radii. To appear. Preliminary version in Proc. 39th IEEE Symposium on Foundations of Computer Science, 1998, pages 244-251.
6. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, and E. Welzl. Improved bounds on weak ε-nets for convex sets. Discrete Comput. Geom., 13:1-15, 1995.
7. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
8. J. Lindenstrauss and V. D. Milman. The local theory of normed spaces and its applications to convexity. In Handbook of Convex Geometry (P. M. Gruber and J. M. Wills, eds.), pages 1149-1220. North-Holland, Amsterdam, 1993.