A non-linear lower bound for planar epsilon-nets

Noga Alon*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
PublisherIEEE Computer Society
Pages341-346
Number of pages6
ISBN (Print)9780769542447
DOIs
StatePublished - 2010
Event2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 - Las Vegas, NV, United States
Duration: 23 Oct 201026 Oct 2010

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
Country/TerritoryUnited States
CityLas Vegas, NV
Period23/10/1026/10/10

Keywords

  • Epsilon nets
  • VC dimension
  • Weak epsilon nets

Cite this