New hole filling algorithm based on boundary-feature growing

Yong Mei Liu*, Feng Xia Li, Zheng Chao Lei, Yue Yu, Qing Yun Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Aiming at restoring the triangle mesh with holes caused by missing data in reverse engineering, a new hole-filling algorithm based on the boundary-feature growing method was proposed. After the identifying of the hole was completed, the algorithm began insert new point(s) with the smallest angle formed by two adjacent edges of one boundary point, the position of the new point(s) being calculated from the geometric feature of the boundary triangles reasonably and new triangles being generated. Then, the next point in the hole boundary was selected to compute the insert point(s) orderly. The hole was divided into two sub-holes if the new point passed the validation of the inset position. Above process moved in circle until the original hole was closed. Experimental results show that this method can establish triangles with good quality, maintain feature of original mesh, and integrate the new triangles with boundary triangles.

Original languageEnglish
Pages (from-to)1916-1921
Number of pages6
JournalXitong Fangzhen Xuebao / Journal of System Simulation
Volume26
Issue number9
Publication statusPublished - 8 Sept 2014

Keywords

  • Boundary-feature
  • Hole-filling
  • Reverse engineering
  • Triangular mesh

Fingerprint

Dive into the research topics of 'New hole filling algorithm based on boundary-feature growing'. Together they form a unique fingerprint.

Cite this