Epsilon-Nets for Halfspaces Revisited
Abstract
Given a set P of n points in R3, we show that, for any >0, there exists an -net of P for halfspace ranges, of size O(1/). We give five proofs of this result, which are arguably simpler than previous proofs 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.
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.