计算机工程与应用2011，Vol.47Issue(32)：180-182,3.DOI:10.3778/j.issn.1002-8331.2011.32.052
三角网格模型的基本群分割
Triangular mesh segmentation based on fundamental group
摘要
Abstract
An effective method of triangular mesh segmentation is proposed.The tree of shortest paths on triangular mesh from a given base point to every other vertex is calculated using Dijkstra algorithm.Then maximum spanning tree can be obtained in dual graph of this mesh,and these edges of dual graph don't intersect an arbitrary edge in the tree of shortest paths obtained.These edges on mesh which neither belong to the tree of shortest paths nor intersect the edges of maximum spanning tree can be found.Fundamental group at given basepoint is the set of shortest loops consisting of the tree of shortest paths and these edges,and then mesh can be cut into one topological disk along these loops.The result of experiment indicates that the method can quickly and efficiently cope with mesh segmentation.关键词
网格分割/基本群/最短路径树/对偶图/最大生成树Key words
mesh segmentation/fundamental group/the tree of shortest paths/dual graph/maximum spanning tree分类
信息技术与安全科学引用本文复制引用
范媛媛,杨斌..三角网格模型的基本群分割[J].计算机工程与应用,2011,47(32):180-182,3.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60873175) （the National Natural Science Foundation of China under Grant No.60873175）
安徽省教育厅自然科学基金(No.KJ2010B423,No.KJ2011Z284). （No.KJ2010B423,No.KJ2011Z284）
