Polynomial-time algorithms for the curve graph
From MaRDI portal
Abstract: 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, Nielsen--Thurston type, and canonical curve system of a mapping class in polynomial time in its word length.
This page was built for publication: Polynomial-time algorithms for the curve graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278092)
