Epsilon-Nets and Computational Geometry
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- Partitioning arrangements of lines I: An efficient deterministic algorithmDiscrete & Computational Geometry, 1990
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- Densité et dimensionAnnales de l'institut Fourier, 1983