Surface reconstruction from unorganized point clouds based on edge growing

Abstract

Owing to unorganized point cloud data, unexpected triangles, such as holes and slits, may be generated during mesh surface reconstruction. To solve this problem, a mesh surface reconstruction method based on edge growing from unorganized point clouds is proposed. The method first constructs an octree structure for unorganized point cloud data, and determines the k-nearest neighbor for each point. Subsequently, the method searches for flat areas in the point clouds to be used as the initial mesh edge growth regions, to avoid incorrect reconstruction of the mesh surface owing to the growth of initial sharp areas. Finally, the optimal mesh surface is obtained by controlling the mesh edge growing based on compulsive restriction and comprehensive optimization criteria. The experimental results of mesh surface reconstruction show that the method is feasible and shows high reconstruction performance without introducing holes or slits in the reconstructed mesh surface.

Keywords

Mesh surface reconstruction / Point clouds / Edge growing / Octree

References

[1] Boissonnat JD. Geometric structures for three-dimensional shape representation. ACM Trans Graph, 1984, 3(4): 266-286.

[2] Amenta N, Bern M, Kamvysselis M (1998) A new Voronoi-based surface reconstruction algorithm. In: Proceedings of the 25th annual conference on computer graphics and interactive techniques, Orlando, Florida, pp 415−421

[3] Amenta N, Choi S, Kolluri RK (2001) The power crust. In: Proceedings of the sixth ACM symposium on solid modeling and applications (SMA2001), Sheraton Inn, Ann Arbor, Michigan, pp 249−266

[4] Adamy U, Giesen J, John M. Surface reconstruction using umbrella filters. Int J Comput Geom, 2002, 21(1): 63-86.

[5] Mederos B, Amenta N, Velho L et al (2005) Surface reconstruction for noisy point clouds. In: Proceedings of the third eurographics symposium on geometry processing (SGP2005), Vienna, pp 53−62

[6] Carr JC, Beatson RK, Cherrie JB, et al (2001) Reconstruction and representation of 3D objects with radial basis functions. In: Proceedings of the 28th annual conference on computer graphics and interactive techniques, Los Angeles, CA, pp 67−76

[7] Alexa M, Behr J, Cohen-Or D, et al. Computing and rendering point set surfaces. IEEE Trans Vis Comput Graph, 2003, 9(1): 3-15.

[8] Du H, Qin H. A shape design system using volumetric implicit PDEs. Comput Aided Des, 2004, 36(11): 1101-1116.

[9] Ohtake Y, Belyaev A, Alexa M, et al. Multi-level partition of unity implicits. ACM Trans Graph, 2003, 22(3): 463-470.

[10] Kazhdan M, Bolitho M, Hoppe H (2006) Poisson surface reconstruction. In: Proceedings of the fourth eurographics symposium on geometry processing, Cagliari, Sardinia, pp 61−70

[11] Bemardini F, Mittleman J, Rushmeier H, et al. The ball-pivoting algorithm for surface reconstruction. IEEE Trans Vis Comput Graph, 1999, 5(4): 349-359.

[12] Kuo CC, Yau HT. A Delaunay-based region-growing approach to surface reconstruction from unorganized points. Comput Aided Des, 2005, 37(8): 825-835.

[13] Kuo CC, Yau HT. A new combinatorial approach to surface reconstruction with sharp features. IEEE Trans Vis Comput Graph, 2006, 12(1): 73-82.

[14] Gopi M, Krishnan S, Silva CT. Surface reconstruction based on lower dimensional localized delaunay triangulation. Comput Graph Forum, 2000, 19(3): 467-478.

[15] Crossno PJ, Angel ES (1999) Spiraling edge: fast surface reconstruction from partially organized sample points. In: Proceedings of the conference on visualization, San Francisco, CA, pp 317−324

[16] Li X, Han C, Wee WG. On surface reconstruction: a priority driven approach. Comput Aided Des, 2009, 41(9): 626-640.

[17] Huang H, Li D, Zhang H, et al. Consolidation of unorganized point clouds for surface reconstruction. ACM Trans Graph, 2009, 28(5): 1-7.

[18] Huang H, Wu S, Gong M, et al. Edge-aware point set resampling. ACM Trans Graph, 2013, 32(1): 1-12.

[19] Pal P. Fast freeform hybrid reconstruction with manual mesh segmentation. Int J Adv Manuf Technol, 2012, 63(9–12): 1205-1215.

[20] Guarato AZ, Quinsat Y, Mehdi-Souzani C, et al. Conversion of 3D scanned point cloud into a voxel-based representation for crankshaft mass balancing. Int J Adv Manuf Technol, 2017, 95(1–4): 1315-1324.

[21] Quinsat Y, Lartigue C. Filling holes in digitized point cloud using a morphing-based approach to preserve volume characteristics. Int J Adv Manuf Technol, 2015, 81(1–4): 411-421.

[22] Qin XJ, Duan ZJ, Zheng HB, et al. Efficient smoothness-preserving fusion modelling method for mesh models. Int J Simul Model, 2017, 16(3): 527-540.

[23] Long CJ, Zhao JH, Goonetilleke RS, et al. A new region growing algorithm for triangular mesh recovery from scattered 3D points. Lecture Notes Comput Sci, 2011, 6758: 237-246.

Funding

National Natural Science Foundation of China http://dx.doi.org/10.13039/501100001809(61702455)