Abstract
Data missing was always when scanning plant organs by using 3D laser scanner, and this could lead to holes appearing in the mesh surface generated from the scanned point cloud. Basing on the analyzing to the geometrical features of different types of plant organs, a hole-filling algorithm was proposed which based on the normal vector of the mesh to make the repair area as close as possible to the original model of the organs mesh. The algorithm firstly extracts the hole boundary in the surface mesh, and compute the positions of new points based on the normal vector and normal curvature of the mesh boundary, then connects the new points and boundary points to generate a new triangular mesh. Experiments on different plant organs of geometric shapes were taken and new triangular mesh qualities were evaluated. Results show that the algorithm can fill holes in several kinds of scanned plant organs mesh quickly and efficiently.
Chapter PDF
Similar content being viewed by others
References
Zhao, C.J., Lu, S.L., Guo, X.Y., et al.: Exploration of digital plant and its technology system. Scientia Agricultura Sinica 43(10), 2023–2030 (2010)
Davis, J., Marschne, S.R., Garr, M., et al.: Filling holes in complex surfaces using volumetric diffusion. In: Proceedings of the First International Symposium on 3D Data Processing Visualization, and Transmission, pp. 428–438. IEEE Computer Society Press, Los Alamitos (2002)
Liepa, P.: Filling holes in meshes. In: Proceedings of the Eurographics, ACM SIGGRAPH Symposium on Processing, Aachen, Germany, pp. 200–205 (2003)
Zhang, J., Yue, W.N., Wang, N., et al.: Anisotropic Hole Filling Algorithm for Triangle Mesh Models. Journal of Computer-Aided Design & Computer Graphics 19(7), 892–897 (2007)
Wei, Z.L., Zhong, Y.X., Yuan, C.L., et al.: Research on Smooth Filling Algorithm of Large Holes in Triangular Mesh Model. China Mechanical Engineering 19(8), 949–954 (2008)
Zhao, W., Gao, S.M., Lin, H.W.: A robust hole-filling algorithm for triangular mesh. The Visual Computer 23(12), 987–997 (2007)
Wang, X.C., Cao, J.J., Liu, X.P., et al.: Advancing Front Method in Triangular Meshes Hole-Filling Application. Journal of Computer-Aided Design & Computer Graphics 23(6), 1048–1054 (2011)
Du, J., Zhang, L.Y., Wang, H.T., et al.: Hole Repairing in Triangular Meshes Based on Radial Basis Function. Journal of Computer-Aided Design & Computer Graphics 17(9), 1976–1982 (2005)
Wang, H.T., Zhang, L.Y., Li, Z.W., et al.: Repairing Holes in Triangular Meshes Based on Radial Basis Function Neural Network. China Mechanical Engineering 16(23), 2072–2079 (2005)
Qian, G.P., Pan, R.F., Tong, R.F.: Feature-preserving Mesh Completion. Journal of Image and Graphics 15(2), 334–339 (2010)
Lévy, B.: Dual domain extrapolation. In: Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, pp. 364–369. ACM Press, New York (2003)
Brunton, A., Wuhrer, S., Shu, C., et al.: Filling hole in triangular meshes by curve unfolding. In: Proceedings of IEEE International Conference on Shape Modeling and Applications, pp. 66–72. Institute of Electrical and Electronics Engineers Press, Beijing (2009)
Zhang, L.Y., Zhou, R.R., Zhou, L.S.: Research on the Algorithm of Hole Repairing in Mesh Surfaces. Journal of Applied Sciences 20(3), 221–224 (2002)
Taubin, G.: Estimating the tensor of curvature of a surface from a polyhedral approximation. In: Proceedings of Fifth International Conference on Computer Vision (ICCV 1995), pp. 902–907 (June 1995)
Field, D.A.: Qualitative measures for initial meshes. Numerical Methods in Engineering 47(4), 887–906 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Sun, Z., Guo, X., Lu, S., Wen, W., Chen, Y. (2014). Filling Holes in Triangular Meshes of Plant Organs. In: Li, D., Chen, Y. (eds) Computer and Computing Technologies in Agriculture VII. CCTA 2013. IFIP Advances in Information and Communication Technology, vol 420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54341-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-54341-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54340-1
Online ISBN: 978-3-642-54341-8
eBook Packages: Computer ScienceComputer Science (R0)