Polytopes; Compact Convex Sets
- 992 Downloads
We’ll be working in a d-dimensional real affine space X, for d finite. A polytope is a convex compact set with non-empty interior, which can be realized as the intersection of a finite number of closed half-spaces of X (cf. 2.G). We shall assume there are no superfluous half-spaces in the intersection. For d = 2 we use the word polygon.
KeywordsCompact Convex Isoperimetric Inequality Differentiable Manifold Regular Polyhedron Regular Simplex
Unable to display preview. Download preview PDF.