Automatic construction of watertight manifold triangle meshes from scanned point clouds using matched umbrella facets

ABSTRACTGeneration of watertight manifold triangle meshes from scanned point clouds has emerged as a key task in computer-aided design and inspection. An effective algorithm is presented in this paper, targeting the automatic creation of such triangle meshes from unorganized, scanned data points. The algorithm builds on the initial version of the Umbrella Facet Matching (UFM) algorithm developed by the authors. The mesh generation process starts with Delaunay triangulation of the given point cloud to determine the Delaunay triangle set at each data point. The algorithm then seeks to iteratively generate, in parallel, the local 2-dimensional manifold triangle mesh, resembling the shape of an open umbrella, at each data point from its Delaunay triangle set that fully overlaps with its neighboring umbrellas. Particularly, a four-level inheritance priority queuing mechanism is introduced to enhance the prioritization and ordering of the Delaunay triangles at each data point in order to facilitate the iterativ...

[1]  Remco C. Veltkamp,et al.  The gamma-neighborhood Graph , 1992, Comput. Geom..

[2]  Chiew-Lan Tai,et al.  A mesh reconstruction algorithm driven by an intrinsic property of a point cloud , 2004, Comput. Aided Des..

[3]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[4]  James F. O'Brien,et al.  Shape transformation using variational implicit functions , 1999, SIGGRAPH Courses.

[5]  Ji Ma,et al.  Delaunay-based triangular surface reconstruction from points via Umbrella Facet Matching , 2010, 2010 IEEE International Conference on Automation Science and Engineering.

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

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

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

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

[10]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

[11]  David Cohen-Steiner,et al.  A greedy Delaunay-based surface reconstruction algorithm , 2004, The Visual Computer.

[12]  Tamal K. Dey,et al.  Tight cocone: a water-tight surface reconstructor , 2003, SM '03.

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

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

[15]  Greg Turk,et al.  Reconstructing Surfaces by Volumetric Regularization Using Radial Basis Functions , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Xiaolong Xu,et al.  Automatic surface reconstruction with alpha-shape method , 2003, The Visual Computer.

[17]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1992, VVS.

[18]  Chia-Hsiang Menq,et al.  Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology , 2002, Comput. Aided Des..

[19]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

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

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