Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases
SIAM Journal on Discrete Mathematics
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Flag vectors of Eulerian partially ordered sets
European Journal of Combinatorics
f-Vectors of Minkowski Additions of Convex Polytopes
Discrete & Computational Geometry
Hi-index | 0.00 |
The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the sum can be attained by this family. We present a new linear equation that is satisfied by f-vectors of the sum and the summands. We study some of the implications of this equation.