最小自相交表示可视化的组合算法
A combinatorial algorithm for visualizing representatives with minimal self-intersection
摘要:
给定一个带边界的可定向曲面和一个自由的同伦类,我们提出了一个纯组合算法,它产生一个具有最小自交的同伦类的代表。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。