Bulletin of the American Mathematical Society · 1992 · 72 citations · 10 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryGeometryConvex GeometryDiscrete GeometryEuclidean GeometryHyperbolic GeometryCombinatorial RepresentationsConvex PolyhedraDihedral AngleHyperbolic PolyhedraPolyhedron Theory
We describe a characterization of convex polyhedra in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper H cubed"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>H</mml:mi> <mml:mn>3</mml:mn> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">{H^3}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in terms of their dihedral angles, developed by Rivin. We also describe some geometric and combinatorial consequences of that theory. One of these consequences is a combinatorial characterization of convex polyhedra in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper E cubed"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>E</mml:mi> <mml:mn>3</mml:mn> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">{E^3}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> all of whose vertices lie on the unit sphere. That resolves a problem posed by Jakob Steiner in 1832.
10
Choice Reviews Online · 1991 · 436 citations
A new algorithm for minimizing convex functions over convex sets
Pravin M. Vaidya · 1989 · 177 citations
ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
Mathematics of the USSR-Sbornik · 1970 · 175 citations
A Characterization of Ideal Polyhedra in Hyperbolic 3-Space
Igor Rivin · Annals of Mathematics · 1996 · 166 citations