Construction of ɛ-nets
- 1 October 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (5) , 427-448
- https://doi.org/10.1007/bf02187804
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- An Optimal-Time Algorithm for Slope SelectionSIAM Journal on Computing, 1989
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- More onk-sets of finite sets in the planeDiscrete & Computational Geometry, 1986
- Constructing Belts in Two-Dimensional Arrangements with ApplicationsSIAM Journal on Computing, 1986
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971