On the development of a hole filling algorithm for triangular meshes

Jiing Yih Lai, Sheng Han Hsu

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Hole-filling is a process to repair the holes in a triangular model and to keep the topology accurate and preserve the smoothness of the original surface as new meshes are added. We propose a hole-filling algorithm by fitting the vertices in the vicinity of a hole into a B-spline surface and plan new vertices on the u-v domain corresponding to such a surface. The main advantage of such a method is that the u-v plane, instead of a 3D plane conventionally used, can better be used for the planning of new vertices distributed appropriately on the hole, especially for curved holes with steep slopes. The points on the u-v plane are mapped onto the B-spline surface to yield 3D vertices. Since the surface does not pass through the boundary vertices of the hole completely, a modification algorithm based on the local moving least squares method is proposed to modify the 3D vertices. Successful examples are presented to illustrate the feasibility of the proposed algorithm.


  • Hole filling
  • Moving least squares
  • Triangular meshes


Dive into the research topics of 'On the development of a hole filling algorithm for triangular meshes'. Together they form a unique fingerprint.

Cite this