Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

Abstract

Given a finite point set P in Rd, and ε>0 we say that N⊂eq Rd 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 O*(1ε2.558) in dimension d=3, and o(1εd-1/2) in all dimensions d≥ 4. To be precise, our weak ε-net has cardinality O(1εαd+γ) for any γ>0, with αd= \ arrayl 2.558 & if \ d=3 \\3.48 & if \ d=4 \\(d+d2-2d)/2 & if \ d≥ 5. array\ This is the first significant improvement of the bound of O(1εd) that was obtained in 1993 by Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point sets in dimension d≥ 3.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…