A benchmark for surface reconstruction

We present a benchmark for the evaluation and comparison of algorithms which reconstruct a surface from point cloud data. Although a substantial amount of effort has been dedicated to the problem of surface reconstruction, a comprehensive means of evaluating this class of algorithms is noticeably absent. We propose a simple pipeline for measuring surface reconstruction algorithms, consisting of three main phases: surface modeling, sampling, and evaluation. We use implicit surfaces for modeling shapes which are capable of representing details of varying size and sharp features. From these implicit surfaces, we produce point clouds by synthetically generating range scans which resemble realistic scan data produced by an optical triangulation scanner. We validate our synthetic sampling scheme by comparing against scan data produced by a commercial optical laser scanner, where we scan a 3D-printed version of the original surface. Last, we perform evaluation by comparing the output reconstructed surface to a dense uniformly distributed sampling of the implicit surface. We decompose our benchmark into two distinct sets of experiments. The first set of experiments measures reconstruction against point clouds of complex shapes sampled under a wide variety of conditions. Although these experiments are quite useful for comparison, they lack a fine-grain analysis. To complement this, the second set of experiments measures specific properties of surface reconstruction, in terms of sampling characteristics and surface features. Together, these experiments depict a detailed examination of the state of surface reconstruction algorithms.

[1]  James F. O'Brien,et al.  Interpolating and approximating implicit surfaces from polygon soup , 2005, SIGGRAPH Courses.

[2]  Jean-Daniel Boissonnat,et al.  Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2002, Comput. Geom..

[3]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[4]  Jean-Yves Bouguet,et al.  Camera calibration toolbox for matlab , 2001 .

[5]  M. Gross,et al.  Algebraic point set surfaces , 2007, SIGGRAPH 2007.

[6]  Marc Alexa,et al.  Approximating and Intersecting Surfaces from Points , 2003, Symposium on Geometry Processing.

[7]  William C. Regli,et al.  A repository for design, process planning and assembly , 1997, Comput. Aided Des..

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

[9]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[10]  Yutaka Ohtake,et al.  Smoothing of Partition of Unity Implicit Surfaces for Noise Robust Surface Reconstruction , 2009, Comput. Graph. Forum.

[11]  Günther Greiner,et al.  Surface Reconstruction Based on Hierarchical Floating Radial Basis Functions , 2010, Comput. Graph. Forum.

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

[13]  Sunghee Choi,et al.  A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..

[14]  Nina Amenta,et al.  Rotating Scans for Systematic Error Removal , 2009, Comput. Graph. Forum.

[15]  Ravi Krishna Kolluri,et al.  Provably good moving least squares , 2005, SIGGRAPH Courses.

[16]  Marc Levoy,et al.  Better optical triangulation through spacetime analysis , 1995, Proceedings of IEEE International Conference on Computer Vision.

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

[18]  David Levin,et al.  Derivation and Analysis of Green Coordinates , 2010 .

[19]  Josiah Manson,et al.  Streaming Surface Reconstruction Using Wavelets , 2008, Comput. Graph. Forum.

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

[21]  Tamal K. Dey,et al.  Eurographics Symposium on Point-based Graphics (2005) Normal Estimation for Point Clouds: a Comparison Study for a Voronoi Based Method , 2022 .

[22]  Hans-Peter Seidel,et al.  An integrating approach to meshing scattered point data , 2005, SPM '05.

[23]  Tamal K. Dey,et al.  Approximate medial axis for CAD models , 2003, SM '03.

[24]  Michael M. Kazhdan,et al.  Reconstruction of solid models from oriented point sets , 2005, SGP '05.

[25]  Joachim Giesen,et al.  Delaunay Triangulation Based Surface Reconstruction , 2006 .

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

[27]  M. Rioux,et al.  Influence of speckle on laser range finders. , 1991, Applied optics.

[28]  Hans-Peter Seidel,et al.  3D scattered data interpolation and approximation with multilevel compactly supported RBFs , 2005, Graph. Model..

[29]  Daniel Cohen-Or,et al.  Space-time surface reconstruction using incompressible flow , 2008, ACM Trans. Graph..

[30]  Remco C. Veltkamp,et al.  A Comparison of Systems and Tools for 3D Scanning , 2005 .

[31]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[32]  D. Cohen-Or,et al.  Curve skeleton extraction from incomplete point cloud , 2009, SIGGRAPH 2009.

[33]  Szymon Rusinkiewicz,et al.  Global non-rigid alignment of 3-D scans , 2007, SIGGRAPH 2007.

[34]  Christian Früh,et al.  Data Processing Algorithms for Generating Textured 3D Building Facade Meshes from Laser Scans and Camera Images , 2005, International Journal of Computer Vision.

[35]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[36]  Niloy J. Mitra,et al.  Estimating surface normals in noisy point cloud data , 2003, SCG '03.

[37]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[38]  Pierre Alliez,et al.  Eurographics Symposium on Geometry Processing (2007) Voronoi-based Variational Reconstruction of Unoriented Point Sets , 2022 .

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

[40]  Leonidas J. Guibas,et al.  Robust single-view geometry and motion reconstruction , 2009, ACM Trans. Graph..

[41]  Daniel Cohen-Or,et al.  SmartBoxes for interactive urban reconstruction , 2010, ACM Transactions on Graphics.

[42]  Li-Yi Wei,et al.  Parallel Poisson disk sampling with spectrum analysis on surfaces , 2010, ACM Trans. Graph..

[43]  Matthew J. Sottile,et al.  Curve and surface reconstruction: algorithms with mathematical analysis by Tamal K. Dey Cambridge University Press , 2010, SIGA.

[44]  Tim Weyrich,et al.  Learning how to match fresco fragments , 2011, JOCCH.

[45]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

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

[47]  Ariel Shamir,et al.  Cone carving for surface reconstruction , 2010, SIGGRAPH 2010.

[48]  Junjie Cao,et al.  Point Cloud Skeletons via Laplacian Based Contraction , 2010, 2010 Shape Modeling International Conference.

[49]  Jovan Popović,et al.  Dynamic shape capture using multi-view photometric stereo , 2009, SIGGRAPH 2009.

[50]  K. Polthier,et al.  On the convergence of metric and geometric properties of polyhedral surfaces , 2007 .

[51]  Ross T. Whitaker,et al.  Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles , 2007, IEEE Transactions on Visualization and Computer Graphics.

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

[53]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[54]  Richard Szeliski,et al.  A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).