English

An Improved Bound for Weak Epsilon-Nets in the Plane

Combinatorics 2022-07-22 v2 Computational Geometry Discrete Mathematics

Abstract

We show that for any finite set PP of points in the plane and ϵ>0\epsilon>0 there exist O(1ϵ3/2+γ)\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right) points in R2{\mathbb{R}}^2, for arbitrary small γ>0\gamma>0, that pierce every convex set KK with KPϵP|K\cap P|\geq \epsilon |P|. This is the first improvement of the bound of O(1ϵ2)\displaystyle O\left(\frac{1}{\epsilon^2}\right) that was obtained in 1992 by Alon, B\'{a}r\'{a}ny, F\"{u}redi and Kleitman for general point sets in the plane.

Keywords

Cite

@article{arxiv.1808.02686,
  title  = {An Improved Bound for Weak Epsilon-Nets in the Plane},
  author = {Natan Rubin},
  journal= {arXiv preprint arXiv:1808.02686},
  year   = {2022}
}

Comments

A preliminary version to appear in the proceedings of FOCS 2018. Full version to appear in Journal of ACM

R2 v1 2026-06-23T03:27:39.577Z