Tamal K. Dey
ABSTRACT
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.
- N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discr. Comput. Geom., 22 pp. 481--504,(1999).Google Scholar
Cross Ref
- N. Amenta, M. Bern and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing, 60 pp. 125--135 (1998). Google ScholarDigital Library
- N. Amenta, S. Chi, T. K. Dey and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Internat. J. Comput. Geom. & Applications, vol.12, 2002, pages 125--141.Google ScholarCross Ref
- N. Amenta, S. Choi and R. Kolluri. The power crust, unions of balls,and the medial axis transform. Computational Geometry: Theory and Applications, 19 pp. 127--153,(2001). Google ScholarDigital Library
- J. D. Boissonnat and F. Cazals. Smooth Surface Reconstruction via Natural Neighbour Interpolation of Distance Functions. Computational Geometry: Theory and Applications, 22 pp. 185--203,(2002). Google ScholarDigital Library
- R. Chaine. A geometric convection approach f 3-D reconstruction. In Proc.Eurographics Sympos. on Geometry Processing, pp. 218--229,(2003). Google ScholarDigital Library
- T. K. Dey, J. Giesen and S. Goswami. Shape Segmentation and Matching with Flow Discretization. In Proc.8th Workshop on Algorithms Data Strucutres, pp. 25--36,(2003).Google ScholarCross Ref
- T. K. Dey, J. Giesen, S. Goswami and W. Zhao. Shape dimension and approximation from samples. Discr. Comput. Geom., 29 pp. 419--434 (2003).Google ScholarCross Ref
- T. K. Dey and W. Zhao. Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee. Algorithmica, 38 pp. 179--200 (2004). Google ScholarDigital Library
- H. Edelsbrunner. Surface reconstruction by wrapping finite point sets in space. Discr. Comput. Geom., 32 pp.231--244,(2004). Google ScholarDigital Library
- J. Giesen and M. John. The Flow Complex: A Data Structure for Geometric Modeling. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 285--294,(2003) Google ScholarDigital Library
- K. Grove. Critical Point Theory for Distance Functions. In Proceedings of Symposia in Pure Mathematics 54 3),pp. 357--385,(1993)Google ScholarCross Ref
Index Terms
- Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction
Recommendations
Distance Preserving Flattening of Surface Sections
Curved cross-sections extracted from medical volume images are useful for analyzing nonplanar anatomic structures such as the aorta arch or the pelvis. For visualization and for performing distance measurements, extracted surface sections need to be ...
Discrete Surface Ricci Flow
This work introduces a unified framework for discrete surface Ricci flow algorithms, including spherical, Euclidean, and hyperbolic Ricci flows, which can design Riemannian metrics on surfaces with arbitrary topologies by user-defined Gaussian ...
Comments