A combinatorial algorithm for visualizing representatives with minimal self-intersection
From MaRDI portal
Abstract: Given an orientable surface with boundary and a free homotopy class, we present a purely combinatorial algorithm which produces a representative of that homotopy class with minimal self intersection.
Recommendations
Cites work
Cited in
(8)- A combinatorial algorithm for immersed loops in surfaces
- Characterizing homotopy of systems of curves on a compact surface by crossing numbers
- Geometric intersections of loops on surfaces
- Measuring complexity of curves on surfaces
- Algebraic characterization of simple closed curves via Turaev's cobracket
- Self-intersection numbers of paths in compact surfaces
- INTERSECTIONS OF LOOPS IN TWO-DIMENSIONAL MANIFOLDS. II. FREE LOOPS
- Self-intersections of arcs on a pair of pants
This page was built for publication: A combinatorial algorithm for visualizing representatives with minimal self-intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451490)