Automatic repairing algorithm for complex holes of triangular mesh surfaces

Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science)

Volumn 41, Issue 3, 2007, Pages 407-411

  Li, Gen ^a   Chen, Zhi Yang ^b   Zhang, San Yuan ^a   Ye, Xiu Zi ^a  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Hole repairing; Point cloud; Reverse engineering; Triangular mesh

Indexed keywords

ALGORITHMS; EDGE DETECTION; EXPANSION; LEAST SQUARES APPROXIMATIONS; REPAIR; SURFACES; TRIANGULATION;

EDGE EXPANSION; HOLE REPAIRING; POINT CLOUD; TRIANGULAR MESH;

REVERSE ENGINEERING;

EID: 34248368128     PISSN: 1008973X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. LEVIN A. Filling a N-sided hole using combined sub division schemes[C]//Curves and Surfaces Proceedings. Saint-Malo, France: Vanderbilt University Press, 1999: 221-228.
2. CARR J, BEATSON R, CHERRIE J, et al. Reconstruction and representation of 3D objects with radial basis functions[C]//SIGGRAPH Proceedings. Los Angeles, USA: ACM, 2001: 67-76.
3. LIEPA P. Filling holes in meshes[C]//Eurographics Symposium on Geometric Proceedings. Aachen, Germany: ACM, 2003: 200-207.
4. YONGTAE J. A piecewise hole-filling algorithm in reverse engineering[J]. Computer Aided Design, 2005, 37(2): 263-270.
5. DEY T K. Delaunay triangulations in three dimensions with finite precision arithmetic[J]. Computer Aided Geometric Design, 1992, 9(6): 457-470.
6. LEE D T. Two algorithms for constructing a Delaunay triangulation[J]. International Journal of Computer and Information Science, 1980, 9(3): 219-242.
7. LEE D T. Generalized Delaunay triangulation for planar graphs[J]. Discrete and Computational Geometry, 1986, 1(1): 201-217.
8. BOIDSSINNAT J D. Shape reconstruction from planar sections[J]. Computer Vision Graphics Image Process, 1988, 44(1): 1-29.
9. PIEGL L A. Algorithm and data structure for triangulation multiply connected polygonal domains[J]. Computer and Graphics, 1993, 14(5): 563-574.
10. FLORIANI L D. An online algorithm for constrained Delaunay triangulation[J]. Graphical Models and Image Processing, 1992, 54(3): 290-300.
11. LIN H W, TAI C L, WANG G J. A mesh reconstruction algorithm driven by an intrinsic property of a point cloud[J]. Computer-Aided Design, 2004, 36(1): 1-9.
12. PFEIFLE R, SEIDEL H P. Triangular B-splines for blending and filling of polygonal holes[C]//Graphics Interface Proceedings.[S.l.]:[s.n.]. 1996: 186-193.