Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra
Abstract
We give a method for computing upper and lower bounds for the volume of a non-obtuse hyperbolic polyhedron in terms of the combinatorics of the 1-skeleton. We introduce an algorithm that detects the geometric decomposition of good 3-orbifolds with planar singular locus and underlying manifold the 3-sphere. The volume bounds follow from techniques related to the proof of Thurston's Orbifold Theorem, Schl\"afli's formula, and previous results of the author giving volume bounds for right-angled hyperbolic polyhedra.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.