Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions
Abstract Given a finite point set P in $$\mathbb {R}^d$$ R d , and $$\epsilon >0$$ ϵ > 0 we say that $$N\subseteq \mathbb {R}^d$$ N ⊆ R d is a weak $$\epsilon $$ ϵ -net if it pierces every convex set K with $$|K\cap P|\ge \epsilon |P|$$ | K ∩ P | ≥ ϵ | P | . We show that for any finite point set in dimension $$d\ge 3$$ d ≥ 3 , and any $$\epsilon >0$$ ϵ > 0 , one can construct a weak $$\epsilon $$ ϵ -net whose cardinality is $$\displaystyle O^*\left( \frac{1}{\epsilon ^{2.558}}\right) $$ O ∗ 1 ϵ 2.558 in dimension $$d=3$$ d = 3 , and $$\displaystyle o\left( \frac{1}{\epsilon ^{d-1/2}}\right) $$ o 1 ϵ d - 1 / 2 in all dimensions $$d\ge 4$$ d ≥ 4 . (In the sequel, the $$O^*(x)$$ O ∗ ( x
Authors
- Natan Rubin (ORCID: https://orcid.org/0000-0002-7463-6728)
Institutions
- Ben-Gurion University of the Negev (IL)
Publication Details
- Journal
- Discrete & Computational Geometry
- Published
- 2026-11-06
- DOI
- https://doi.org/10.1007/s00454-026-00878-y
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- European Commission
- Israel Science Foundation
- Ben-Gurion University of the Negev
- FP7 Ideas: European Research Council