Weak -nets have basis of size O(1/ (1/)) in any dimension
DOI10.1016/J.COMGEO.2007.02.006zbMATH Open1135.68054OpenAlexW2038910763MaRDI QIDQ2479477FDOQ2479477
Publication date: 26 March 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.02.006
Recommendations
- Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension
- A lower bound for weak \(\varepsilon\)-nets in high dimension
- Stronger bounds for weak epsilon-nets in higher dimensions
- Almost tight bounds for \(\epsilon\)-nets
- Tight lower bounds for the size of epsilon-nets
- Tight lower bounds for the size of epsilon-nets
- An Improved Bound for Weak Epsilon-nets in the Plane
- New Lower Bounds for ϵ-nets
- New constructions of weak \(\varepsilon\)-nets
- Improved bounds on weak \(\varepsilon\)-nets for convex sets
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Title not available (Why is that?)
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Equipartition of mass distributions by hyperplanes
- New constructions of weak \(\varepsilon\)-nets
- Point Selections and Weak ε-Nets for Convex Hulls
- Improved bounds on weak ε-nets for convex sets
Cited In (12)
- Tighter estimates for \(\epsilon\)-nets for disks
- Small strong epsilon nets
- A lower bound for weak \(\varepsilon\)-nets in high dimension
- A note on stabbing convex bodies with points, lines, and flats
- Journey to the Center of the Point Set
- Centerpoints and Tverberg's technique
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- k-Centerpoints Conjectures for Pointsets in ℝd
- An optimal generalization of the colorful Carathéodory theorem
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
- On a Problem of Danzer
- On a problem of Danzer
This page was built for publication: Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479477)
