Polynomial-time algorithms for the curve graph
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, this has several applications to mapping classes. For example, we can use these geodesics to compute:
the asymptotic translation length,
the Nielsen–Thurston type, and
the canonical curve system
of a mapping class in polynomial time in its word length.
curve graph, geodesics, polynomial-time, mapping class group, asymptotic translation length, Nielsen–Thurston classification, canonical curve system.