Minimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh

Abstract

Filling holes of 3D models is an important and complicated process. In this paper, we introduce a new and robust method for filling complex holes in triangular mesh models. In order to fill separate holes, the boundary edges of a hole are smoothly arranged and then locally uniform new points are added to the hole. The new points are selected by minimizing a hole filling area. The Delaunay triangulation method in a local area is applied for creating new meshes. By considering vertices of islands in a hole, new points can be added to the hole, which allows filling of a complex hole with islands.