Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

04/26/2021
by   Natan Rubin, et al.
0

Given a finite point set P in ℝ^d, and ϵ>0 we say that N⊆ℝ^d is a weak ϵ-net if it pierces every convex set K with |K∩ P|≥ϵ |P|. Let d≥ 3. We show that for any finite point set in ℝ^d, and any ϵ>0, there exist a weak ϵ-net of cardinality O(1/ϵ^d-1/2+γ), where γ>0 is an arbitrary small constant. This is the first improvement of the bound of O^*(1/ϵ^d) that was obtained in 1994 by Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point sets in dimension d≥ 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2018

An Improved Bound for Weak Epsilon-Nets in the Plane

We show that for any finite set P of points in the plane and ϵ>0 there e...
research
12/08/2017

How to Net a Convex Shape

We revisit the problem of building weak -nets for convex ranges over...
research
10/24/2018

Extending the centerpoint theorem to multiple points

The centerpoint theorem is a well-known and widely used result in discre...
research
02/20/2020

Weighted Epsilon-Nets

Motivated by recent work of Bukh and Nivasch on one-sided ε-approximants...
research
07/20/2020

Stabbing Convex Bodies with Lines and Flats

We study the problem of constructing weak -nets where the stabbing eleme...
research
11/02/2021

Unfoldings and Nets of Regular Polytopes

Over a decade ago, it was shown that every edge unfolding of the Platoni...
research
07/06/2022

Semilinear Home-space is Decidable for Petri Nets

A set of configurations 𝐇 is an home-space for a set of configurations 𝐗...

Please sign up or login with your details

Forgot password? Click here to reset