An automatic hole-filling algorithm for polygon meshes

Xiao J. Wu, Michael Y. Wang, B. Han

Research output: Contribution to journalArticleResearchpeer-review

24 Citations (Scopus)


This paper addresses the problem of automatic hole-filling on polygon meshes based on radial basis functions (RBFs). Firstly, we use the topology connectivity of a watertight triangle mesh to detect the undesired holes. Secondly, 2 or 3-ring vertexes of the boundary of the holes are sampled from the original mesh. Thirdly, a surface patch is reconstructed from the sampled interpolation points by using RBFs. In order to stitch the surface patch and the original mesh with holes, we project the surface patch and the boundary polygon of the holes onto a plane with maximum areas, which can reduce the complexity by converting the problem from 3D into 2D. After we blend the projected polygons and the projected surface patches, then they are remapped into 3D space to finish the stitch operation. Lots of experiments reveal the efficiency and accuracy of our proposed algorithm.

Original languageEnglish
Pages (from-to)889-899
Number of pages11
JournalComputer-Aided Design and Applications
Issue number6
Publication statusPublished - 2008
Externally publishedYes


  • Geometry processing
  • Hole filling algorithm
  • Radial basis functions

Cite this