\(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
From MaRDI portal
Publication:527442
DOI10.1007/s00454-016-9845-8zbMath1416.52002OpenAlexW2560714919MaRDI QIDQ527442
Publication date: 11 May 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-016-9845-8
Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (4)
The \(\varepsilon\)-\(t\)-net problem ⋮ Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning ⋮ Coloring Delaunay-edges and their generalizations ⋮ Tverberg theorems over discrete sets of points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple proof of the shallow packing lemma
- How hard is half-space range searching?
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- Reporting points in halfspaces
- Efficient partition trees
- A theorem on non-homogeneous lattices
- Optimal area-sensitive bounds for polytope approximation
- New Lower Bounds for ϵ-nets
- New existence proofs ε-nets
- Convex bodies, economic cap coverings, random polytopes
- Tight lower bounds for the size of epsilon-nets
- On the set multi-cover problem in geometric settings
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean space
- Geometric discrepancy. An illustrated guide
This page was built for publication: \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
