CSDL Home IEEE Transactions on Visualization & Computer Graphics 2009 vol.15 Issue No.05 - September/October

Subscribe

Issue No.05 - September/October (2009 vol.15)

pp: 867-879

William V. Baxter, III , OLM Digital, Inc., Tokyo

Pascal Barla , INRIA Bordeau University, France

Ken-ichi Anjyo , OLM Digital, Inc., Tokyo

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2009.38

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.

INDEX TERMS

Matching, interpolation, morphing, in-betweening, cross-parameterization, multiscale analysis, scale-space, compatible triangulation.

CITATION

William V. Baxter, III, Pascal Barla, Ken-ichi Anjyo, "Compatible Embedding for 2D Shape Animation",

*IEEE Transactions on Visualization & Computer Graphics*, vol.15, no. 5, pp. 867-879, September/October 2009, doi:10.1109/TVCG.2009.38REFERENCES

- [1] L. Kavan, S. Dobbyn, S. Collins, J. Zara, and C. O'Sullivan, “Polypostors: 2D Polygonal Impostors for 3D Crowds,”
Proc. ACM SIGGRAPH Symp. Interactive 3D Graphics and Games, Feb. 2008.- [3] T. Beier and S. Neely, “Feature-Based Image Metamorphosis,”
Proc. ACM SIGGRAPH '92, pp. 35-42, 1992.- [4] S.-Y. Lee, K.-Y. Chwa, and S.Y. Shin, “Image Metamorphosis Using Snakes and Free-Form Deformations,”
Proc. ACM SIGGRAPH '95, pp. 439-448, 1995.- [7] H. Fang and J.C. Hart, “Detail Preserving Shape Deformation in Image Editing,”
Proc. ACM SIGGRAPH '07, vol. 26, no. 3, p. 12, 2007.- [8] T.W. Sederberg, P. Gao, G. Wang, and H. Mu, “2D Shape Blending: An Intrinsic Solution to the Vertex Path Problem,”
Proc. ACM SIGGRAPH '93, pp. 15-18, 1993.- [9] E. Goldstein and C. Gotsman, “Polygon Morphing Using a Multiresolution Representation,”
Proc. Graphics Interface Conf., pp. 247-254, 1995.- [11] M. Alexa, D. Cohen-Or, and D. Levin, “As-Rigid-As-Possible Shape Interpolation,”
Proc. ACM SIGGRAPH '00, pp. 157-164, 2000.- [12] V. Surazhsky and C. Gotsman, “High Quality Compatible Triangulations,”
Eng. with Computers, vol. 20, no. 2, pp. 147-156, July 2004.- [13] M. Eitz, O. Sorkine, and M. Alexa, “Sketch Based Image Deformation,”
Proc. Workshop Vision, Modeling, and Visualization, pp. 135-142, 2007.- [14] T.W. Sederberg and E. Greenwood, “A Physically Based Approach to 2D Shape Blending,”
Proc. ACM SIGGRAPH '92, pp. 25-34, 1992.- [17] X. Zabulis, J. Sporring, and S.C. Orphanoudakis, “Perceptually Relevant and Piecewise Linear Matching of Silhouettes,”
Pattern Recognition, vol. 38, no. 1, pp. 75-93, 2005.- [24] R.W. Sumner, M. Zwicker, C. Gotsman, and J. Popović, “Mesh-Based Inverse Kinematics,”
Proc. ACM SIGGRAPH '05, pp. 488-495, 2005.- [25] T.B. Sebastian, P.N. Klein, and B.B. Kimia, “Alignment-Based Recognition of Shape Outlines,”
Proc. Fourth Int'l Workshop Visual Form (IWVF-4), pp. 606-618, 2001.- [26] R.C. Veltkamp and M. Hagedoorn,
State of the Art in Shape Matching, pp. 87-119. Springer-Verlag, 2001.- [27] D. Douglas and T. Peucker, “Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature,”
Canadian Cartographer, vol. 10, no. 2, pp. 112-122, 1973.- [29] P. Barla, J. Thollot, and F. Sillion, “Geometric Clustering for Line Drawing Simplification,”
Proc. Eurographics Symp. Rendering, 2005.- [30] P.V. Sander, X. Gu, S.J. Gortler, H. Hoppe, and J. Snyder, “Silhouette Clipping,”
Proc. ACM SIGGRAPH '00, pp. 327-334, 2000.- [36] L. Guibas, E. McCreight, M. Plass, and J. Roberts, “A New Representation for Linear Lists,”
Proc. Ninth ACM Symp. Theory of Computing, pp. 49-60, 1977.- [38] N.M. Amato, M.T. Goodrich, and E.A. Ramos, “A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time,”
Discrete and Computational Geometry, vol. 26, no. 2, pp. 245-265, 2001.- [40] C.A. Hipke, “Computing Visibility Polygons with LEDA,” http://ad.informatik.uni-freiburg.de/mitarbeiter/ hipke_hipke. work.vis_polygon.ps.gz , 1996.
- [41] “Applets for Visibility in Simple Polygons,” Univ. of Bonn, http://web.informatik.uni-bonn.de/I/GeomLab VisPolygon/, 2008.
- [42] H. Hoppe, “Progressive Meshes,”
Proc. ACM SIGGRAPH '96, pp.98-108, 1996.- [43] P.V. Sander, J. Snyder, S.J. Gortler, and H. Hoppe, “Texture Mapping Progressive Meshes,”
Proc. ACM SIGGRAPH '01, pp.409-416, 2001.- [44] W. Baxter, P. Barla, and K. Anjyo, “Notes on Compatible Mapping of 2D Shapes,” Technical Report OLMTRE-2008-002, OLM Digital, Inc., http://www.olm.co.jp/en/rd/2008/06 compatible_embedding_notes.html , 2008.
- [46] V. Surazhsky, Personal Comm., June 2008.
- [48] W. Baxter, P. Barla, and K. Anjyo, “N-Way Morphing for 2D Animation,”
Computer Animation and Virtual Worlds, 2009. |