In this paper, we propose a method for computing partial functional correspondence
between non‐rigid shapes. We use perturbation analysis to show how removal of shape …

Finding correspondences between 3D shapes is an important and long-standing problem in
computer vision graphics and beyond. A prominent challenge are partial-to-partial shape …

We propose an efficient procedure for calculating partial dense intrinsic correspondence
between deformable shapes performed entirely in the spectral domain. Our technique relies …

Finding shortest paths on product spaces is a popular approach to tackle numerous variants
of matching problems including the dynamic time war** method for matching signals the …

Shape correspondence is a fundamental problem in computer graphics and vision, with
applications in various problems including animation, texture map**, robotic vision …

We present a scalable combinatorial algorithm for globally optimizing over the space of
geometrically consistent map**s between 3D shapes. We use the mathematically elegant …

Classical formulations of the shape matching problem involve the definition of a matching
cost that directly depends on the action of the desired map when applied to some input data …

The problem of map** between two non‐isometric surfaces admits ambiguities on both
local and global scales. For instance, symmetries can make it possible for multiple maps to …

We consider the problem of finding a continuous and non-rigid matching between a 2D
contour and a 3D mesh. While such problems can be solved to global optimality by finding a …

We argue that full surface correspondence (registration) and optimal deformations
(geodesics) are two related problems and propose a framework that solves them …