Small-size ε-nets for axis-parallel rectangles and boxes
From MaRDI portal
Publication:5172760
DOI10.1145/1536414.1536501zbMath1304.68181OpenAlexW2003688059MaRDI QIDQ5172760
Esther Ezra, Micha Shair, Boris Aronov
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536501
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (4)
Solving the classification problem using \(\varepsilon\)-nets ⋮ A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space ⋮ A non-linear lower bound for planar epsilon-nets ⋮ Approximating the generalized minimum Manhattan network problem
This page was built for publication: Small-size ε-nets for axis-parallel rectangles and boxes