Algorithm for filling curves on surfaces

DOI10.1007/S10711-019-00509-2zbMATH Open1476.57033arXiv1906.02577OpenAlexW2998916452MaRDI QIDQ2196641FDOQ2196641

Authors: Monika Kudlinska 

Publication date: 3 September 2020

Published in: Geometriae Dedicata (Search for Journal in Brave)

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 $p{i}_1(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.

Full work available at URL: https://arxiv.org/abs/1906.02577

Recommendations

• Filling words in fundamental groups of Riemann surfaces
• Self-intersections of curves on surfaces
• SYSTOLIC FILLINGS OF SURFACES
• Geometric filling curves on punctured surfaces
• scientific article; zbMATH DE number 4013540

zbMATH Keywords

geodesicshyperbolic surfaceDehn-Thurston coordinatesfilling curves

Mathematics Subject Classification ID

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?)
• The collar theorem and examples
• Self-intersections of curves on surfaces

Cited In (3)

• Transforming curves on surfaces redux
• A fortran procedure for drawing some space-filling curves
• Filling words in fundamental groups of Riemann surfaces

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)