On the combinatorial complexity of approximating polytopes

DOI10.4230/LIPICS.SOCG.2016.11zbMATH Open1387.52007MaRDI QIDQ3132844FDOQ3132844

Sunil Arya, David M. Mount, Guilherme D. Da Fonseca

Publication date: 30 January 2018

Recommendations

• On the combinatorial complexity of approximating polytopes
• Optimal area-sensitive bounds for polytope approximation
• Polytope approximation and the Mahler volume
• Fine approximation of convex bodies by polytopes
• scientific article; zbMATH DE number 665688

zbMATH Keywords

convex polytopespolytope approximationMacbeath regions

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Approximation by convex sets (52A27)

Cited In (10)

• On affine reducibility of combinatorial polytopes
• Complexity yardsticks for \(f\)-vectors of polytopes and spheres
• Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
• On the complexity of polytope isomorphism problems
• On the polytope faces of the graph approximation problem
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
• Title not available (Why is that?)
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• On the extension complexity of combinatorial polytopes
• Oracle-polynomial-time approximation of largest simplices in convex bodies

This page was built for publication: On the combinatorial complexity of approximating polytopes

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