The lower bound theorem for polytopes that approximate C^1-convex bodies

zbMATH Open1394.52007MaRDI QIDQ4584107FDOQ4584107

Authors: Karim Adiprasito, José Alejandro Samper 

Publication date: 29 August 2018

Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAT0125

Recommendations

• A geometric lower bound theorem
• Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
• Polytopal approximation bounding the number of \(k\)-faces
• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
• Approximation of general smooth convex bodies

zbMATH Keywords

approximation theoryconvex bodiespolytopeslower bound theoremgeometric combinatorics\(f\)-vector theory

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polyhedral manifolds (52B70)

Cited In (3)

• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
• A geometric lower bound theorem
• Lower bounds for \(n\)-term approximations of plane convex sets and related topics

This page was built for publication: The lower bound theorem for polytopes that approximate \(C^1\)-convex bodies

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