A nonlinear lower bound for planar epsilonnets
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Discrete Analysis
After a brief description of the notion of epsilonnets for range spaces and of the main known results about them, I will show that the minimum possible size of an epsilonnet 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.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
