The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2008 vol.14)
pp: 200-212
ABSTRACT
This paper presents a sharpness-based method for hole-filling that can repair a 3D model such that its shape conforms to that of the original model. The method involves two processes: interpolation-based hole-filling, which produces an initial repaired model; and post-processing, which adjusts the shape of the initial repaired model to conform to that of the original model. In the interpolation-based hole-filling process, a surface interpolation algorithm based on the radial basis function creates a smooth implicit surface that fills the hole. Then, a regularized marching tetrahedral algorithm is used to triangulate the implicit surface. Finally a stitching and regulating strategy is applied to the surface patch and its neighboring boundary polygon meshes to produce an initial repaired mesh model, which is a regular mesh model suitable for post-processing. During post-processing, a sharpness dependent filtering algorithm is applied to the initial repaired model. This is an iterative procedure whereby each iteration step adjusts the face normal associated with each meshed polygon to recover the sharp features hidden in the repaired model. The experiment results demonstrate that the method is effective in repairing incomplete 3D mesh models.
INDEX TERMS
Feature representation, Filtering, Geometric correction, Surface fitting, Mesh repair
CITATION
Chun-Yen Chen, Kuo-Young Cheng, "A Sharpness-Dependent Filter for Recovering Sharp Features in Repaired 3D Mesh Models", IEEE Transactions on Visualization & Computer Graphics, vol.14, no. 1, pp. 200-212, January/February 2008, doi:10.1109/TVCG.2007.70625
REFERENCES
[1] M. Attene, B. Falcidieno, J. Rossignac, and M. Spagnuolo, “Edge-Sharpener: Recovering Sharp Features in Triangulations of Non-Adaptively Re-Meshed Surfaces,” Proc. First Eurographics Symp. Geometry Processing (SGP '03), pp. 63-72, 2003.
[2] T.P. Breckon and R.B. Fisher, “Non-Parametric 3D Surface Completion,” Proc. Fifth Int'l Conf. 3D Digital Imaging and Modeling (3DIM '05), pp. 573-580, 2005.
[3] J.C. Carr, R.K. Beatson, J.B. Cherrie, T.J. Mitchell, W.R. Fright, B.C. McCallum, and T.R. Evans, “Reconstruction and Representation of 3D Objects with Radial Basis Functions,” Proc. ACM SIGGRAPH '01, pp. 67-76, 2001.
[4] J.C. Carr, W.R. Fright, and R.K. Beatson, “Surface Interpolation with Radial Basis Functions for Medical Imaging,” IEEE Trans. Medical Imaging, vol. 16, no. 1, pp. 96-107, Feb. 1997.
[5] C.Y. Chen and K.Y. Cheng, “A Sharpness Dependent Filter for Mesh Smoothing,” Computer Aided Geometric Design, vol. 22, no. 5, pp. 376-391, 2005.
[6] C.Y. Chen, K.Y. Cheng, and H.Y. Liao, “A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling,” Proc. Ann. Conf. European Assoc. Computer Graphics (Eurographics '05), pp. 13-16, 2005.
[7] S.L. Chan and E.O. Purisima, “A New Tetrahedral Tessellation Scheme for Isosurface Generation,” Computers & Graphics, vol. 22, no. 1, pp. 83-90, 1998.
[8] U. Clarenz, U. Diewald, G. Dziuk, M. Rumpf, and R. Rusu, “A Finite Element Method for Surface Restoration with Smooth Boundary Conditions,” Computer Aided Geometric Design, vol. 21, no. 5, pp. 427-445, 2004.
[9] J. Davis, S.R. Marschner, M. Garr, and M. Levoy, “Filling Holes in Complex Surfaces Using Volumetric Diffusion,” Proc. First Int'l Symp. 3D Data Processing Visualization and Transmission, pp. 428-439, June 2002.
[10] J. Duchon, “Splines Minimizing Rotation-Invariant Semi-Norms in Sobolev Spaces,” Lecture Notes in Math, vol. 571, pp. 85-100, 1976.
[11] T. Ju, “Robust Repair of Polygonal Models,” ACM Trans. Graphics, Proc. ACM SIGGRAPH '04, vol. 23, no. 3, pp. 888-895, 2004.
[12] L.P. Kobbelt, M. Botsch, U. Schwanecke, and H.P. Seidel, “Feature Sensitive Surface Extraction from Volume Data,” Proc. ACM SIGGRAPH '01, pp. 57-66, 2001.
[13] V. Kraevoy and A. Sheffer, “Template-Based Mesh Completion,” Proc. Third Eurographics/ACM Symp. Geometry Processing (SGP '05), pp. 13-22, 2005.
[14] P. Liepa, “Filling Holes in Meshes,” Proc. First Eurographics/ACM Symp. Geometry Processing (SGP '03), pp. 200-205, 2003.
[15] W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics, vol. 21, pp. 163-169, 1987.
[16] S. Nakamura, Applied Numerical Methods in C. Prentice Hall, 1992.
[17] M.X. Nguyen, X. Yuan, and B. Chen, “Geometry Completion and Detail Generation by Texture Synthesis,” The Visual Computer, vol. 21, pp. 669-678, 2005.
[18] F.S. Nooruddin and G. Turk, “Simplification and Repair of Polygonal Models Using Volumetric Techniques,” IEEE Trans. Visualization and Computer Graphics, vol. 9, no. 2, pp. 191-205, Apr.-June 2003.
[19] Y. Ohtake, A. Belyaev, M. Alexa, G. Turk, and H.P. Seidel, “Multi-Level Partition of Unity Implicits,” ACM Trans. Graphics, Proc. ACM SIGGRAPH '03, vol. 22, no. 3, pp. 463-470, 2003.
[20] S. Park, X. Guo, H. Shin, and H. Qin, “Surface Completion for Shape and Appearance,” The Visual Computer, vol. 22, pp. 168-180, 2006.
[21] M. Pauly, N.J. Mitra, J. Giesen, M.H. Gross, and L.J. Guibas, “Example-Based 3D Scan Completion,” Proc. Third Eurographics Symp. Geometry Processing (SGP '05), pp. 23-32, 2005.
[22] R. Pfeifle and H.P. Seidel, “Triangular B-Splines for Blending and Filling of Polygonal Holes,” Proc. Graphics Interface Conf. (GI '96), pp. 186-193, 1996.
[23] J. Podolak and S. Rusinkiewicz, “Atomic Volumes for Mesh Completion,” Proc. Third Eurographics Symp. Geometry Processing (SGP '05), pp. 33-41, 2005.
[24] R.J. Schalkoff, Pattern Recognition, Statistical, Structural and Neural Approaches. John Wiley & Sons, 1992.
[25] A. Sharf, M. Alexa, and D. Cohen-Or, “Context-Based Surface Completion,” ACM Trans. Graphics, Proc. ACM SIGGRAPH '04, vol. 23, no. 3, pp. 878-887, 2004.
[26] T. Tasdizen, R. Whitaker, P. Burchard, and S. Osher, “Geometric Surface Smoothing via Anisotropic Diffusion of Normals,” Proc. IEEE Visualization Conf. (VIS '02), pp. 125-132, 2002.
[27] T. Tasdizen, R. Whitaker, P. Burchard, and S. Osher, “Geometric Surface Processing via Normal Maps,” ACM Trans. Graphics, vol. 22, no. 4, pp. 1012-1033, 2003.
[28] L.S. Tekumalla and E. Cohen, “A Hole-Filling Algorithm for Triangular Meshes,” Technical Report UUCS-04-019, School of Computing, Univ. of Utah, Dec. 2004.
[29] G.M. Treece, R.W. Prager, and A.H. Gee, “Regularised Marching Tetrahedral: Improved Iso-Surface Extraction,” Computers & Graphics, vol. 23, pp. 583-598, 1999.
[30] G. Turk and J.F. O'Brien, “Variational Implicit Surfaces,” Technical Report GITGVU-99-15, Georgia Inst. of Tech nology, 1999.
[31] J. Verdera, V. Caselles, M. Bertalmio, and G. Sapiro, “Inpainting Surface Holes,” Proc. Int'l Conf. Image Processing (ICIP '03), vol. 2, pp. 14-17, 2003.
[32] J. Wang and M. Oliveira, “A Hole-Filling Strategy for Reconstruction in Smooth Surfaces in Range Images,” Proc. 16th Brazilian Symp. Computer Graphics and Image Processing, pp. 11-18, 2003.
[33] G. Yngve and G. Turk, “Robust Creation of Implicit Surfaces from Polygonal Meshes,” IEEE Trans. Visualization and Computer Graphics, vol. 8, no. 4, pp. 346-359, Oct.-Dec. 2002.
[34] S. Yoshizawa, “Stable Discrete 2D and 3D Curvature Flows,” J.Three Dimensional Images, vol. 15, no. 1, pp. 137-142, 2001.
[35] S. Yoshizawa and A.G. Belyaev, “Fair Triangle Mesh Generation with Discrete Elastica,” Proc. Geometric Modeling and Processing—Theory and Applications, pp. 119-123, 2002.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool