Answers are grounded in this paper and cite their sources.
An efficient algorithm for isometry-invariant matching of surfaces is presented. The key idea is computing the minimum-distortion mapping between two surfaces. For this purpose, we introduce the generalized multidimensional scaling, a computationally efficient continuous optimization algorithm for finding the least distortion embedding of one surface into another. The generalized multidimensional scaling algorithm allows for both full and partial surface matching. As an example, it is applied to the problem of expression-invariant three-dimensional face recognition.
No takes yet. Share an insight, caveat, or question.
Bronstein et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: