三维模型孔洞修补方法的研究  

Research on hole-filling algorithm for 3D models

作　　者：谢倩茹[1] 耿国华[1] 

机构地区：[1]西北大学信息科学与技术学院,西安710127

出　　处：《计算机应用研究》2013年第10期3175-3177,共3页Application Research of Computers

基　　金：国家"973"计划资助项目(2011CB311802);国家自然科学基金面上项目(61172170)

摘　　要：针对三维模型中带有各种原因造成的孔洞,为后续的模型分析操作带来困难,提出了一种基于曲率特征的三维模型孔洞修补方法。其基本思想是利用波前法对孔洞进行快速填充获得初始的修补网格,再运用网格优化的技术依据孔洞边界点的曲率特征对初始网格进行调整。首先根据邻接三角形中边界边的性质识别出孔洞的边界,然后使用波前法和三角形顶点的夹角关系完成孔洞的初始填充,接着结合曲率标准对孔洞网格进行细化,最后对修补孔洞的网格顶点进行几何形态的调整,使其与周围网格自然过渡。实验表明该算法简单、稳定,可以完成不同类型的孔洞修补。Due to existing holes in the scanning 3D models, this paper presented a novel hole-filling algorithm based on the curvature character. The main idea of this approach was to fill the holes fast by advancing front method in order to obtain the initial patch mesh and the adjustment would be carried out by the curvature feature of edge point of holes. Firstly it extracted the boundary of hole based on the nature of adjacent triangles, then covered the hole by the initial patch mesh which obtained by using the advancing front method. Second it performed the subdivision for the patch mesh according to the standard of cur- vature. Finally it re-positioned the vertices of newly triangles by delaunay principle to make the patch better fitting the sur- rounding mesh. The experiment shows that this algorithm is simple, efficient and stable, which can repair different kind of holes.

关 键 词：三角网格 孔洞修补 波前法 三角剖分 网格细化 

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