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

####
Chris Atkinson (Temple University)

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 will first describe how to obtain
volume bounds in the right-angled case and then show how the more
general case follows from techniques related to the proof of
Thurston’s Orbifold Theorem and Schlaeﬂi’s formula.