Stronger bounds for weak epsilon-nets in higher dimensions
Natan Rubin
2021Year
1Citations
2Top-tier citations
Abstract
Given a finite point set P in R d , and ϵ > 0 we say that N ⊆ R d is a weak ϵ-net if it pierces every convex set K with |K ∩ P | ≥ ϵ|P |. We show that for any finite point set in dimension d ≥ 3, and any ϵ > 0, one can construct a weak ϵ-net whose cardinality is To be precise, our weak ϵ-net has cardinality O 1 ϵ α d +γ for any γ > 0, with This is the first significant improvement of the bound of Õ 1 ϵ d that was obtained in 1993 by Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point sets in dimension d ≥ 3.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Improved Bounds for Point Selections and Halving Hyperplanes in Higher DimensionsNatan RubinSODA 2024 · 1 citation
- Halving by a Thousand Cuts or PuncturesSariel Har-Peled, Da Wei ZhengSODA 2023
Builds on2
Related papers
- Online epsilon Net & Piercing Set for Geometric ConceptsSujoy Bhore, Devdan Dey, Satyam SinghICLR 2025
- On Lines Crossing Pairwise Intersecting Convex Sets in Three DimensionsNatan RubinSODA 2026
- Chasing Convex Bodies OptimallyMark SellkeSODA 2020 · 36 citations
- Fast Approximation Algorithms for Piercing Boxes by PointsPankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros SintosSODA 2024 · 1 citation
- Optimal Bound on the Combinatorial Complexity of Approximating PolytopesRahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. MountSODA 2020
