The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing

DOI10.1016/J.CAMWA.2011.03.053zbMATH Open1222.57015OpenAlexW2074467278MaRDI QIDQ640484FDOQ640484

Authors: Shugao Xia, Xiquan Shi, Fengshan Liu, Zhixun Su 

Publication date: 18 October 2011

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.03.053

Recommendations

• Minimum cycle and homology bases of surface-embedded graphs
• Minimum cycle and homology bases of surface-embedded graphs
• Finding one tight cycle
• Tightening nonsimple paths and cycles on surfaces
• Computing a canonical polygonal schema of an orientable triangulated surface

zbMATH Keywords

computational topologyfundamental group(canonical) polygonal schemacut graphtight orthogonal homotopic basis

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimally cutting a surface into a disk
• Greedy optimal homotopy and homology generators
• Multiple source shortest paths in a genus \(g\) graph
• Reconstruction of convergent \(G_1\) smooth B-spline surfaces
• Multiple-source shortest paths in planar graphs
• Tightening non-simple paths and cycles on surfaces
• Computing a canonical polygonal schema of an orientable triangulated surface
• A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection

Cited In (3)

• Quading triangular meshes with certain topological constraints
• Computing a canonical polygonal schema of an orientable triangulated surface
• Generators of $H_1(\Gamma_{h},\mathbbZ)$ for Triangulated Surfaces: Construction and Classification

This page was built for publication: The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing

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