Poisson-driven seamless completion of triangular meshes

The production of high-quality 3D mesh models has seen important technological advancements in recent years and is increasingly becoming a crucial asset for several application domains. However, the intrinsic nature of the problem (acquisition constraints and real objects complexity) makes hole filling and mesh completion still critical tasks for the effectual finalization of the models. In this work, we propose a new solution for filling holes and gaps and for reconstructing missing parts of mesh models that is capable to guarantee the full preservation of the input mesh. On the implicit function obtained from a Poisson Reconstruction computed on a set of oriented points derived from the input mesh, we develop an interpolation method which allows a fast and continuous surface-oracle computation which is exploited to efficiently guide a restricted Delaunay triangulation. This can be used to confine the tessellation inside the holed zones, while protecting the input mesh and the boundary curves so that simple tailoring routines can merge the obtained surface-reconstruction driven patches with the input mesh without stitching artifacts. The proposed technique is versatile and evidences its effectiveness in dealing with multiple complex holes, gaps and surface blending, and it compares favorably with respect to different, and usually more specialized, hole filling and global mesh repair techniques. As a parallel benefit, we also show how the same proposed solution can be exploited as an effective and high-quality meshing or remeshing tool.

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

[2]  Wei-Cheng Xie,et al.  A triangulation-based hole patching method using differential evolution , 2013, Comput. Aided Des..

[3]  M. Wang,et al.  An Automatic Hole-Filling Algorithm for Polygon Meshes , 2008 .

[4]  Matthias Müller,et al.  Fast and robust tracking of fluid surfaces , 2009, SCA '09.

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

[6]  Pierre Alliez,et al.  Polygon Mesh Processing , 2010 .

[7]  Marco Attene,et al.  A lightweight approach to repairing digitized polygon meshes , 2010, The Visual Computer.

[8]  I. Kolingerová,et al.  SIMPLE HOLES TRIANGULATION IN SURFACE RECONSTRUCTION , 2022 .

[9]  Michael M. Kazhdan,et al.  Unconstrained isosurface extraction on arbitrary octrees , 2007, Symposium on Geometry Processing.

[10]  D. F. Watson Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[11]  Baocai Yin,et al.  Automatic hole-filling of CAD models with feature-preserving , 2012, Comput. Graph..

[12]  Marc Alexa,et al.  Context-based surface completion , 2004, ACM Trans. Graph..

[13]  Michael M. Kazhdan,et al.  Screened poisson surface reconstruction , 2013, TOGS.

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

[15]  Alla Sheffer,et al.  Template-based mesh completion , 2005, SGP '05.

[16]  Thomas Lewiner,et al.  Fast Generation of Pointerless Octree Duals , 2010, Comput. Graph. Forum.

[17]  居涛 Fixing Geometric Errors on Polygonal Models: A Survey , 2009 .

[18]  Charlie C. L. Wang,et al.  Mesh Composition on Models with Arbitrary Boundary Topology , 2008, IEEE Transactions on Visualization and Computer Graphics.

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

[20]  Eitan Grinspun,et al.  Context-based coherent surface completion , 2014, ACM Trans. Graph..

[21]  Sunghee Choi,et al.  A simple algorithm for homeomorphic surface reconstruction , 2000, SCG '00.

[22]  George Drettakis,et al.  Level of detail continuum for huge geometric data , 2005, SIGGRAPH '05.

[23]  Lavanya Sita Tekumalla,et al.  A Hole-Filling Algorithm for Triangular Meshes , 2004 .

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

[25]  Pierre Alliez,et al.  State of the Art in Surface Reconstruction from Point Clouds , 2014, Eurographics.

[26]  Marco Attene,et al.  Polygon mesh repairing: An application perspective , 2013, CSUR.

[27]  Marcel Campen,et al.  Hybrid Booleans , 2010, Comput. Graph. Forum.

[28]  J. Boissonnat,et al.  Provably good sampling and meshing of Lipschitz surfaces , 2006, SCG '06.

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

[30]  Leif Kobbelt,et al.  OpenMesh: A Generic and Efficient Polygon Mesh Data Structure , 2002 .

[31]  J. Boissonnat,et al.  An efficient implementation of Delaunay triangulations in medium dimensions , 2008 .

[32]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

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

[34]  Mariette Yvinec,et al.  CGALmesh , 2015, ACM Trans. Math. Softw..

[35]  M. Gross,et al.  Deforming meshes that split and merge , 2009, SIGGRAPH 2009.

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

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

[38]  Wei Zhao,et al.  A robust hole-filling algorithm for triangular mesh , 2007, 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics.