Year: 2016
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Bell, Mark C., Webb, Richard C. H.
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2524575356