Completion and Reconstruction with Primitive Shapes

We consider the problem of reconstruction from incomplete point‐clouds. To find a closed mesh the reconstruction is guided by a set of primitive shapes which has been detected on the input point‐cloud (e.g. planes, cylinders etc.). With this guidance we not only continue the surrounding structure into the holes but also synthesize plausible edges and corners from the primitives' intersections. To this end we give a surface energy functional that incorporates the primitive shapes in a guiding vector field. The discretized functional can be minimized with an efficient graph‐cut algorithm. A novel greedy optimization strategy is proposed to minimize the functional under the constraint that surface parts corresponding to a given primitive must be connected. From the primitive shapes our method can also reconstruct an idealized model that is suitable for use in a CAD system.

[1]  Wolfgang Straßer,et al.  Surface Reconstruction from Fitted Shape Primitives , 2008, VMV.

[2]  Wolfgang Straßer,et al.  Bayesian Point Cloud Reconstruction , 2006, Comput. Graph. Forum.

[3]  Manuel Menezes de Oliveira Neto,et al.  Improved Scene Reconstruction from Range Images , 2002, Comput. Graph. Forum.

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

[5]  Bobby Bodenheimer,et al.  Synthesis and evaluation of linear motion transitions , 2008, TOGS.

[6]  Chi-Keung Tang,et al.  Inference of segmented color and texture description by tensor voting , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Reinhard Klein,et al.  Efficient RANSAC for Point‐Cloud Shape Detection , 2007, Comput. Graph. Forum.

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

[9]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[10]  Tao Ju,et al.  Robust repair of polygonal models , 2004, ACM Trans. Graph..

[11]  Tao Ju.  Robust repair of polygonal models , 2004, SIGGRAPH 2004.

[12]  Guillermo Sapiro,et al.  Image inpainting , 2000, SIGGRAPH.

[13]  Daniel Cohen-Or,et al.  Surface reconstruction using local shape priors , 2007, Symposium on Geometry Processing.

[14]  Guillermo Sapiro,et al.  Inpainting surface holes , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[15]  Tony DeRose,et al.  Piecewise smooth surface reconstruction , 1994, SIGGRAPH.

[16]  Ralph R. Martin,et al.  Algorithms for reverse engineering boundary representation models , 2001, Comput. Aided Des..

[17]  Vladimir Kolmogorov,et al.  What metrics can be approximated by geo-cuts, or global optimization of length/area and flux , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[18]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Szymon Rusinkiewicz,et al.  Eurographics Symposium on Geometry Processing (2005) Atomic Volumes for Mesh Completion , 2022 .

[20]  Peter Liepa,et al.  Filling Holes in Meshes , 2003, Symposium on Geometry Processing.

[21]  Leif Kobbelt,et al.  Automatic restoration of polygon models , 2005, TOGS.

[22]  E LorensenWilliam,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987 .

[23]  Leonidas J. Guibas,et al.  Discovering structural regularity in 3D geometry , 2008, ACM Trans. Graph..

[24]  Daniel Cohen-Or,et al.  Fragment-based image completion , 2003, ACM Trans. Graph..

[25]  Ariel Shamir,et al.  Improved seam carving for video retargeting , 2008, ACM Trans. Graph..

[26]  D. Cohen-Or,et al.  Context-based surface completion , 2004, SIGGRAPH 2004.

[27]  Robert B. Fisher,et al.  Improving environment modelling by edge occlusion surface completion , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

[28]  Victor S. Lempitsky,et al.  Global Optimization for Shape Fitting , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[29]  Pierre Alliez,et al.  Variational shape approximation , 2004, ACM Trans. Graph..

[30]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[31]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[33]  Leif Kobbelt,et al.  Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information , 2006, SGP '06.

[34]  Steve Marschner,et al.  Filling holes in complex surfaces using volumetric diffusion , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

[35]  Martin Rumpf,et al.  A finite element method for surface restoration with smooth boundary conditions , 2004, Comput. Aided Geom. Des..

[36]  Leif Kobbelt,et al.  Structure Recovery via Hybrid Variational Surface Approximation , 2005, Comput. Graph. Forum.

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

[38]  Robert B. Fisher,et al.  Reconstruction of surfaces behind occlusions in range images , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.