Morphing,continuously transforming one shape to another, is one of the most interesting areas in computer graphics. a common problem with many morphing algorithms is that although locally the geometry of the interpolated shape properties cna be easily violated[1]. In this paper we investigate new morphing algorithms which cna solve this problem. We reflect real world geometric objects as a set of polygons in 2-dimensional space, and mroph one into another by using data structures that are appropriate for storing and maintaining the properties of each member polygon. We have two algorithms, one is using triangulation and the other is using quad trees.
展开▼
