A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
DOI10.1007/s00454-016-9818-yzbMath1365.52016OpenAlexW1538190163MaRDI QIDQ728499
Menelaos I. Karavelas, Eleni Tzanaki
Publication date: 20 December 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5142/
upper boundcombinatorial geometrydiscrete geometrycombinatorial complexityconvex polytopesMinkowski sumCayley polytopes
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum number of faces of the Minkowski sum of two convex polytopes
- Maximal f-vectors of Minkowski sums of large numbers of polytopes
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Prodsimplicial-neighborly polytopes
- \(f\)-vectors of barycentric subdivisions
- Topological obstructions for vertex numbers of Minkowski sums
- On the exact maximum complexity of Minkowski sums of polytopes
- A simple way to tell a simple polytope from its graph
- The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
- Stellar subdivisions of boundary complexes of convex polytopes
- \(f\)-vectors of Minkowski additions of convex polytopes
- Lectures on Polytopes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- The maximum number of faces of the minkowski sum of three convex polytopes
- Eulerian Numbers
- The maximum numbers of faces of a convex polytope
This page was built for publication: A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
