2-D Polygon Blending Based on Feature Decomposition

2005 Journal of Software (Chinese)  
Yang WW, Feng JQ, Jin XG, Peng QS. 2-D polygon blending based on feature decomposition. Journal of Software, 2005,16(2):309−315. Abstract: 2-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
more » ... es. 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.
doi:10.1360/jos160309 fatcat:p2jc44pbfnecxcqzfbnezywcya