Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Marcel Berger
About this chapter
Cite this chapter
Berger, M., Pansu, P., Berry, JP., Saint-Raymond, X. (1984). Polytopes; Compact Convex Sets. In: Problems in Geometry. Problem Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1836-2_12
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1836-2_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2822-1
Online ISBN: 978-1-4757-1836-2
eBook Packages: Springer Book Archive