Article contents
An indecomposable polytope all of whose facets are decomposable
Published online by Cambridge University Press: 26 February 2010
Extract
A (convex) d-polytope is the convex hull of a finite set of points in Euclidean d–space Ed. The (Minkowski) sum of two polytopes P1 and P2 is defined by
.
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 1986
References
- 5
- Cited by