2011
DOI: 10.1007/s10711-010-9563-y
|View full text |Cite
|
Sign up to set email alerts
|

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 S 3 . The volume bounds follow from techniques related to the proof of Thurston's Orbifold Theorem, Schläfli's formula, and previous results of the author giving volume bounds for right-angled hyperbolic polyhedra.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(13 citation statements)
references
References 23 publications
0
13
0
Order By: Relevance
“…Because the result is not needed for our applications, we only outline the argument in the remark below. We point the reader to Atkinson [11] for more details.…”
Section: Bigons and Compression Disksmentioning
confidence: 99%
See 1 more Smart Citation
“…Because the result is not needed for our applications, we only outline the argument in the remark below. We point the reader to Atkinson [11] for more details.…”
Section: Bigons and Compression Disksmentioning
confidence: 99%
“…Recall (e.g. from [11,81]) that the prime decomposition of the orbifold O P is equivariant with respect to the reflection along ∂P . Thus any orbifold sphere S is constructed by doubling a normal bigon in P .…”
Section: Bigons and Compression Disksmentioning
confidence: 99%
“…The main result of this section is Proposition 3.6 in which we improve on a result of Atkinson giving a lower bound on the volume of a hyperbolic polyhedron of graph type [6]. Theorem 1.1 also requires techniques developed by Atkinson [5,6] which we recall here.…”
Section: On Polyhedral Volumesmentioning
confidence: 91%
“…However, the techniques used in Theorem 3.1 do not work in the presence of prismatic 4-circuits, because attempting such a deformation can cause some or all of the polyhedron to degenerate to a Seifert fibered polyhedral orbifold. Although there are volume bounds for such polyhedra [6,Theorem 13], they give a lower bound of 0 for an infinite family of polyhedra of graph type. In Proposition 3.6, we improve this to give a non-zero lower bound for all hyperbolic polyhedra of graph type.…”
Section: On Polyhedral Volumesmentioning
confidence: 99%
See 1 more Smart Citation