Tight lower bounds for the size of epsilon-nets

DOI10.1145/1998196.1998271zbMath1283.68375OpenAlexW2056739617MaRDI QIDQ5404461

Gábor Tardos, János Pach

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/10036/1/1012.1240.pdf

zbMATH Keywords

geometryepsilon-net

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Transversal (matching) theory (05D15) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (11)

Weighted geometric set cover with rectangles of bounded integer side lengths ⋮ Exact algorithms and APX-hardness results for geometric packing and covering problems ⋮ Small strong epsilon nets ⋮ On the geometric priority set cover problem ⋮ Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension ⋮ The class cover problem with boxes ⋮ Near-linear approximation algorithms for geometric hitting sets ⋮ Piercing quasi-rectangles-on a problem of Danzer and Rogers ⋮ Tight lower bounds for the size of epsilon-nets ⋮ Unnamed Item ⋮ On Geometric Set Cover for Orthants

This page was built for publication: Tight lower bounds for the size of epsilon-nets