New constructions of weak \(\varepsilon\)-nets
From MaRDI portal
Publication:1762945
DOI10.1007/s00454-004-1116-4zbMath1104.68124OpenAlexW2002642771MaRDI QIDQ1762945
Publication date: 11 February 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-004-1116-4
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Related Items (16)
Improved bounds on the Hadwiger-Debrunner numbers ⋮ Journey to the Center of the Point Set ⋮ Small strong epsilon nets ⋮ A note on stabbing convex bodies with points, lines, and flats ⋮ A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space ⋮ An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets ⋮ Unnamed Item ⋮ An optimal extension of the centerpoint theorem ⋮ A non-linear lower bound for planar epsilon-nets ⋮ Positive-fraction intersection results and variations of weak epsilon-nets ⋮ Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension ⋮ Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension ⋮ Centerpoints and Tverberg's technique ⋮ An approximation algorithm for the partial vertex cover problem in hypergraphs ⋮ A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
This page was built for publication: New constructions of weak \(\varepsilon\)-nets
