Mathematics – Combinatorics
Scientific paper
2005-10-21
Discrete & Computational Geometry, vol. 37 (2007), pp. 503-516
Mathematics
Combinatorics
13 pages, submitted to Discrete & Computational Geometry
Scientific paper
10.1007/s00454-007-1310-2
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of face lattice of the sum in terms of the face lattice of a given perfectly centered polytope. Exact face counting formulas are then obtained for perfectly centered simplices and hypercubes. The second type of results concerns tight upper bounds for the f-vectors of Minkowski sums of several polytopes.
Fukuda Komei
Weibel Christophe
No associations
LandOfFree
On f-vectors of Minkowski additions of convex polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On f-vectors of Minkowski additions of convex polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On f-vectors of Minkowski additions of convex polytopes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-89556