We present a method to match three dimensional shapes under non-isometric deformations,
topology changes and partiality. We formulate the problem as matching between a set of …

Many algorithms for the computation of correspondences between deformable shapes rely
on some variant of nearest neighbor matching in a descriptor space. Such are, for example …

We present a novel method for computing correspondences between pairs of non-rigid
shapes. Unlike the majority of existing techniques that assume a deformation model, such as …

We introduce pointwise map smoothness via the Dirich-let energy into the functional map
pipeline, and propose an algorithm for optimizing it efficiently, which leads to highquality …

We consider the problem of non‐rigid shape matching, and specifically the functional maps
framework that was recently proposed to find correspondences between shapes. A key step …

We present a novel approach to the problem of establishing the best match between an
open contour and a part of a closed contour. At the heart of the proposed scheme lies a …

With the rapid development of fast data acquisition techniques, 3D scans that record the
geometric and photometric information of deformable objects are routinely acquired …

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 …

Finding correspondences between shapes is a fundamental problem in computer vision and
graphics, which is relevant for many applications, including 3D reconstruction, object …

We propose a shape matching method that produces dense correspondences tuned to a
specific class of shapes and deformations. In a scenario where this class is represented by a …