English

Epsilon-Nets for Halfspaces Revisited

Computational Geometry 2014-10-14 v1

Abstract

Given a set PP of nn points in R3\mathbb{R}^3, we show that, for any ε>0\varepsilon >0, there exists an ε\varepsilon-net of PP for halfspace ranges, of size O(1/ε)O(1/\varepsilon). We give five proofs of this result, which are arguably simpler than previous proofs \cite{msw-hnlls-90, cv-iaags-07, pr-nepen-08}. We also consider several related variants of this result, including the case of points and pseudo-disks in the plane.

Cite

@article{arxiv.1410.3154,
  title  = {Epsilon-Nets for Halfspaces Revisited},
  author = {Sariel Har-Peled and Haim Kaplan and Micha Sharir and Shakhar Smorodinsky},
  journal= {arXiv preprint arXiv:1410.3154},
  year   = {2014}
}
R2 v1 2026-06-22T06:21:01.881Z