A New Hole Filling Algorithm in Space for Triangular Model

Abstract:

Article Preview

Aiming at filling the holes which were generated from uncompleted point cloud data in reverse engineering, a new hole filling algorithm in space is presented. Firstly, the holes boundary was identified and pretreated, and the hole boundary feature datum was established and the boundary was projected on it to form a projection polygon. Secondly, the smallest angle of the projection polygon was found out to determine the corresponding boundary point as the mesh growing point. The original hole was covered by the new meshes covering and then filling algorithm was completed. Finally, the neighborhood points of hole boundary vertex were selected as the sampling points for the least squares fitting adjustment of new filled vertices position, which aims at the preparation hole filled result. Examples are given to prove that the method has good accuracy and stability of the hole filling.

Info:

Periodical:

Edited by:

Fei Hu and Beibei Wang

Pages:

200-206

DOI:

10.4028/www.scientific.net/AMR.279.200

Citation:

J. Chen et al., "A New Hole Filling Algorithm in Space for Triangular Model", Advanced Materials Research, Vol. 279, pp. 200-206, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.