The Community for Technology Leaders
RSS Icon
Issue No.02 - March (1995 vol.15)
pp: 44-50
We present a novel approach to the problem of generating a polygon sequence that blends two simple polygons given a correspondence between their boundaries. Previous approaches to this problem, including direct vertex interpolation and an interpolation based on edge lengths and angles between edges, tend to produce self intersections and shape distortions. Our approach introduces the star-skeleton representation, a structure comprised of equivalent decompositions of the two polygons into star-shaped pieces and a skeleton connecting the star pieces. we utilized the concept of a star polygon since two star polygons can be fairly blended without an self intersections. We present algorithms for created equivalent star-skeletons for the two polygons and for blending two star skeletons by interpolating their skeletons and unfolding intermediate polygons from the skeletons. We also demonstrate the usage of the star-skeleton for blending multiple polygons and images. We show examples from a working system that demonstrate the improved blend sequences generated by the method. The intrinsic reasons for the good results obtained are the fact that the interiors of the polygons are considered, not only the boundaries, and that the star-skeleton explicitly models an interdependence between all the vertices of the polygons.
Shape blending, shape interpolation, morph, star polygon, skeleton, star-skeleton, keyframe animation, equivalent decompositions.
Michal Shapira, Ari Rappoport, "Shape Blending Using the Star-Skeleton Representation", IEEE Computer Graphics and Applications, vol.15, no. 2, pp. 44-50, March 1995, doi:10.1109/38.365005
1. T.W. Sederberg and E. Greenwood, A Physically Based Approach to 2D Shape Blending Proc. SIGGRAPH '92, pp. 25-34, July 1992.
2. E.W. Bethel and S.P. Uselton, “Shape Distortion in Computer-Assisted Keyframe Animation,” Computer Animation 89, N. Magnenat-Thalmann and D. Thalmann, eds., Springer, New York, 1989, pp. 215-224.
3. J.R. Kent, W.E. Carlson, and R.E. Parent, “Shape Transformation for Polyhedral Objects,” Computer Graphics (Proc. SIGGRAPH 92), vol. 26, no. 2, pp. 47-54, July 1992.
4. T.W. Sederberg et al., "2D Shape Blending: An Intrinsic Solution to the Vertex Path Problem," Computer Graphics Proc. (Siggraph 93), 1993, ACM, New York, 1993, pp. 15-18.
5. T. Beier and S. Neely, "Feature Based Image Metamorphosis," Computer Graphics(Proc. Siggraph 91), ACM Press, New York, 1992, pp. 35-42.
6. N. Burtnyk and M. Wein, “Interactive Skeleton Techniques for Enhancing Motion Dynamics in Keyframe Animation,” Comm. ACM, Vol. 19, No. 10, Oct. 1976, pp. 564-569.
7. G. Wolberg, “Image Warping Among Arbitrary Planar Shapes,” New Trends in Computer Graphics (Proc. Computer Graphics Int’l), N. Magnenat-Thalmann and D. Thalmann, eds., Springer, New York, 1988, pp. 209-218.
8. F. Lazarus, S. Coquillart, and P. Jancène, “Interactive Axial Deformations,” Geometric Modeling in Computer Graphics, B. Falcidieno and T.L. Kunii, eds., Springer, New York, 1993, pp. 241-254.
9. G. Wolberg, Digital Image Warping, IEEE CS Press, 1990.
10. M. Shapira and A. Rappoport, “On Compatible Star Decompositions,” Tech. Report TR94-15, Institute of Computer Science, Hebrew Univ. of Jerusalem, 1994.
11. J. O'Rourke, Art Gallery Theorems and Algorithms. New York: Oxford Univ. Press, 1987.
12. M. Keil, “Decomposing a Polygon into Simple Components,” SIAM J. Computing, Vol. 14, Nov. 1985, pp. 799-817.
135 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool