Polynomial-time algorithms for the curve graph

Mark C. Bell, Richard C. H. Webb

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves…