Almost tight bounds for &egr;-nets
Discrete & Computational Geometry
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Lectures on Discrete Geometry
An optimal generalization of the centerpoint theorem, and its extensions
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Weak ε-nets and interval chains
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
Given a set P of points in the plane, a set of points Q is a weak @e-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing @e|P| points contains a point of Q. In this paper, we determine bounds on @e"i^S, the smallest epsilon that can be guaranteed for any P when |Q|=i, for small values of i.