A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
From MaRDI portal
Publication:4020141
DOI10.1090/S0273-0979-1992-00303-8zbMath0759.52010arXivmath/9210218MaRDI QIDQ4020141
Warren D. Smith, Craig D. Hodgson, Igor Rivin
Publication date: 16 January 1993
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9210218
Spherical and hyperbolic convexity (52A55) Global surface theory (convex surfaces à la A. D. Aleksandrov) (53C45)
Related Items (27)
Scribability problems for polytopes ⋮ About \(f\)-vectors of inscribed simplicial polytopes ⋮ Outerplanar Graphs and Delaunay Triangulations ⋮ Circle packings of maps —The Euclidean case ⋮ Graph-theoretical conditions for inscribability and Delaunay realizability ⋮ Algebraic degrees of 3-dimensional polytopes ⋮ Unnamed Item ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ On a New Conformal Functional for Simplicial Surfaces ⋮ Realizability and inscribability for simplicial polytopes via nonlinear optimization ⋮ Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints ⋮ Polyhedra inscribed in a quadric ⋮ COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ Infinitely many arithmetic alternating links: Class number greater than one ⋮ Combinatorial optimization in geometry ⋮ Neighborly inscribed polytopes and Delaunay triangulations ⋮ A simple method for resolving degeneracies in Delaunay triangulations ⋮ Constructing subdivision rules from polyhedra with identifications ⋮ Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces ⋮ Intersection number and stability of some inscribable graphs ⋮ Maximal planar graphs of inscribable type and diagonal flips ⋮ Combinatorics Encoding Geometry: The Legacy of Bill Thurston in the Story of One Theorem ⋮ Six Topics on Inscribable Polytopes ⋮ Advances in the theory and practice of graph drawing ⋮ On the exact maximum complexity of Minkowski sums of polytopes ⋮ Weakly inscribed polyhedra
Cites Work
- Toughness and Delaunay triangulations
- The ellipsoid method and its consequences in combinatorial optimization
- 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
- A characterization of ideal polyhedra in hyperbolic 3-space
- A new algorithm for minimizing convex functions over convex sets
- On geometry of convex ideal polyhedra in hyperbolic 3-space
- Geometrical problems concerning polyhedra in the large
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
