Biharmonic distance
Authors:
Open Access
- 1 June 2010
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 29 (3) , 1-11
Abstract
Measuring distances between pairs of points on a 3D surface is a fundamental problem in computer graphics and geometric processing. For most applications, the important properties of a distance are that it is a metric, smooth, locally isotropic, globally “shape-aware,” isometry-invariant, insensitive to noise and small topology changes, parameter-free, and practical to compute on a discrete mesh. However, the basic methods currently popular in computer graphics (e.g., geodesic and diffusion distances) do not have these basic properties. In this article, we propose a new distance measure based on the biharmonic differential operator that has all the desired properties. This new surface distance is related to the diffusion and commute-time distances, but applies different (inverse squared) weighting to the eigenvalues of the Laplace-Beltrami operator, which provides a nice trade-off between nearly geodesic distances for small distances and global shape-awareness for large distances. The article provides theoretical and empirical analysis for a large number of meshes.Keywords
This publication has 17 references indexed in Scilit:
- Computing discrete shape operators on general meshesComputer Graphics Forum, 2006
- Diffusion mapsApplied and Computational Harmonic Analysis, 2006
- Efficient Computation of Isometry‐Invariant Distances Between SurfacesSIAM Journal on Scientific Computing, 2006
- SCAPEACM Transactions on Graphics, 2005
- Fast exact and approximate geodesics on meshesACM Transactions on Graphics, 2005
- A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud DataFoundations of Computational Mathematics, 2005
- Discrete Differential-Geometry Operators for Triangulated 2-Manifolds2003
- Computing Discrete Minimal Surfaces and Their ConjugatesExperimental Mathematics, 1993
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985
- Shepard’s method of “metric interpolation” to bivariate and multivariate interpolationMathematics of Computation, 1978