Convex Polytopes is a graduate-level mathematics textbook about convex polytopes, higher-dimensional generalizations of three-dimensional convex polyhedra. It was written by Branko Grünbaum, with contributions from Victor Klee, Micha Perles, and G. C. Shephard, and published in 1967 by John Wiley & Sons. It went out of print in 1970. A second edition, prepared with the assistance of Volker Kaibel, Victor Klee, and Günter M. Ziegler, was published by Springer-Verlag in 2003, as volume 221 of their book series Graduate Texts in Mathematics. Convex Polytopes was the winner of the 2005 Leroy P. Steele Prize for mathematical exposition, given by the American Mathematical Society. The Basic Library List Committee of the Mathematical Association of America has recommended its inclusion in undergraduate mathematics libraries. Topics The book has 19 chapters. After two chapters introducing background material in linear algebra, topology, and convex geometry, two more chapters provide basic definitions of polyhedra, in their two dual versions (intersections of half-spaces and convex hulls of finite point sets), introduce Schlegel diagrams, and provide some basic examples including the cyclic polytopes. Chapter 5 introduces Gale diagrams, and the next two chapters use them to study polytopes with a number of vertices only slightly higher than their dimension, and neighborly polytopes. Chapters 8 through 11 study the numbers of faces of different dimensions in polytopes through Euler's polyhedral formula, the Dehn–Sommerville equations, and the extremal combinatorics of numbers of faces in polytopes. Chapter 11 connects the low-dimensional faces together into the skeleton of a polytope, and proves the van Kampen–Flores theorem about non-embeddability of skeletons into lower-dimensional spaces. Chapter 12 studies the question of when a skeleton uniquely determines the higher-dimensional combinatorial structure of its polytope. Chapter 13 provides a complete answer to this theorem for three-dimensional convex polytopes via Steinitz's theorem, which characterizes the graphs of convex polyhedra combinatorially and can be used to show that they can only be realized as a convex polyhedron in one way. It also touches on the multisets of face sizes that can be realized as polyhedra (Eberhard's theorem) and on the combinatorial types of polyhedra that can have inscribed spheres or circumscribed spheres. Chapter 14 concerns relations analogous to the Dehn–Sommerville equations for sums of angles of polytopes, and uses sums of angles to define a central point, the "Steiner point", for any polytope. Chapter 15 studies Minkowski addition and Blaschke addition, two operations by which polytopes can