Algorithm for filling curves on surfaces

From MaRDI portal
Publication:2196641




Abstract: Let Sigma be a compact, orientable surface of negative Euler characteristic, and let h be a complete hyperbolic metric on Sigma. A geodesic curve gamma in Sigma is filling, if it cuts the surface into topological disks and annuli. We propose an efficient algorithm for deciding whether a geodesic curve, represented as a word in some generators of pi1(Sigma), is filling. In the process, we find an explicit bound for the combinatorial length of a curve given by its Dehn-Thurston coordinate, in terms of the hyperbolic length. This gives us an efficient method for producing a collection which is guaranteed to contain all words corresponding to simple geodesics of bounded hyperbolic length.









This page was built for publication: Algorithm for filling curves on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196641)