Optimal system of loops on an orientable surface

DOI10.1007/S00454-004-1150-2MaRDI QIDQ1773896zbMATH OpenOpenAlexFDO

Authors Francis Lazarus, Éric Colin de Verdière

Publication date 28 April 2005

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-004-1150-2

zbMATH Keywords

algorithm with polynomial running timecombinatorial surfacehomotopy class

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) General topology of complexes (57Q05)

Recommendations

• Graph Drawing
• Tightening nonsimple paths and cycles on surfaces
• Computing the shortest essential cycle
• Greedy optimal homotopy and homology generators
• Splitting (complicated) surfaces is hard

Cited in

(11)

• Traces, lengths, and simplicity for loops on surfaces
• Testing graph isotopy on surfaces
• Greedy optimal homotopy and homology generators
• Robust Polylines Tracing for N-Symmetry Direction Field on Triangulated Surfaces
• A Census of Plane Graphs with Polyline Edges
• Computing a canonical polygonal schema of an orientable triangulated surface
• Graph Drawing
• What smooth surfaces can be constructed from total degree 2 splines?
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding
• Splitting (complicated) surfaces is hard
• Localized homology

This page was built for publication: Optimal system of loops on an orientable surface

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