Feature Preserving Mesh Generation from 3D Point Clouds

We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the covariance matrices of Voronoi cells, we first extract from the point cloud a set of sharp features. Our algorithm also runs on the input point cloud a reconstruction process, such as Poisson reconstruction, providing an implicit surface. A feature preserving variant of a Delaunay refinement process is then used to generate a mesh approximating the implicit surface and containing a faithful representation of the extracted sharp edges. Such a mesh provides an enhanced trade‐off between accuracy and mesh complexity. The whole process is robust to noise and made versatile through a small set of parameters which govern the mesh sizing, approximation error and shape of the elements. We demonstrate the effectiveness of our method on a variety of models including laser scanned datasets ranging from indoor to outdoor scenes.

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

[2]  Leonidas J. Guibas,et al.  Robust Voronoi-based curvature and feature estimation , 2009, Symposium on Solid and Physical Modeling.

[3]  Markus H. Gross,et al.  Feature Preserving Point Set Surfaces based on Non‐Linear Kernel Regression , 2009, Comput. Graph. Forum.

[4]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2003, ACM Trans. Graph..

[5]  Tamal K. Dey,et al.  Delaunay Refinement for Piecewise Smooth Complexes , 2007, SODA '07.

[6]  Greg Turk,et al.  Reconstructing surfaces using anisotropic basis functions , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[7]  Markus H. Gross,et al.  Multi‐scale Feature Extraction on Point‐Sampled Surfaces , 2003, Comput. Graph. Forum.

[8]  Jonathan Richard Shewchuk,et al.  Mesh generation for domains with small angles , 2000, SCG '00.

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

[10]  D. Cohen-Or,et al.  Robust moving least-squares fitting with sharp features , 2005, ACM Trans. Graph..

[11]  Cláudio T. Silva,et al.  Robust Smooth Feature Extraction from Point Clouds , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).

[12]  Wolfgang Straßer,et al.  Patch-Graph Reconstruction for Piecewise Smooth Surfaces , 2008, VMV.

[13]  Herbert Edelsbrunner,et al.  Triangulating topological spaces , 1994, SCG '94.

[14]  Joshua A. Levine,et al.  A Practical Delaunay Meshing Algorithm for aLarge Class of Domains* , 2007, IMR.

[15]  Marc Alexa,et al.  Sparse low-degree implicit surfaces with applications to high quality rendering, feature extraction, and smoothing , 2005, SGP '05.

[16]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

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

[18]  Cláudio T. Silva,et al.  Direct (Re)Meshing for Efficient Surface Processing , 2006, Comput. Graph. Forum.

[19]  Daniel Cohen-Or,et al.  Eurographics Symposium on Geometry Processing (2007) Data-dependent Mls for Faithful Surface Approximation , 2022 .

[20]  Sunil Arya,et al.  ANN: library for approximate nearest neighbor searching , 1998 .

[21]  Pierre Alliez,et al.  Computational geometry algorithms library , 2008, SIGGRAPH '08.

[22]  In-Kwon Lee,et al.  Curve reconstruction from unorganized points , 2000, Comput. Aided Geom. Des..

[23]  Markus H. Gross,et al.  Algebraic point set surfaces , 2007, ACM Trans. Graph..

[24]  Marc Alexa,et al.  Anisotropic point set surfaces , 2006, AFRIGRAPH '06.

[25]  Steve Oudot,et al.  Provably good sampling and meshing of surfaces , 2005, Graph. Model..