Journal
COMPUTER GRAPHICS FORUM
Volume 29, Issue 5, Pages 1555-1564Publisher
WILEY
DOI: 10.1111/j.1467-8659.2010.01764.x
Keywords
-
Categories
Funding
- NSF [0808515]
- NIH [GM-072970]
- ONR [N00014-09-1-0783]
- King Abdullah University of Science and Technology
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [808515] Funding Source: National Science Foundation
Ask authors/readers for more resources
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particularly useful case of such maps is isometries, which preserve geodesic distances between points on each shape. Although several algorithms have been proposed to find approximately isometric maps between a pair of shapes, the structure of the space of isometries is not well understood. In this paper, we show that under mild genericity conditions, a single correspondence can be used to recover an isometry defined on entire shapes, and thus the space of all isometries can be parameterized by one correspondence between a pair of points. Perhaps surprisingly, this result is general, and does not depend on the dimensionality or the genus, and is valid for compact manifolds in any dimension. Moreover, we show that both the initial correspondence and the isometry can be recovered efficiently in practice. This allows us to devise an algorithm to find intrinsic symmetries of shapes, match shapes undergoing isometric deformations, as well as match partial and incomplete models efficiently.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available