Planar Polygon Deformation Technology Key Issues,

Morphing, also called Shape blending, is the continuous smooth and natural transformation of a source object into a target object. Morphing has very wide use in many areas, such as computer graphics, animation design, industrial modeling, science computation visualization, film stunt, etc. This paper makes researches on the three key techniques of morphing as: vertices correspondence, compatible triangulation and vertices interpolation, and the main results of researches are as follows:In the first place this paper presents an effective approach for establishing vertex correspondence between two planar shapes. Correspondences are first established between the major feature points extracted from both simplified polygons of source and target shapes. We use the representation of the simplified polygons in the similar tangent space to construct a new similarity metric function by the fact that the corresponding edges transform to each other with the minimum total amount of moving area. The resulting solution tends to associate regions on the two shapes which look alike. Then the optimal correspondence is obtained by an efficient dynamic programming technique, meanwhile, we can attain the whole vertices correspondence of shapes further. The method is fast and robust, of which the effect is natural and the adapter range is more extensive than the formers'.Compatible triangulation as a new object modeling technique is very important for vertices interpolation technique of morphing. In the second section we introduce an effective approach for establishing compatible triangulation of two simple polygons. The incomplete compatible triangulation method and the compatible triangulation method based on concave vertex evolution presented first are used to get the compatible meshes of the two simple polygons. As these compatible triangulations are usually not of high quality, we devise a series of techniques for remeshing and mesh smoothing according to the intrinsic property of compatible triangulations. Then we attain high quality compatible meshes, meanwhile, the number of the interior vertices...