Optimal area-sensitive bounds for polytope approximation
From MaRDI portal
Publication:2874597
DOI10.1145/2261250.2261305zbMath1293.52013OpenAlexW2137746155MaRDI QIDQ2874597
David M. Mount, Sunil Arya, Guilherme Dias da Fonseca
Publication date: 7 August 2014
Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2261250.2261305
(n)-dimensional polytopes (52B11) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning ⋮ On the combinatorial complexity of approximating polytopes ⋮ Approximate Polytope Membership Queries ⋮ \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
This page was built for publication: Optimal area-sensitive bounds for polytope approximation
