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

Source: [Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra](<https://www.sota2.com/research/paper/68fa4ff21e209131ce96769a>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T10:34:43.523Z

Authors: Christopher K. Atkinson

Published: 2010-08-31T19:35:21.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1008.5396>)

[PDF](<https://arxiv.org/pdf/1008.5396.pdf>)
