Journal of Software, Vol 7, No 1 (2012), 141-148, Jan 2012
doi:10.4304/jsw.7.1.141-148

Filling Holes in Triangular Meshes in Engineering

Ping Hu, Changsheng Wang, Baojun Li, Mingzeng Liu

Abstract


In this paper, a novel hole-filling algorithm for triangular meshes is proposed. Firstly, the hole is triangulated into a set of new triangles using modified principle of minimum angle. Then the initial patching mesh is refined according to the density of vertices on boundary edges. Finally, the patching mesh is optimized via the bilateral filter to recover missed features. Experimental results demonstrate that the proposed algorithm fills complex holes robustly, and preserves geometric features to a certain extent as well. The resulted meshes are of good quality for engineering.


Keywords


hole-filling; triangulation; refinement; bilateral filter

References


B.J. Li, X.K. Zhang P. Zhou and P. Hu, “Mesh parameterization based on one-step inverse forming,” Comput. Aided Des. 42(7), pp. 633-640, 2010.
[2] S. Gao, W. Zhao, H. Lin, F.Yang and X. Chen, “Feature suppression based cad mesh model simplification,” Computer-Aided Design, 42(12), pp. 1178-1188, 2010.
[3] R. Lou, J.-P. Pernot, A. Mikchevitch and P. Véron, “ Merging enriched finite element triangle meshes for fast prototyping of alternate solutions in the context of industrial maintenance,” Comput. Aided Des. 42(8), pp. 670-681, 2010.
[4] Y. Ohtake, A. Belyaev and H.-P. Seidel, “Ridge-valley lines on meshes via implicit surface fitting,” ACM Transactions on Graphics, 23(3), pp. 609-612, 2004.
[5] T. Ju, “Fixing geometric errors on polygonal models: a survey,” Journal of Computer Science and Technology, 24(1), pp. 19-29, 2009.
[6] J. Davis, S.R. Marschner, M. Garr and M. Levoy, “Filling holes in complex surfaces using volumetric diffusion,” In: First International Symposium on 3D Data Processing Visualization and Transmission, Padova, pp. 428-438, 2002.
[7] T.-Q. Guo, J.-J. Li, J.-G. Weng and Y.-T. Zhuang, “Filling holes in complex surfaces using oriented voxel diffusion,” In: 2006 International Conference on Machine Learning and Cybernetics, IEEE, Los Alamitos, pp. 4370-4375, 2006.
[8] F.S. Nooruddin and G. Turk, “Simplification and repair of polygonal models using volumetric techniques,” IEEE Transactions on Visualization and Computer Graphics, 9(2), pp. 191-205, 2003.
[9] T. Ju, “Robust repair of polygonal models,” ACM Transactions on Graphics, 23(3), pp. 888- 895, 2004.
[10] P. Liepa, “Filling holes in meshes,” In: SGP '03: Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing. Aire-la-Ville, Switzerland: Eurographics Association, pp. 200-205, 2003.
[11] G. Barequet and M. Sharir, “Filling gaps in the boundary of a polyhedron,” Computer Aided Geometric Design, 12(2), pp. 207-229, 1995.
[12] R. Pfeifle and H.-P. Seidel, “Triangular B-splines for blending and filling of polygonal holes,” In: Proceedings of Graphics Interface, pp. 186-193, 1996.
[13] L. Kobbelt, S. Campagna, J. Vorsatz and H.-P. Seidel, “Interactive multi-resolution modeling on arbitrary meshes,” In: Proceedings of SIGGRAPH’98, pp. 105-114, 1998.
[14] A. Brunton, S. Wuhrer, C. Shu, P. Bose and E.D. Demaine, “Filling holes in triangular meshes by curve unfolding,” In: IEEE International Conference on Shape Modeling and Applications, pp. 66-72, 2009.
[15] W. Zhao, S.M. Gao and H.W. Lin, “A robust hole-filling algorithm for triangular mesh,” The Visual Computer: International Journal of Computer Graphics, 23(12), pp. 987-997, 2007.
[16] Y. Jun, “A piecewise hole filling algorithm in reverse engineering,” Computer-Aided Design, 37(2), 263-270, 2005.
[17] G. Li, X.Z. Ye and S.Y. Zhang, “An algorithm for filling complex holes in reverse engineering,” Engineering with Computers, 24(2), pp. 119-125, 2008.
[18] C.Y. Chen and K.Y. Cheng, “A sharpness-dependent filter for recovering sharp features in repaired 3D mesh models,” IEEE Transactions on visualization and computer graphics, 14(1), 200-212, 2008.
[19] C.Y. Chen and K.Y. Cheng, “A sharpness dependent filter for mesh smoothing,” Comput. Aided Geom. Des., 22(5), 376-391, 2005.
[20] Z. Li, D.S. Meek and D.J. Walton, “Polynomial blending in a mesh hole-filling application,” Computer-Aided Design, 42, pp. 340-349, 2010.
[21] S. Fleishman, I. Drori and D. Cohen-Or, “Bilateral mesh denoising,” ACM Transactions on Graphics, 22(3), pp. 950-953, 2003.
[22] T.R. Jones, F. Durand and M. Desbrun, “Non-iterative, feature-preserving mesh smoothing,” ACM Transactions on Graphics, pp. 943-949, 2003.
[23] F. Vivodtzev, L. Linsen, B. Hamann, K.I. Joy and B.A. Olshausen, “Brain mapping using topology graphs obtained by surface segmentation,” In: Scientific Visualization: The Visual Extraction of Knowledge from Data, Springer Berlin Heidelberg, Schloss Dagstuhl, Allemagne, pp. 35-48, 2006.
[24] D.A. Field, “Qualitative measures for initial meshes,” International Journal for Numerical Methods in Engineering, 47, pp. 887-906, 2000.


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

Copyright @ 2006-2013 by ACADEMY PUBLISHER – All rights reserved.