A Non-linear Lower Bound for Planar Epsilon-Nets

Authors:
Noga Alon
Affiliations:
-
Venue:
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Year:
2010

Citing 0
Cited 3

A note about weak ε-nets for axis-parallel boxes in d-space

Information Processing Letters
Tight lower bounds for the size of epsilon-nets

Proceedings of the twenty-seventh annual symposium on Computational geometry
Piercing quasi-rectangles-On a problem of Danzer and Rogers

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the minimum possible size of an epsilon-net for point objects and line (or rectangle)-ranges in the plane is (slightly) bigger than linear in 1/\epsilon. This settles a problem raised by Matousek, Seidel and Welzl in 1990.