Almost tight bounds forɛ-Nets
- 1 February 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 7 (2) , 163-173
- https://doi.org/10.1007/bf02187833
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Partitioning arrangements of lines I: An efficient deterministic algorithmDiscrete & Computational Geometry, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Construction of epsilon netsPublished by Association for Computing Machinery (ACM) ,1989
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Covering the plane with convex polygonsDiscrete & Computational Geometry, 1986
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971