New constructions of weak -nets

DOI10.1007/S00454-004-1116-4zbMATH Open1104.68124OpenAlexW2002642771MaRDI QIDQ1762945FDOQ1762945

Authors: Uli Wagner, Jiří Matoušek 

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

Recommendations

• New constructions of weak epsilon-nets
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• A lower bound for weak \(\varepsilon\)-nets in high dimension
• Small weak epsilon-nets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Cited In (29)

• Small strong epsilon nets
• A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
• Improved bounds on the Hadwiger-Debrunner numbers
• An optimal extension of the centerpoint theorem
• Small weak epsilon-nets
• An Improved Bound for Weak Epsilon-nets in the Plane
• An approximation algorithm for the partial vertex cover problem in hypergraphs
• Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension
• A note on reachability and distance oracles for transmission graphs
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• Weak \(\varepsilon\)-nets for points on a hypersphere
• Tverberg partitions as weak epsilon-nets
• A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
• On weak \(\epsilon\)-nets and the Radon number
• A non-linear lower bound for planar epsilon-nets
• A note on stabbing convex bodies with points, lines, and flats
• New constructions of weak epsilon-nets
• New Lower Bounds for ϵ-nets
• Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
• 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
• Title not available (Why is that?)
• Construction of \(\epsilon\)-nets
• Weak ε-nets and interval chains
• One-sided epsilon-approximants
• An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
• On weak \(\varepsilon\)-nets and the Radon number
• Positive-fraction intersection results and variations of weak epsilon-nets

This page was built for publication: New constructions of weak \(\varepsilon\)-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762945)