On an elementary proof of Rivin's characterization of convex ideal hyperbolic polyhedra by their dihedral angles (Q1768254): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A characterization of compact convex polyhedra in hyperbolic 3-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Euclidean structures on simplicial surfaces and hyperbolic volume / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On geometry of convex ideal polyhedra in hyperbolic 3-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of ideal polyhedra in hyperbolic 3-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization in geometry / rank | |||
Normal rank |
Latest revision as of 19:52, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On an elementary proof of Rivin's characterization of convex ideal hyperbolic polyhedra by their dihedral angles |
scientific article |
Statements
On an elementary proof of Rivin's characterization of convex ideal hyperbolic polyhedra by their dihedral angles (English)
0 references
15 March 2005
0 references
A well-known question of J. Steiner (1832) refers to the characterization of those planar graphs which are combinatorially equivalent to 3-polytopes all whose vertices are contained in the standard 2-sphere in 3-space. (In the Beltrami-Klein model for the hyperbolic 3-space \(H^3\) such polyhedra can also be interpreted as hyperbolic polyhedra all whose vertices are on the sphere at infinity, also called ideal hyperbolic polyhedra.) As a byproduct of the classification of ideal polyhedra in \(H^3\), I. Rivin answered Steiner's question in the 1990s, proposing also a more direct approach to these results. Presenting a suitable combinatorial result in the spirit of ``combinatorial angles'', the author of the present paper completes the program of Rivin, although (as he expresses in a footnote) already Rivin himself gave this completion in a paper that first was not known to him, by using network flow analysis and duality between linear programs.
0 references
hyperbolic (ideal) polyhedra
0 references
Beltrami-Klein model
0 references
tessellation
0 references
dual tessellation
0 references
combinatorial equivalence
0 references
Lobachevski volume function
0 references
1-skeleton
0 references