An algorithm for filling complex holes in reverse engineering

Engineering with Computers

Volumn 24, Issue 2, 2008, Pages 119-125

  Li, Gen ^a   Ye, Xiu Zi ^a   Zhang, San Yuan ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Hole filling; Point cloud; Reverse engineering; Triangular mesh

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; RAPID PROTOTYPING;

HOLE FILLING; POINT CLOUD; TRIANGULAR MESH;

REVERSE ENGINEERING;

EID: 42649127407     PISSN: 01770667     EISSN: 14355663     Source Type: Journal    
DOI: 10.1007/s00366-007-0075-9     Document Type: Article

References (19)

1. Levin A (1999) Filling an N-sided hole using combined subdivision schemes. In: Curves and surfaces proceedings, pp 221-228
2. Chui C, Lai M-J (2000) Filling polygonal holes using C1 cubic triangular spline patches. Comput Aided Geom Des 17(4):297-307
3. Curless B, Levoy M (1996) A volumetric method for building complex models from range image. In: Computer graphics (Proc SIGGRAPH) 30, pp 303-312
4. Carr J, Beatson R., Cherrie J, Mitchell T, Fright W, McCallum B (2001) Reconstruction and representation of 3D objects with radial basis functions In: Computer graphics (Proc SIGGRAPH), pp 67-76
5. Liepa P (2003) Filling holes in meshes. In: Eurographics symposium on geometric processing, pp 200-207
6. Jun Y (2005) A piecewise hole filling algorithm in reverse engineering. Comput Aided Des 37(2):263-270
7. David C-S, Jean-Marie M (2003) Restricted Delaunay triangulations and normal cycle. In: Proceedings of the 19th annual symposium on computational geometry, pp 312-321
8. Erkki Oja (1989) Neural networks, principal components, and subspaces. Int J Neural Syst 1(1):61-68
9. Girod B, Greiner G, Niemann H (2000) Principles of 3D image analysis and synthesis. Kluwer, Dordrecht
10. Dey Tk (1992) Delaunay triangulations in three dimensions with finite precision arithmetic. Comput Aided Geom Des 9(6):457-470
11. Lee DT (1980) Two algorithms for constructing a Delaunay triangulation. Int J Comput Inf Sci 9(3):219-242
12. Lee DT (1986) Generalized Delaunay triangulation for planar graphs. Discrete Comput Geom 1:201-217
13. Boidssinnat JD (1988) Shape reconstruction from planar sections. Comput Vis Graph Image Proc 44(1):1-29
14. Piegl LA (1993) Algorithm and data structure for triangulation multiply connected polygonal domains. Comput Graph 14(5):563-574
15. Floriani LD (1992) An online algorithm for constrained Delaunay triangulation. Graph Models Image Process 54(3):290-300
16. Sloan SW (1987) A fast algorithm for constructing Delaunay triangulation in the plane. Adv Eng Softw 9(1):34-55
17. Perrin DP, Ladd AM, Kavraki LE, Howe RD, Cannon JW (2005) Fast intersection checking for parametric deformable models 5747:1468-1474
18. Lin H-W, Tai C-L, Wang G-J (2004) A mesh reconstruction algorithm driven by an intrinsic property of a point cloud. Comput Aided Des 36(1):1-9
19. Zhang X, Zhou M, Guohua G (2003) A method of detecting the edge of triangular mesh surface (in Chinese). J Image Graph 8(10):1223-1226