Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases
SIAM Journal on Discrete Mathematics
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Algebraic Statistics for Computational Biology
Algebraic Statistics for Computational Biology
f-Vectors of Minkowski Additions of Convex Polytopes
Discrete & Computational Geometry
Topological obstructions for vertex numbers of Minkowski sums
Journal of Combinatorial Theory Series A
On the Exact Maximum Complexity of Minkowski Sums of Polytopes
Discrete & Computational Geometry
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
The maximum number of faces of the minkowski sum of three convex polytopes
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.01 |
We derive tight bounds for the maximum number of k-faces, 0 ≤ k ≤ d − 1, of the Minkowski sum, P1 ⊕ P2, of two d-dimensional convex polytopes P1 and P2, as a function of the number of vertices of the polytopes. For even dimensions d ≥ 2, the maximum values are attained when P1 and P2 are cyclic d-polytopes with disjoint vertex sets. For odd dimensions d ≥ 3, the maximum values are attained when P1 and P2 are [d/2]-neighborly d-polytopes, whose vertex sets are chosen appropriately from two distinct d-dimensional moment-like curves.