2014/08/18 by Joan S. Birman, Dan Margalit, Birman, Joan +3
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1408.4133
openalex publication_date 2014/08/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give an algorithm for determining the distance between two vertices of the\ncomplex of curves. While there already exist such algorithms, for example by\nLeasure, Shackleton, and Webb, our approach is new, simple, and more effective\nfor all distances accessible by computer. Our method gives a new preferred\nfinite set of geodesics between any two vertices of the complex, called\nefficient geodesics, which are different from the tight geodesics introduced by\nMasur and Minsky.\n