Stronger bounds for weak epsilon-nets in higher dimensions
Natan Rubin
2021年份
1被引次数
2顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Improved Bounds for Point Selections and Halving Hyperplanes in Higher DimensionsNatan RubinSODA 2024 · 被引用 1 次
- Halving by a Thousand Cuts or PuncturesSariel Har-Peled, Da Wei ZhengSODA 2023
它引用的顶会 Paper2
相关 Paper
- 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 次
- Fast Approximation Algorithms for Piercing Boxes by PointsPankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros SintosSODA 2024 · 被引用 1 次
- Optimal Bound on the Combinatorial Complexity of Approximating PolytopesRahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. MountSODA 2020
