2-D Polygon Blending Based on Feature Decomposition
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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 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.

    Reference
    Related
    Cited by
Get Citation

杨文武,冯结青,金小刚,彭群生.基于特征分解的2-D多边形渐变.软件学报,2005,16(2):309-315

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 24,2003
  • Revised:June 10,2004
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063