Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction

The distance function to surfaces in three dimensions plays a key role in many geometric modeling applications such as medial axis approximations, surface reconstructions, offset computations, feature extractions and others. In most cases, the distance function induced by the surface is approximated by a discrete distance function induced by a discrete sample of the surface. The critical points of the distance function determine the topology of the set inducing the function. However, no earlier theoretical result has linked the critical points of the distance to a sampling of geometric structures to their topological properties. We provide this link by showing that the critical points of the distance function induced by a discrete sample of a surface either lie very close to the surface or near its medial axis and this closeness is quantified with the sampling density. Based on this result, we provide a new flow-complex-based surface reconstruction algorithm that, given a tight ε-sampling of a surface, approximates the surface geometrically, both in Hausdorff distance and normals, and captures its topology.

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

[2]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

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

[4]  Valerio Pascucci,et al.  Loops in Reeb Graphs of 2-Manifolds , 2004, Discret. Comput. Geom..

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

[6]  Hyeong In Choi,et al.  The Medial Axis Transform , 2002, Handbook of Computer Aided Geometric Design.

[7]  Jean-Daniel Boissonnat,et al.  Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2000, SCG '00.

[8]  Joachim Giesen,et al.  The flow complex: a data structure for geometric modeling , 2003, SODA '03.

[9]  Tamal K. Dey,et al.  Shape Dimension and Approximation from Samples , 2002, SODA '02.

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

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

[12]  Tamal K. Dey,et al.  Shape Segmentation and Matching with Flow Discretization , 2003, WADS.

[13]  K. Grove Critical point theory for distance functions , 1993 .

[14]  Tamal K. Dey,et al.  A simple provable algorithm for curve reconstruction , 1999, SODA '99.

[15]  Tamal K. Dey,et al.  Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee , 2003, Algorithmica.