We present a robust and efficient algorithm for the pairwise non‐rigid registration of partially
overlapping 3D surfaces. Our approach treats non‐rigid registration as an optimization
problem and solves it by alternating between correspondence and deformation optimization.
Assuming approximately isometric deformations, robust correspondences are generated
using a pruning mechanism based on geodesic consistency. We iteratively learn an
appropriate deformation discretization from the current set of correspondences and use it to …

We present a robust and efficient algorithm for the pairwise non-rigid registration of partially
overlapped 3D surfaces. Our approach treats non-rigid registration as an optimization
problem and solves it by alternating between correspondence and deformation optimization.
Assuming approximately isometric deformations, robust correspondences are generated
using a pruning mechanism based on geodesic consistency. We iteratively learn an
appropriate deformation discretization from the current set of correspondences and use it to …