$\varepsilon $ ε -Mnets: Hitting Geometric Set Systems with Subsets
- 8 December 2016
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 57 (3) , 625-640
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and BoxesSIAM Journal on Computing, 2010
- State of the union (of geometric objects)2008
- How hard is half-space range searching?Discrete & Computational Geometry, 1993
- Reporting points in halfspacesComputational Geometry, 1992
- Efficient partition treesDiscrete & Computational Geometry, 1992
- Almost tight bounds forɛ-NetsDiscrete & Computational Geometry, 1992
- Convex bodies, economic cap coverings, random polytopesMathematika, 1988
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean spaceMathematika, 1970
- A Theorem on Non-Homogeneous LatticesAnnals of Mathematics, 1952