Reconstruction of water-tight surfaces through Delaunay sculpting

Given a finite set of points S ? R 2 , we define a proximity graph called as shape-hull graph ( SHG ( S ) ) that contains all Gabriel edges and a few non-Gabriel edges of Delaunay triangulation of S . For any S , SHG ( S ) is topologically regular with its boundary (referred to as shape-hull ( SH )) homeomorphic to a simple closed curve. We introduce the concept of divergent concavity for simple, closed, planar curves based on the alignment of curves in concave portions and discuss various measures to characterize curves having divergent concavity. Under sufficiently dense sampling, we prove that SH ( S ) , where S is sampled from a divergent concave curve Σ D , represents a piece-wise linear approximation of Σ D . We extend this result to provide a sculpting algorithm for closed surface reconstruction from a set of raw samples. The surface is constructed through a repeated elimination of Delaunay tetrahedra subjected to circumcenter and topological constraints. Theoretically, we justify our algorithm by establishing a topological guarantee on the 3D shape-hull with the help of topological rules. We demonstrate the effectiveness of our approach with experimental results on models with sharp features and sparsely distributed point clouds. Compared to existing sculpting approaches for surface reconstruction that require either a parameter tuning or several stages, our approach is simple, non-parametric, single stage and reconstructs topologically correct piece-wise linear approximation for divergent concave surfaces. Delaunay-based surface reconstruction algorithm has been proposed.It is a non-parametric and single stage approach.Theoretical guarantee has been discussed.

[1]  Richard K. Beatson,et al.  Reconstruction and representation of 3D objects with radial basis functions , 2001, SIGGRAPH.

[2]  Meenakshisundaram Gopi,et al.  Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation , 2000, Comput. Graph. Forum.

[3]  Paolo Cignoni,et al.  Ieee Transactions on Visualization and Computer Graphics 1 Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes , 2022 .

[4]  J. Giesen,et al.  Delaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms , 2004 .

[5]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

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

[7]  Tamal K. Dey,et al.  Curve and Surface Reconstruction , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[8]  Marco Attene,et al.  Automatic Surface Reconstruction from Point Sets in Space , 2000, Comput. Graph. Forum.

[9]  W. Relative Neighborhood Graphs and Their Relatives , 2004 .

[10]  Tamal K. Dey,et al.  Delaunay Mesh Generation , 2012, Chapman and Hall / CRC computer and information science series.

[11]  Edmond Boyer,et al.  Regular and non-regular point sets: Properties and reconstruction , 2001, Comput. Geom..

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

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

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

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

[16]  Raphaëlle Chaine A geometric-based convection approach of 3-D reconstruction , 2003, Symposium on Geometry Processing.

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

[18]  Charlie C. L. Wang Incremental reconstruction of sharp edges on mesh surfaces , 2006, Comput. Aided Des..

[19]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

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

[21]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[22]  H. Edelsbrunner Surface Reconstruction by Wrapping Finite Sets in Space , 2003 .

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

[24]  Raphaëlle Chaine A geometric convection approach of 3-D reconstruction , 2003 .

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

[26]  Tamal K. Dey,et al.  Provable surface reconstruction from noisy samples , 2006, Comput. Geom..

[27]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

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

[29]  N. Amenta,et al.  Surface Reconstruction with Constrained Sculpting Surface Reconstruction with Constrained Sculpting Surface Reconstruction with Constrained Sculpting , 2005 .

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

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

[32]  Remco C. Veltkamp,et al.  Closed Object Boundaries from Scattered Points , 1994, Lecture Notes in Computer Science.

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

[34]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[35]  Gabriel Taubin,et al.  A benchmark for surface reconstruction , 2013, TOGS.

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

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

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

[39]  Edgar A. Ramos,et al.  Geometric and topological guarantees for the WRAP reconstruction algorithm , 2007, SODA '07.

[40]  Dominique Attali,et al.  r-regular shape reconstruction from unorganized points , 1997, SCG '97.

[41]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[42]  Tamal K. Dey,et al.  Delaunay based shape reconstruction from large data , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[43]  Hong-Tzong Yau,et al.  A Delaunay-Based Region-Growing Approach to Surface Reconstruction from Unorganized Points , 2004 .

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