An Elementary Proof of Gram's Theorem for Convex Polytopes

DOI10.4153/CJM-1967-110-7zbMath0157.52504OpenAlexW2332275131MaRDI QIDQ5540211

Geoffrey C. Shephard

Publication date: 1967

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1967-110-7

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Related Items (9)

A characterization of the angle defect and the Euler characteristic in dimension 2 ⋮ Critical points and the angle defect ⋮ Polytopes, graphs, and complexes ⋮ Combinatorial identities for polyhedral cones ⋮ Lipschitz-Killing curvatures of angular partially ordered sets ⋮ A new valuation on polyhedral cones ⋮ \(K\)-theoretic Tutte polynomials of morphisms of matroids ⋮ Angle‐sum relations for polyhedral sets ⋮ A sweep-plane algorithm for generating random tuples in simple polytopes

This page was built for publication: An Elementary Proof of Gram's Theorem for Convex Polytopes