Efficient Computation of Isometry-Invariant Distances Between Surfaces
SIAM Journal on Scientific Computing
Laplace-Beltrami eigenfunctions for deformation invariant shape representation
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Numerical Geometry of Non-Rigid Shapes
Numerical Geometry of Non-Rigid Shapes
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Global intrinsic symmetries of shapes
SGP '08 Proceedings of the Symposium on Geometry Processing
Rigid and Articulated Point Registration with Expectation Conditional Maximization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Applied Multidimensional Scaling
Applied Multidimensional Scaling
A correspondence-less approach to matching of deformable shapes
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Coarse-to-fine skeleton extraction for high resolution 3D meshes
Computer Vision and Image Understanding
Hi-index | 0.00 |
The SHREC'10 correspondence finding benchmark simulates a one-to-one shape matching scenario, in which one of the shapes undergoes multiple modifications and transformations. The benchmark allows evaluating how correspondence algorithms cope with certain classes of transformations and what is the strength of the transformations that can be dealt with. The present paper is a report of the 3D Shape Retrieval Contest 2010 (SHREC'10) correspondence finding benchmark results.