Three-dimensional surface registration transforms multiple three-dimensional data sets into
the same coordinate system so as to align overlap** components of these sets. Recent …

We review methods designed to compute correspondences between geometric shapes
represented by triangle meshes, contours or point sets. This survey is motivated in part by …

We propose a method for efficiently computing orientation-preserving and approximately
continuous correspondences between non-rigid shapes, using the functional maps …

We introduce a high-resolution equirectangular panorama (aka 360-degree, virtual reality,
VR) dataset for object detection and propose a multi-projection variant of the YOLO detector …

A common operation in many geometry processing algorithms consists of finding
correspondences between pairs of shapes by finding structure‐preserving maps between …

Point cloud registration is a fundamental task in computer graphics, and more specifically, in
rigid and non-rigid shape matching. The rigid shape matching problem can be formulated as …

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 review the computation of 3D geometric data map**, which establishes one-to-one
correspondence between or among spatial/spatiotemporal objects. Effective map** …

In this paper, we propose a high-order graph matching formulation to address non-rigid
surface matching. The singleton terms capture the geometric and appearance similarities …

Existing methods for surface matching are limited by the tradeoff between precision and
computational efficiency. Here, we present an improved algorithm for dense vertex-to-vertex …