The maximum number of faces of the minkowski sum of three convex polytopes

DOI10.1145/2462356.2462368zbMath1305.68246arXiv1211.6089OpenAlexW2086660719MaRDI QIDQ5174477

Christos Konaxis, Menelaos I. Karavelas, Eleni Tzanaki

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial geometrydiscrete geometrycombinatorial complexityconvex polytopesMinkowski sumCayley tricktight bounds

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (6)

Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums ⋮ The maximum number of faces of the Minkowski sum of two convex polytopes ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ 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 ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding

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