三角网格中的孔洞修补算法

摘要

The authors proposed a filling hole algorithm in triangle mesh. First a set of new triangles on the holes was obtained by triangulating the hole directly via the principle of the smallest angle. Then an initial patching mesh was got through increasing points for the subdivision the set of new triangles with the help of the optimization principle of the circle and the largest angle according to the density of vertex on boundary edges. Final patching mesh was got through using λ-μ method to optimize the initial patching mesh. Experimental results show that the algorithm has many advantages, such as high efficiency, accuracy and so on.%提出一种三角网格中的孔洞修补算法, 先应用最小内角原则, 对孔洞直接进行三角剖分得到孔洞剖分的新三角形集合, 然后依据孔洞边界顶点密度, 应用圆和最大内角优化原则, 对新三角形集合进行加点细分得到初始补丁网格, 最后应用λ-μ方法对初始补丁网格进一步优化, 得到最终的补丁网格. 实验结果表明, 该算法效率高、准确性好.