A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere

DOI10.1090/S0273-0979-1992-00303-8zbMATH Open0759.52010arXivmath/9210218MaRDI QIDQ4020141FDOQ4020141

Authors: Craig Hodgson, Igor Rivin, Warren D. Smith 

Publication date: 16 January 1993

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Abstract: We describe a characterization of convex polyhedra in $h^3$ 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 $E^3$ all of whose vertices lie on the unit sphere. That resolves a problem posed by Jakob Steiner in 1832.

Full work available at URL: https://arxiv.org/abs/math/9210218

Recommendations

• A characterization of compact convex polyhedra in hyperbolic 3-space
• A note on the volume of hyperbolic convex polyhedra
• A characterization of ideal polyhedra in hyperbolic 3-space
• Sur la rigidité de polyèdres hyperboliques en dimension $3$ : cas de volume fini, cas hyperidéal, cas fuchsien
• Weakly inscribed polyhedra

zbMATH Keywords

graphshyperbolic spaceskeletonGauss-maprandom access memory

Mathematics Subject Classification ID

Spherical and hyperbolic convexity (52A55) Global surface theory (convex surfaces à la A. D. Aleksandrov) (53C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of ideal polyhedra in hyperbolic 3-space
• Title not available (Why is that?)
• The ellipsoid method and its consequences in combinatorial optimization
• A new algorithm for minimizing convex functions over convex sets
• Title not available (Why is that?)
• Unsolved problems in geometry
• A characterization of compact convex polyhedra in hyperbolic 3-space
• Euclidean structures on simplicial surfaces and hyperbolic volume
• Graph-theoretical conditions for inscribability and Delaunay realizability
• On geometry of convex ideal polyhedra in hyperbolic 3-space
• Toughness and Delaunay triangulations
• Geometrical problems concerning polyhedra in the large
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (36)

• Constructing subdivision rules from polyhedra with identifications
• Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
• A polyhedron full of surprises
• A unique representation of polyhedral types. Centering via Möbius transformations
• On a new conformal functional for simplicial surfaces
• Characterizations of circle patterns and finite convex polyhedra in hyperbolic 3-space
• Infinitely many arithmetic alternating links: Class number greater than one
• About \(f\)-vectors of inscribed simplicial polytopes
• Title not available (Why is that?)
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
• Neighborly inscribed polytopes and Delaunay triangulations
• Combinatorial optimization in geometry
• On an elementary proof of Rivin's characterization of convex ideal hyperbolic polyhedra by their dihedral angles
• A characterization of ideal polyhedra in hyperbolic 3-space
• Scribability problems for polytopes
• A characterization of compact convex polyhedra in hyperbolic 3-space
• Some footnotes on Thurston's notes \textit{The geometry and topology of 3-manifolds}
• Graph-theoretical conditions for inscribability and Delaunay realizability
• Six topics on inscribable polytopes
• Maximal planar graphs of inscribable type and diagonal flips
• A simple method for resolving degeneracies in Delaunay triangulations
• Algebraic degrees of 3-dimensional polytopes
• Advances in the theory and practice of graph drawing
• On the exact maximum complexity of Minkowski sums of polytopes
• Discrete and Computational Geometry
• Weakly inscribed polyhedra
• Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
• Arrangements on parametric surfaces. II: Concretizations and applications
• On inscribed and circumscribed convex polyhedra
• Revisiting hyperbolic Voronoi diagrams in two and higher dimensions from theoretical, applied and generalized viewpoints
• Polyhedra inscribed in a quadric
• Intersection number and stability of some inscribable graphs
• Outerplanar graphs and Delaunay triangulations
• Circle packings of maps —The Euclidean case
• Combinatorics encoding geometry: the legacy of Bill Thurston in the story of one theorem

This page was built for publication: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020141)