A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
From MaRDI portal
Publication:4020141
Abstract: We describe a characterization of convex polyhedra in 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 all of whose vertices lie on the unit sphere. That resolves a problem posed by Jakob Steiner in 1832.
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
Cites work
- scientific article; zbMATH DE number 3838373 (Why is no real title available?)
- scientific article; zbMATH DE number 3842680 (Why is no real title available?)
- scientific article; zbMATH DE number 139725 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 645814 (Why is no real title available?)
- scientific article; zbMATH DE number 3244470 (Why is no real title available?)
- scientific article; zbMATH DE number 3102012 (Why is no real title available?)
- A characterization of compact convex polyhedra in hyperbolic 3-space
- A characterization of ideal polyhedra in hyperbolic 3-space
- A new algorithm for minimizing convex functions over convex sets
- Euclidean structures on simplicial surfaces and hyperbolic volume
- Geometrical problems concerning polyhedra in the large
- Graph-theoretical conditions for inscribability and Delaunay realizability
- On geometry of convex ideal polyhedra in hyperbolic 3-space
- The ellipsoid method and its consequences in combinatorial optimization
- Toughness and Delaunay triangulations
- Unsolved problems in geometry
Cited in
(36)- Circle packings of maps —The Euclidean case
- Combinatorics encoding geometry: the legacy of Bill Thurston in the story of one theorem
- 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
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- scientific article; zbMATH DE number 1359481 (Why is no real title available?)
- 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
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Maximal planar graphs of inscribable type and diagonal flips
- Six topics on inscribable polytopes
- Some footnotes on Thurston's notes \textit{The geometry and topology of 3-manifolds}
- A simple method for resolving degeneracies in Delaunay triangulations
- Algebraic degrees of 3-dimensional polytopes
- On the exact maximum complexity of Minkowski sums of polytopes
- Advances in the theory and practice of graph drawing
- 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
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)