基于边界特征增长的孔洞修补算法  

New Hole Filling Algorithm Based on Boundary-feature Growing

作　　者：刘咏梅[1] 李凤霞[1] 雷正朝[1] 余月[1] 王清云[1] 

机构地区：[1]北京理工大学智能信息技术北京市重点实验室,北京100081

出　　处：《系统仿真学报》2014年第9期1916-1921,共6页Journal of System Simulation

摘　　要：针对逆向工程中原始三角网格模型数据不完整而导致的孔洞问题,提出一种新的基于边界特征增长的孔洞修补算法。在识别孔洞完成后,算法首先从边界夹角最小边界点开始,根据孔洞点周围三角网格的几何特征合理地计算出新插入点的位置,并形成新的三角网格填充孔洞;依次选择孔洞边界的下一点进行插入点的计算,生成新的网格进行填充,并且根据新插入顶点检查是否可以将原有孔洞划分为两个子孔洞,对需要进行子孔洞划分的孔洞进行子孔洞的划分;直至孔洞被填充完整。实验结果表明,算法在构建质量较好的填充三角网格基础上,保持原始网格模型的特征并与原始网格相融合。很好的完成孔洞修补。Aiming at restoring the triangle mesh with holes caused by missing data in reverse engineering, a new hole-filling algorithm based on the boundary-feature growing method was proposed. After the identifying of the hole was completed, the algorithm began insert new point（s） with the smallest angle formed by two adjacent edges of one boundary point, the position of the new point（s） being calculated from the geometric feature of the boundary triangles reasonably and new triangles being generated. Then, the next point in the hole boundary was selected to compute the insert point（s） orderly. The hole was divided into two sub-holes if the new point passed the validation of the inset position. Above process moved in circle until the original hole was closed. Experimental results show that this method can establish triangles with good quality, maintain feature of original mesh, and integrate the new triangles with boundary triangles.

关 键 词：孔洞修补 三角网格 逆向工程 边界特征 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]