关键词: 孔洞修补； 三角剖分； 顶点密度； λ-μ方法

Abstract:

The authors proposed a filling hole algorithm in triangle mesh. First a set of new triangles on the holes was obtained by triangul
ating 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.

Key words: filling holes； triangulation； vertex density； λ-μ methods