An Improved Bound for Weak Epsilon-Nets in the Plane

08/08/2018
by   Natan Rubin, et al.
0

We show that for any finite set P of points in the plane and ϵ>0 there exist O(1/ϵ^3/2+γ) points in R^2, for arbitrary small γ>0, that pierce every convex set K with |K∩ P|≥ϵ |P|. This is the first improvement of the bound of O(1/ϵ^2) that was obtained in 1992 by Alon, Bárány, Füredi and Kleitman for general point sets in the plane.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2021

Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

Given a finite point set P in ℝ^d, and ϵ>0 we say that N⊆ℝ^d is a weak ϵ...
research
05/31/2020

Conditional Logic is Complete for Convexity in the Plane

We prove completeness of preferential conditional logic with respect to ...
research
08/31/2021

A note on visible islands

Given a finite point set P in the plane, a subset S ⊆ P is called an isl...
research
07/05/2019

A new method for determining the filled point of the tooth by Bit-Plane Algorithm

Up to now, researchers have applied segmentation techniques in their stu...
research
09/17/2018

A new lower bound on Hadwiger-Debrunner numbers in the plane

A set family F is said to satisfy the (p,q) property if among any p sets...
research
05/23/2023

On 4-general sets in finite projective spaces

A 4-general set in PG(n,q) is a set of points of PG(n,q) spanning the wh...
research
02/19/2020

Globally optimal point set registration by joint symmetry plane fitting

The present work proposes a solution to the challenging problem of regis...

Please sign up or login with your details

Forgot password? Click here to reset