Distance in the curve graph

2011/04/20 by Ursula Hamenstaedt, Hamenstaedt, Ursula
Computer Science · Mathematics · #30F60 #Advanced Combinatorial Mathematics #Computational Geometry and Mesh Generation #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology

paper · pdf · doi:10.48550/arxiv.1104.4001

openalex publication_date 2011/04/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.

Citations

• Train tracks and the Gromov boundary of the complex of curves

Related

• Polynomial-time algorithms for the curve graph
• Distance and intersection number in the curve graph of a surface
• MICC: A tool for computing short distances in the curve complex
• Efficient geodesics and an effective algorithm for distance in the\n complex of curves
• A Combinatorial Model for the Teichmuller Metric