Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra

From MaRDI portal
(Redirected from Publication:634724)




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.











This page was built for publication: Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra

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