Abstract: A new method of polygon metamorphosis based on morphology and general optimization is proposed in this paper．By decomposing each polygon into a set of several individual convex sub-polygons and constructing the map between the two sets，this method can solve the metamorphosis problem of two polygons which have not same topology（including concave polygon and holey polygon） ．The principle of it is proved theoretically and the results of polygon metamorphosis created by different convex decomposition is discussed．It is proved in the experiment that this method can generate natural，high quality metamorphosis with simple computation．This method can also be used in font composition and interpolation between two keyframes in 2D computer animation．