Algorithm for filling curves on surfaces
From MaRDI portal
Publication:2196641
DOI10.1007/S10711-019-00509-2zbMATH Open1476.57033arXiv1906.02577OpenAlexW2998916452MaRDI QIDQ2196641FDOQ2196641
Publication date: 3 September 2020
Published in: Geometriae Dedicata (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1906.02577
Analysis of algorithms and problem complexity (68Q25) Fundamental group, presentations, free differential calculus (57M05) General geometric structures on low-dimensional manifolds (57M50) Covering spaces and low-dimensional topology (57M10)
Cites Work
- Combinatorics of Train Tracks. (AM-125)
- On the geometry and dynamics of diffeomorphisms of surfaces
- Geometry and spectra of compact Riemann surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the Geometric Intersection Number of Curves
- The collar theorem and examples
- Self-intersections of curves on surfaces
Cited In (1)
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)