Graph-based Conservative Surface Reconstruction

We propose a new approach for reconstructing a 2-manifold from a point sample in R3. Compared to previous algorithms, our approach is novel in that it throws away geometry information early on in the reconstruction process and mainly operates combinatorially on a graph structure. Furthermore, it is very conservative in creating adjacencies between samples in the vicinity of slivers, still we can prove that the resulting reconstruction faithfully resembles the original 2-manifold. While the theoretical proof requires an extremely high sampling density, our prototype implementation of the approach produces surprisingly good results on typical sample sets.

[1]  Timothy M. Chan.  Optimal output-sensitive convex hull algorithms in two and three dimensions , 1996, Discret. Comput. Geom..

[2]  Tamal K. Dey,et al.  Manifold reconstruction from point samples , 2005, SODA '05.

[3]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[4]  Stefan Funke,et al.  Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms , 2001 .

[5]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1989, Discret. Comput. Geom..

[6]  Stefan Funke,et al.  Network sketching or: "How Much Geometry Hides in Connectivity?--Part II" , 2007, SODA '07.

[7]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[8]  Hongbo Liu,et al.  A new way to enumerate cycles in graph , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[9]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[10]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[11]  D. Kirkpatrick,et al.  A Framework for Computational Morphology , 1985 .

[12]  V. Klee.  On the complexity ofd- dimensional Voronoi diagrams , 1979 .

[13]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[14]  Stefan Funke,et al.  Smooth-surface reconstruction in near-linear time , 2002, SODA '02.

[15]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

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

[17]  Leonidas J. Guibas,et al.  Randomized incremental construction of Delaunay and Voronoi diagrams , 1990, Algorithmica.

[18]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

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

[20]  Andrew Chi-Chih Yao,et al.  A Lower Bound to Finding Convex Hulls , 1981, JACM.