Registration of 3D point clouds and meshes: A survey from rigid to nonrigid
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 …
the same coordinate system so as to align overlap** components of these sets. Recent …
A survey on shape correspondence
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 …
represented by triangle meshes, contours or point sets. This survey is motivated in part by …
Earth mover's distances on discrete surfaces
We introduce a novel method for computing the earth mover's distance (EMD) between
probability distributions on a discrete surface. Rather than using a large linear program with …
probability distributions on a discrete surface. Rather than using a large linear program with …
Exploring collections of 3d models using fuzzy correspondences
Large collections of 3D models from the same object class (eg, chairs, cars, animals) are
now commonly available via many public repositories, but exploring the range of shape …
now commonly available via many public repositories, but exploring the range of shape …
Combination of bag-of-words descriptors for robust partial shape retrieval
G Lavoué - The Visual Computer, 2012 - Springer
This paper presents a 3D shape retrieval algorithm based on the Bag of Words (BoW)
paradigm. For a given 3D shape, the proposed approach considers a set of feature points …
paradigm. For a given 3D shape, the proposed approach considers a set of feature points …
[PDF][PDF] Bag of words and local spectral descriptor for 3D partial shape retrieval
H Laga, T Schreck, A Ferreira, A Godil… - … workshop on 3D …, 2011 - diglib.eg.org
This paper presents a 3D shape retrieval algorithm based on the Bag of Words (BoW)
paradigm. For a given 3D shape, the proposed approach considers a set of feature points …
paradigm. For a given 3D shape, the proposed approach considers a set of feature points …
Supermatching: Feature matching using supersymmetric geometric constraints
Feature matching is a challenging problem at the heart of numerous computer graphics and
computer vision applications. We present the SuperMatching algorithm for finding …
computer vision applications. We present the SuperMatching algorithm for finding …
Bilateral maps for partial matching
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 …
feature points are characterized by local shape descriptors. Such descriptors have so far …
[PDF][PDF] Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry.
Finding correspondences between two surfaces is a fundamental operation in various
applications in computer graphics and related fields. Candidate correspondences can be …
applications in computer graphics and related fields. Candidate correspondences can be …
Walking on broken mesh: Defect‐tolerant geodesic distances and parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented
for various types of surface representations, most importantly polygon meshes. These …
for various types of surface representations, most importantly polygon meshes. These …