三角网格曲面孔洞修补算法  

Hole filling algorithm in triangular meshes

作　　者：陈杰[1] 高诚辉[1] 何炳蔚[1] 

机构地区：[1]福州大学机械工程及自动化学院,福建福州350108

出　　处：《计算机集成制造系统》2011年第8期1821-1826,共6页Computer Integrated Manufacturing Systems

基　　金：福建省重大科技资助项目(2007H2011);国家自然科学基金资助项目(50605007)~~

摘　　要：针对反求工程中由于点云数据的不完整而产生的三角网格孔洞,提出了一种三角网格模型孔洞的空间修补算法。在提取孔洞边界特征后进行边界预处理,建立孔洞边界特征平面,并将孔洞边界向该平面投影;逐次寻找投影多边形中夹角最小的对应空间边界点作为网格生长点进行修补,直至新增的三角网格覆盖原有的孔洞;以孔洞边界周围的网格顶点作为采样点,对新增的孔洞网格顶点位置进行最小二乘拟合调整,以实现孔洞的准确修补。通过实例验证,说明该方法具有较好的孔洞修补精度和稳定性。Aiming at the triangular mesh holes generated from incomplete point cloud data in reverse engineering,a new hole filling algorithm in space was presented.The holes boundary were extracted and pretreated,and the characteristic plane of the hole boundary was established,on which boundary was projected.The smallest angle between the projection polygon was found out to determine the corresponding boundary point as the growing point for hole filling.Hole filling moved in circle until the original hole was covered by the new triangular meshes.The mesh points of the hole boundary were chosen as the sampling points,and the new filled hole mesh points position were adjusted by least squares fitting to fill the hole precisely.Examples proved that this method had good accuracy and stability in hole filling.

关 键 词：反求工程 三角网格 孔洞修补 最小二乘法 

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