This paper presents a new algorithm for smoothly blending between two 2#D polygonal shapes. The algorithm is based on a physical model wherein one of the shapes is considered to be constructed of wire, and a solution is found whereby the #rst shape can be bent and#or stretched into the second shape with a minimum amountofwork. The resulting solution tends to associate regions on the two shapes which look alike. If the two polygons have m and n vertices respectively, the algorithm is O#mn#. The algorithm avoids local shape inversions in whichintermediate polygons self-intersect, if such a solution exists. Categories and Subject Descriptors: I.3.3 #Computer Graphics #: Picture#Image Generation; I.3.5 #Computer Graphics#: Computational Geometry and Object Modeling. General Terms: Algorithms Additional Key Words and Phrases: Computer graphics, shape blending, animation, physically based algorithms. 1 Introduction The topic of this paper is illustrated in Figures 1#3. Given two polygonal...