3D Mesh Segmentation Based on Boundary Strength

DOI：

 作者 单位 E-mail 孙晓鹏 辽宁师范大学 计算机与信息技术学院,辽宁 大连 116029 大连理工大学 机械工程学院,辽宁 大连 116024 szx@nju.edu.cn 纪燕杰 辽宁师范大学 计算机与信息技术学院,辽宁 大连 116029 魏小鹏 大连理工大学 机械工程学院,辽宁 大连 116024 辽宁省先进设计与智能计算省部共建教育部重点实验室(大连大学),辽宁 大连 116622

提出一种新的基于网格边界几何信息的快速分割算法,首先按照原始网格模型面片的拓扑关系建立对偶图,并根据网格面片的几何信息设定顶点权和边权;使用k-way 多级分割方法在对偶图上进行快速分割,得到预分割区域以及各分割区域的初始边界;然后定义分割片的特征边界和边界强度函数,用以表示各预分割区域边界上的形变模型;通过最小化形变模型的能量函数,推动初始边界向特征边界运动,最终得到符合最小值法则的有意义的子网格.实验结果表明,该算法快速有效,适用于各种局部边缘特点较显著的三角网格模型.

In this paper, we present a novel and fast algorithm for 3D meshes segmentation based on the geometric information of boundary. Firstly, according to the topological relationship of original mesh faces, we construct the dual graph, and set the weight of vertex and edge on the basis of geometric information of mesh faces. Using the k-way multilevel cutting method, we segment the dual graph quickly to obtain the pre-segmentation and initial boundary for each patch. Then we define the boundary strength function and the feature boundary of each patch, to construct a deformation contour on the patch’s boundary. By minimizing the energy of the deformation contour, the initial boundary is driven to approach the feature boundary. Finally, the original mesh is segmented into several meaningful patches in accordance with the minimal rule. The experiment results suggest that our algorithm is efficient and effective, and is applicable to a variety of triangular mesh models with prominent shape features.
HTML  下载PDF全文  查看/发表评论  下载PDF阅读器