A geometric convection approach of 3-D reconstruction

This paper introduces a fast and efficient algorithm for surface reconstruction. As many algorithms of this kind, it produces a piecewise linear approximation of a surface S from a finite, sufficiently dense, subset of its points. Originally, the starting point of this work does not come from the computational geometry field. It is inspired by an existing numerical scheme of surface convection developed by Zhao, Osher and Fedkiw. We have translated this scheme to make it depend on the geometry of the input data set only, and not on the precision of some grid around the surface. Our algorithm deforms a closed oriented pseudo-surface embedded in the 3D Delaunay triangulation of the sampled points, and the reconstructed surface consists of a set of oriented facets located in this 3D Delaunay triangulation. This paper provides an appropriate data structure to represent a pseudo-surface, together with operations that manage deformations and topological changes. The algorithm can handle surfaces with boundaries, surfaces of high genus and, unlike most of the other existing schemes, it does not involve a global heuristic. Its complexity is that of the 3D Delaunay triangulation of the points. We present some results of the method, which turns out to be efficient even on noisy input data.

[1]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

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

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

[4]  HoppeHugues,et al.  Surface Reconstruction from Unorganized Points , 1992 .

[5]  Remco C. Veltkamp.  Boundaries through Scattered Points of Unknown Density , 1995, CVGIP Graph. Model. Image Process..

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

[7]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[8]  Jindong Chen,et al.  A triangulation-based object reconstruction method , 1997, SCG '97.

[9]  Heinrich Müller,et al.  Interpolation and Approximation of Surfaces from Three-Dimensional Scattered Data Points , 1997, Scientific Visualization Conference (dagstuhl '97).

[10]  Herbert Edelsbrunner,et al.  On the Definition and the Construction of Pockets in Macromolecules , 1998, Discret. Appl. Math..

[11]  Leila De Floriani,et al.  Managing the level of detail in 3D shape reconstruction and representation , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[12]  M. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

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

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

[15]  S. Osher,et al.  Fast surface reconstruction using the level set method , 2001, Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision.

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

[17]  Sunghee Choi,et al.  The power crust, unions of balls, and the medial axis transform , 2001, Comput. Geom..

[18]  Jeff Erickson,et al.  Nice Point Sets Can Have Nasty Delaunay Triangulations , 2001, SCG '01.

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

[20]  Joachim Giesen,et al.  Surface reconstruction based on a dynamical system † , 2002, Comput. Graph. Forum.

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

[22]  Jean-Daniel Boissonnat,et al.  A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces , 2002, SMA '02.

[23]  Jean-Daniel Boissonnat,et al.  Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces , 2003, Discret. Comput. Geom..

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