Computer Vision and Image Understanding
Consistent mesh parameterizations
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The space of human body shapes: reconstruction and parameterization from range scans
ACM SIGGRAPH 2003 Papers
Cross-parameterization and compatible remeshing of 3D models
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
A planar-reflective symmetry transform for 3D shapes
ACM SIGGRAPH 2006 Papers
Global non-rigid alignment of 3-D scans
ACM SIGGRAPH 2007 papers
ACM SIGGRAPH 2007 papers
Möbius voting for surface correspondence
ACM SIGGRAPH 2009 papers
Symmetry-Aware Mesh Processing
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
Partial intrinsic reflectional symmetry of 3D shapes
ACM SIGGRAPH Asia 2009 papers
Deformation-driven shape correspondence
SGP '08 Proceedings of the Symposium on Geometry Processing
ACM SIGGRAPH 2011 papers
Dynamic time warping of cyclic strings for shape matching
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
Hi-index | 0.00 |
In this paper, we propose an automatic algorithm for finding a correspondence map between two 3D surfaces. The key insight is that global reflective symmetry axes are stable, recognizable, semantic features of most real-world surfaces. Thus, it is possible to find a useful map between two surfaces by first extracting symmetry axis curves, aligning the extracted curves, and then extrapolating correspondences found on the curves to both surfaces. The main advantages of this approach are efficiency and robustness: the difficult problem of finding a surface map is reduced to three significantly easier problems: symmetry detection, curve alignment, and correspondence extrapolation, each of which has a robust, polynomial-time solution (e.g., optimal alignment of 1D curves is possible with dynamic programming). We investigate of this approach on a wide range of examples, including both intrinsically symmetric surfaces and polygon soups, and find that it is superior to previous methods in cases where two surfaces have different overall shapes but similar reflective symmetry axes, a common case in computer graphics. © 2012 Wiley Periodicals, Inc.