Optimal area-sensitive bounds for polytope approximation

DOI10.1145/2261250.2261305MaRDI QIDQ2874597zbMATH OpenOpenAlexFDO

Authors Sunil Arya, David M. Mount, Guilherme D. 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

zbMATH Keywords

approximationconvexitypolytopesMacbeath regions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) (n)-dimensional polytopes (52B11) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Recommendations

• On the combinatorial complexity of approximating polytopes
• On the combinatorial complexity of approximating polytopes
• Polytope approximation and the Mahler volume
• Fine approximation of convex bodies by polytopes
• scientific article; zbMATH DE number 665688

Cited in

(10)

• A better heuristic for area-compaction of orthogonal representations
• Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
• Economical convex coverings and applications
• Approximate polytope membership queries
• Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
• Optimal volume-sensitive bounds for polytope approximation
• Geometric Applications of Chernoff-Type Estimates
• On the combinatorial complexity of approximating polytopes
• On the combinatorial complexity of approximating polytopes
• \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets

This page was built for publication: Optimal area-sensitive bounds for polytope approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874597)