Polypostors: 2D polygonal impostors for 3D crowds
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Structure-oriented contour representation and matching for engineering shapes
Computer-Aided Design
A Comparison Study on Two Multi-scale Shape Matching Schemes
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Tracking vertex flow and model adaptation for three-dimensional spatiotemporal face analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on recent advances in biometrics
Automatic shape morphing for Chinese characters
SIGGRAPH Asia 2012 Technical Briefs
Tweening boundary curves of non-simple immersions of a disk
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Planar shape interpolation with bounded distortion
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
This paper presents a novel approach for establishing vertex correspondences between two planar shapes. Correspondences are established between the perceptual feature points extracted from both source and target shapes. A similarity metric between two feature points is defined using the intrinsic properties of their local neighborhoods. The optimal correspondence is found by an efficient dynamic programming technique. Our approach treats shape noise by allowing discarding small feature points, which introduces skips in the traversal of the dynamic programming graph. Our method is fast, feature preserving, and invariant to geometric transformations. We demonstrate the superiority of our approach over other approaches by experimental results.