Paper Info
Title
Compatible embedding for 2D shape animation.
Abstract
We present new algorithms for the compatible embedding of 2D shapes. Such embeddings offer a convenient way to interpolate shapes having complex, detailed features. Compared to existing techniques, our approach requires less user input, and is faster, more robust, and simpler to implement, making it ideal for interactive use in practical applications. Our new approach consists of three parts. First, our boundary matching algorithm locates salient features using the perceptually motivated principles of scale-space and uses these as automatic correspondences to guide an elastic curve matching algorithm. Second, we simplify boundaries while maintaining their parametric correspondence and the embedding of the original shapes. Finally, we extend the mapping to shapes' interiors via a new compatible triangulation algorithm. The combination of our algorithms allows us to demonstrate 2D shape interpolation with instant feedback. The proposed algorithms exhibit a combination of simplicity, speed, and accuracy that has not been achieved in previous work.
Year
DOI
Venue
2009
10.1109/TVCG.2009.38
IEEE transactions on visualization and computer graphics
Keywords
Field
DocType
2d shape animation,salient feature,morphing,boundary matching algorithm,cross-parameterization,interpolation,scale-space,computer animation,2d shape interpolation,curve fitting,compatible triangulation.,compatible triangulation algorithm,elastic curve matching algorithm,matching,in-betweening,multiscale analysis,compatible embedding
Computer vision,Morphing,Embedding,Computer science,Interpolation,Scale space,Robustness (computer science),Triangulation (social science),Artificial intelligence,Computer animation,Blossom algorithm
Journal
Volume
Issue
ISSN
15
5
1077-2626
Citations 
PageRank 
References 
24
1.28
39
Authors
3
Name
Order
Citations
PageRank
William V. Baxter III1241.28
Pascal Barla255329.07
Ken-ichi Anjyo353446.89