The maximum number of faces of the Minkowski sum of two convex polytopes

DOI10.1007/s00454-015-9726-6zbMath1365.52013arXiv1106.6254OpenAlexW2221543170MaRDI QIDQ309640

Menelaos I. Karavelas, Eleni Tzanaki

Publication date: 7 September 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.6254

zbMATH Keywords

combinatorial geometrydiscrete geometrycombinatorial complexityconvex polytopesMinkowski sumhigh-dimensional geometry

Mathematics Subject Classification ID

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)

Related Items (10)

Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums ⋮ A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ The maximum number of faces of the Minkowski sum of two convex polytopes ⋮ Log-Concavity and Lower Bounds for Arithmetic Circuits ⋮ Maximal f-vectors of Minkowski sums of large numbers of polytopes ⋮ A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums ⋮ A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes ⋮ Unnamed Item ⋮ Almost Simplicial Polytopes: The Lower and Upper Bound Theorems

Cites Work

• 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
• 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
• \(f\)-vectors of Minkowski additions of convex polytopes
• Partially Observable Markov Decision Processes: A Geometric Technique and Analysis
• 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
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
• Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
• The maximum numbers of faces of a convex polytope
• Shellable Decompositions of Cells and Spheres.
• Algebraic Statistics for Computational Biology

This page was built for publication: The maximum number of faces of the Minkowski sum of two convex polytopes