A non-linear lower bound for planar epsilon-nets
Seminar Room 1, Newton Institute
AbstractAfter a brief description of the notion of epsilon-nets for range spaces and of the main known results about them, I will 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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.