Curvature-based anisotropic geodesic distance computation for  parametric and implicit surfaces

Distribution of geometric features varies with direction, including, for example, normal curvature. In this paper, this characteristic of shape is used to define a new anisotropic geodesic (AG) distance for both parametric and implicit surfaces. Local distance (LD) from a point is defined as a function of both the point and a unit tangent plane directions, and a total distance is defined as an integral of that local distance. The AG distance between points on the surface is the minimum total distance between them. The path between the points that attains the minimum is called the anisotropic geodesic path. Minimization of total distance to attain the AG distance is performed by associating the LD function with a tensor speed function that controls wave propagation in the convex Hamilton–Jacobi (H–J) equation solver. We present new distance metrics for both parametric and implicit surfaces based on the curvature tensor. In order to solve for the implicit AG, a bounded 3D H–J equation solver was developed. We present a second metric for the AG distance, a difference curvature tensor, for parametric surfaces. Some properties of both new AG distances are presented, including parameterization invariance. This AG path differs from the usual geodesic in that minimal path, i.e., lowest cost path, roughly speaking, minimizes an integral of curvature along the curve. Then, the effectiveness of the proposed AG distances as shape discriminators is demonstrated in several applications, including surface segmentation and partial shape matching.

[1]  Yajun Wang,et al.  Approximate shortest paths in anisotropic regions , 2007, SODA '07.

[2]  Peter-Pike J. Sloan,et al.  Shape by example , 2001, I3D '01.

[3]  Kouki Watanabe,et al.  Detection of Salient Curvature Features on Polygonal Surfaces , 2001, Comput. Graph. Forum.

[4]  Thomas A. Funkhouser,et al.  Partial matching of 3D shapes with priority-driven search , 2006, SGP '06.

[5]  Ross T. Whitaker,et al.  Curvature-based transfer functions for direct volume rendering: methods and applications , 2003, IEEE Visualization, 2003. VIS 2003..

[6]  J. Sethian,et al.  3-D traveltime computation using the fast marching method , 1999 .

[7]  Laurent D. Cohen,et al.  Geodesic Remeshing Using Front Propagation , 2003, International Journal of Computer Vision.

[8]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Szymon Rusinkiewicz,et al.  Modeling by example , 2004, SIGGRAPH 2004.

[10]  Hans-Peter Kriegel,et al.  3D Shape Histograms for Similarity Search and Classification in Spatial Databases , 1999, SSD.

[11]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[12]  James C. Gee,et al.  Elastic Matching of Diffusion Tensor Images , 2000, Comput. Vis. Image Underst..

[13]  Hiromasa Suzuki,et al.  Approximate shortest path on a polyhedral surface based on selective refinement of the discrete graph and its applications , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[14]  Yijie Han,et al.  Shortest paths on a polyhedron , 1996, Int. J. Comput. Geom. Appl..

[15]  T. Funkhouser,et al.  Shape matching and anisotropy , 2004, SIGGRAPH 2004.

[16]  F. Mémoli,et al.  Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730 , 2001 .

[17]  Steven J. Gortler,et al.  Fast exact and approximate geodesics on meshes , 2005, ACM Trans. Graph..

[18]  Tosiyasu L. Kunii,et al.  Ridges and ravines on implicit surfaces , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[19]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[20]  Ross T. Whitaker,et al.  Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles , 2007, IEEE Transactions on Visualization and Computer Graphics.

[21]  Alla Sheffer,et al.  Geodesic-based Surface Remeshing , 2003, IMR.

[22]  Joonki Paik,et al.  Simple and efficient algorithm for part decomposition of 3-D triangulated models based on curvature analysis , 2002, Proceedings. International Conference on Image Processing.

[23]  F. Bornemann,et al.  Finite-element Discretization of Static Hamilton-Jacobi Equations based on a Local Variational Principle , 2004, math/0403517.

[24]  H. Pottmann,et al.  Energy-minimizing splines in manifolds , 2004, SIGGRAPH 2004.

[25]  Daniel Cohen-Or,et al.  Salient geometric features for partial shape matching and similarity , 2006, TOGS.

[26]  Jürgen Sellen,et al.  Direction weighted shortest path planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[27]  Anshuman Razdan,et al.  A hybrid approach to feature segmentation of triangle meshes , 2003, Comput. Aided Des..

[28]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Ross T. Whitaker,et al.  Interactive Visualization of Volumetric White Matter Connectivity in DT-MRI Using a Parallel-Hardware Hamilton-Jacobi Solver , 2007, IEEE Transactions on Visualization and Computer Graphics.

[31]  Ross T. Whitaker,et al.  Partitioning 3D Surface Meshes Using Watershed Segmentation , 1999, IEEE Trans. Vis. Comput. Graph..

[32]  Ron Kimmel,et al.  On Bending Invariant Signatures for Surfaces , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  Ayellet Tal,et al.  Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..

[34]  Hans-Peter Seidel,et al.  Mesh segmentation driven by Gaussian curvature , 2005, The Visual Computer.

[35]  Helmut Pottmann,et al.  The Isophotic Metric and Its Application to Feature Sensitive Morphology on Surfaces , 2004, ECCV.

[36]  Zheng Sun,et al.  Movement Planning in the Presence of Flows , 2001, WADS.

[37]  Mongi A. Abidi,et al.  Perception-based 3D triangle mesh segmentation using fast marching watersheds , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[38]  Kun Zhou,et al.  Iso-charts: stretch-driven mesh parameterization using spectral analysis , 2004, SGP '04.

[39]  Qiang Du,et al.  Anisotropic Centroidal Voronoi Tessellations and Their Applications , 2005, SIAM J. Sci. Comput..

[40]  Carl-Fredrik Westin,et al.  A Hamilton-Jacobi-Bellman Approach to High Angular Resolution Diffusion Tractography , 2005, MICCAI.

[41]  Alexander M. Bronstein,et al.  Weighted distance maps computation on parametric three-dimensional manifolds , 2007, J. Comput. Phys..

[42]  Adam Finkelstein,et al.  Suggestive contours for conveying shape , 2003, ACM Trans. Graph..

[43]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[44]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[45]  Ming Ouhyoung,et al.  On Visual Similarity Based 3D Model Retrieval , 2003, Comput. Graph. Forum.

[46]  Yajun Wang,et al.  Querying approximate shortest paths in anisotropic regions , 2007, SCG '07.

[47]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[48]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[49]  Heping Ma,et al.  Optimal Error Estimates of the Chebyshev-Legendre Spectral Method for Solving the Generalized Burgers Equation , 2003, SIAM J. Numer. Anal..

[50]  Stanley Osher,et al.  Fast Sweeping Algorithms for a Class of Hamilton-Jacobi Equations , 2003, SIAM J. Numer. Anal..

[51]  Rachid Deriche,et al.  Control Theory and Fast Marching Techniques for Brain Connectivity Mapping , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[52]  Alexander M. Bronstein,et al.  Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.

[53]  L. Guillaume,et al.  Curvature tensor based triangle mesh segmentation with boundary rectification , 2004, Proceedings Computer Graphics International, 2004..