Surface reconstruction from unorganized point clouds based on edge growing

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.

[1]  Pralay Pal,et al.  Fast freeform hybrid reconstruction with manual mesh segmentation , 2012 .

[2]  Jean-Daniel Boissonnat,et al.  Geometric structures for three-dimensional shape representation , 1984, TOGS.

[3]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[4]  Daniel Cohen-Or,et al.  Edge-aware point set resampling , 2013, ACM Trans. Graph..

[5]  David A. Forsyth,et al.  Generalizing motion edits with Gaussian processes , 2009, ACM Trans. Graph..

[6]  Joachim Giesen,et al.  Surface reconstruction using umbrella filters , 2002, Comput. Geom..

[7]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2005, SIGGRAPH Courses.

[8]  Ravindra S. Goonetilleke,et al.  A New Region Growing Algorithm for Triangular Mesh Recovery from Scattered 3D Points , 2011, Trans. Edutainment.

[9]  Yann Quinsat,et al.  Filling holes in digitized point cloud using a morphing-based approach to preserve volume characteristics , 2015 .

[10]  Xiaokun Li,et al.  On surface reconstruction: A priority driven approach , 2009, Comput. Aided Des..

[11]  Michael M. Kazhdan,et al.  Poisson surface reconstruction , 2006, SGP '06.

[12]  Marshall W. Bern,et al.  A new Voronoi-based surface reconstruction algorithm , 1998, SIGGRAPH.

[13]  Hans-Peter Seidel,et al.  An efficient construction of reduced deformable objects , 2013, ACM Trans. Graph..

[14]  Hong Qin,et al.  A shape design system using volumetric implicit PDEs , 2004, Comput. Aided Des..

[15]  Marc Alexa,et al.  Computing and Rendering Point Set Surfaces , 2003, IEEE Trans. Vis. Comput. Graph..

[16]  Patricia Crossno,et al.  Spiraling Edge: fast surface reconstruction from partially organized sample points , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[17]  Hong-Tzong Yau,et al.  A Delaunay-based region-growing approach to surface reconstruction from unorganized points , 2005, Comput. Aided Des..

[18]  H. B. Zheng,et al.  Efficient Smoothness-Preserving Fusion Modelling Method for Mesh Models , 2017 .

[19]  Hong-Tzong Yau,et al.  A new combinatorial approach to surface reconstruction with sharp features , 2006, IEEE Transactions on Visualization and Computer Graphics.

[20]  Gabriel Taubin,et al.  The ball-pivoting algorithm for surface reconstruction , 1999, IEEE Transactions on Visualization and Computer Graphics.

[21]  Charyar Mehdi-Souzani,et al.  Conversion of 3D scanned point cloud into a voxel-based representation for crankshaft mass balancing , 2018 .

[22]  Richard K. Beatson,et al.  Reconstruction and representation of 3D objects with radial basis functions , 2001, SIGGRAPH.

[23]  Meenakshisundaram Gopi,et al.  Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation , 2000, Comput. Graph. Forum.