Morphing algorithms of geometric objects

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 remains faithful to the original shapes, global properties can be easily violaled[1]. In this paper we investigate new morphing algorithms which can solve this problem. We reflect real world geometric objects as a set of polygons in 2-dimensional space, and morph one into another by using data structures that ale 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.