Algorithm for filling curves on surfaces
From MaRDI portal
Publication:2196641
Abstract: Let be a compact, orientable surface of negative Euler characteristic, and let be a complete hyperbolic metric on . A geodesic curve in 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 , 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4082515 (Why is no real title available?)
- scientific article; zbMATH DE number 3475742 (Why is no real title available?)
- Combinatorics of Train Tracks. (AM-125)
- Geometry and spectra of compact Riemann surfaces
- On the geometry and dynamics of diffeomorphisms of surfaces
- Self-intersections of curves on surfaces
- The collar theorem and examples
Cited in
(3)
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)