Small strong epsilon nets
From MaRDI portal
Publication:396471
DOI10.1016/J.COMGEO.2014.05.002zbMath1307.65025arXiv1208.2785OpenAlexW2121777229MaRDI QIDQ396471
Umair Azmi, Pradeesha Ashok, Sathish Govindarajan
Publication date: 13 August 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.2785
diskgeometric algorithmscombinatorial geometryepsilon netshalfspace\(\epsilon\)-netsaxis-parallel rectanglecetrepointmesh partitioningsmall strong \(\epsilon\)-netssmall weak \(\epsilon\)-netsstrong \(\epsilon\)-netsstrong centrepointweak \(\epsilon\)-nets
Related Items (3)
Tighter estimates for \(\epsilon\)-nets for disks ⋮ Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems ⋮ On strong centerpoints
Cites Work
- Unnamed Item
- Lower bounds for weak epsilon-nets and stair-convexity
- Polychromatic coloring for half-planes
- A non-linear lower bound for planar epsilon-nets
- Improved approximation algorithms for geometric set cover
- An optimal extension of the centerpoint theorem
- Approximate centerpoints with proofs
- Small weak epsilon-nets
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- Computing a centerpoint of a finite planar set of points in linear time
- Improved bounds on weak \(\varepsilon\)-nets for convex sets
- New constructions of weak \(\varepsilon\)-nets
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
- New existence proofs ε-nets
- Separators for sphere-packings and nearest neighbor graphs
- Epsilon nets and union complexity
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Tight lower bounds for the size of epsilon-nets
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- A Theorem on General Measure
This page was built for publication: Small strong epsilon nets
