The registration of surfaces with non-rigid deformation, especially non-isometric
deformations, is a challenging problem. When applying such techniques to real scans, the …

We propose a novel 3D shape correspondence method based on the iterative alignment of
so-called smooth shells. Smooth shells define a series of coarse-to-fine shape …

Feature‐driven analysis forms the basis of many shape processing tasks, where detected
feature points are characterized by local shape descriptors. Such descriptors have so far …

We propose a principled approach for non‐isometric landmark‐preserving non‐rigid shape
matching. Our method is based on the functional map framework, but rather than promoting …

We present a novel representation of maps between pairs of shapes that allows for efficient
inference and manipulation. Key to our approach is a generalization of the notion of map …

Measuring the similarity between 3D shapes is a fundamental problem, with applications in
computer vision, molecular biology, computer graphics, and a variety of other fields. A …

We propose two computational approaches for improving the retrieval of planar shapes.
First, we suggest a geometrically motivated quadratic similarity measure, that is optimized by …

Three-dimensional shape matching is a fundamental issue in computer vision with many
applications such as shape registration, 3D object recognition, and classification. However …

We consider the problem of finding a geometrically consistent set of point matches between
two images. We assume that local descriptors have provided a set of candidate matches …

We exploit the permutation creation ability of genetic optimization to find the permutation of
one point set that puts it into correspondence with another one. To this end, we provide a …