Important new developments have appeared since the most recent direct survey on shape
correspondence published almost a decade ago. Our survey covers the period from 2011 …

Graph matching, which refers to a class of computational problems of finding an optimal
correspondence between the vertices of graphs to minimize (maximize) their node and edge …

Recent advances in shape matching have shown that jointly optimizing the maps among the
shapes in a collection can lead to significant improvements when compared to estimating …

This paper addresses the problem of matching common node correspondences among
multiple graphs referring to an identical or related structure. This multi-graph matching …

As large repositories of 3D shape collections continue to grow, understanding the data,
especially encoding the inter-model similarity and their variations, is of central importance …

The construction of networks of maps among shapes in a collection enables a variety of
applications in data-driven geometry processing. A key task in network construction is to …

The recent introduction of 3D shape analysis frameworks able to quantify the deformation of
a shape into another in terms of the variation of real functions yields a new interpretation of …

Joint matching over a collection of objects aims at aggregating information from a large
collection of similar instances (eg images, graphs, shapes) to improve maps between pairs …

As 3D acquisition devices and modeling tools become widely available there is a growing
need for automatic algorithms that analyze the semantics and functionality of digitized …

Data-driven methods serve an increasingly important role in discovering geometric,
structural, and semantic relationships between shapes. In contrast to traditional approaches …