D polygon blending has been widely used in 2-D character animation, pattern matching, and geometric modeling. Previous algorithms tend to use the polygon’s geometric elements such as edge length, angle, area, skeleton to associate the regions on the two shapes that look alike. However they ignore the visual features of two polygonal shapes. This paper presents a new 2-D polygon blending method based on their visual features correspondence. By decomposing the two polygons into sub-polygon pairs with similar visual features compatibly, each sub-polygon in the source polygon can be smoothly transformed into the corresponding sub-polygon in the destination polygon. Since the feature-decomposition vertices are introduced, user can control the visual features correspondence flexibly and intuitively. Experimental results show that the two polygons can be blended as user prescribed whilst keeping the feature correspondence and feature preservation.
[1]
Thomas W. Sederberg,et al.
A physically based approach to 2–D shape blending
,
1992,
SIGGRAPH.
[2]
Daniel Cohen-Or,et al.
Warp-guided object-space morphing
,
1998,
The Visual Computer.
[3]
Peisheng Gao,et al.
2-D shape blending: an intrinsic solution to the vertex path problem
,
1993,
SIGGRAPH.
[4]
W SederbergThomas,et al.
A physically based approach to 2D shape blending
,
1992
.
[5]
Craig Gotsman,et al.
Guaranteed intersection-free polygon morphing
,
2001,
Comput. Graph..
[6]
Ari Rappoport,et al.
Shape blending using the star-skeleton representation
,
1995,
IEEE Computer Graphics and Applications.
[7]
Marc Alexa,et al.
As-rigid-as-possible shape interpolation
,
2000,
SIGGRAPH.
[8]
Yuefeng Zhang.
A fuzzy approach to digital image warping
,
1996,
IEEE Computer Graphics and Applications.