Small-size ε-nets for axis-parallel rectangles and boxes

Boris Aronov, Esther Ezra, Micha Sharir

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

16 Scopus citations

Abstract

We show the existence of e-nets of size O (1/ε log log 1/ε) for planar point sets and axis-parallel rectangular ranges. The same bound holds for points in the plane with "fat" triangular ranges, and for point sets in R3 and axis-parallel boxes; these are the first known non-trivial bounds for these range spaces. Our technique also yields improved bounds on the size of ε-nets in the more general context considered by Clarkson and Varadarajan. For example, we show the existence of e-nets of size O (1/εe log log log 1/ε) for the dual range space of "fat" regions and planar point sets (where the regions are the ground objects and the ranges are subsets stabbed by points). Plugging our bounds into the technique of Brönnimann and Goodrich, we obtain improved approximation factors (computable in randomized polynomial time) for the hitting set or the set cover problems associated with the corresponding range spaces.

Original languageEnglish
Title of host publicationSTOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing
Pages639-648
Number of pages10
DOIs
StatePublished - 2009
Externally publishedYes
Event41st Annual ACM Symposium on Theory of Computing, STOC '09 - Bethesda, MD, United States
Duration: 31 May 20092 Jun 2009

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference41st Annual ACM Symposium on Theory of Computing, STOC '09
Country/TerritoryUnited States
CityBethesda, MD
Period31/05/092/06/09

Keywords

  • E-nets
  • Geometric range spaces
  • Hitting set
  • Randomized algorithms
  • Set cover

Fingerprint

Dive into the research topics of 'Small-size ε-nets for axis-parallel rectangles and boxes'. Together they form a unique fingerprint.

Cite this