Shape Distortion in Computer-Assisted Keyframe Animation

Distortion of one object shape into another is a tool that has been used effectively in two dimensions by animators in entertainment, education and communication for many years. This paper describes a method for computer support of a three-dimensional extension of this technique. If two object descriptions are topologically equivalent, then one object can be continuously deformed into the other by interpolation between the vertex positions of the two descriptions. Using a formal definition of polygon-based object descriptions, an algorithm for deciding the topological equivalence of two object descriptions (and for constructing a vertex correspondence) is developed. If the two descriptions are not topologically equivalent, some modifications to the vertices and edges of the descriptions are required before distortion of one into the other can be accomplished. This algorithm also computes an intermediate object description by the addition of duplicate vertices and degenerate edges and faces to one or both initial object descriptions. The intermediate object description can be distorted from one object to the other by vertex position interpolation.

[1]  Nestor Burtnyk,et al.  Computer animation of free form images , 1975, SIGGRAPH '75.

[2]  Nestor Burtnyk,et al.  Interactive skeleton techniques for enhancing motion dynamics in key frame animation , 1976, Commun. ACM.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Charles M. Eastman,et al.  Geometric Modeling Using the Euler Operators , 1979 .

[5]  Tom Lyche,et al.  Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .

[6]  William T. Reeves,et al.  Inbetweening for computer animation utilizing moving point constraints , 1981, SIGGRAPH '81.

[7]  Craig W. Reynolds.  Computer animation with scripts and actors , 1982, SIGGRAPH.

[8]  Donald P. Greenberg,et al.  Path specification and path coherence , 1982, SIGGRAPH.

[9]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[10]  Gabor T. Herman,et al.  A topological proof of a surface tracking algorithm , 1982, Comput. Vis. Graph. Image Process..

[11]  Alan H. Barr,et al.  Global and local deformations of solid primitives , 1984, SIGGRAPH.

[12]  Kevin Weiler,et al.  Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments , 1985, IEEE Computer Graphics and Applications.

[13]  Norman I. Badler,et al.  Parametric keyframe interpolation incorporating kinetic adjustment and phrasing control , 1985, SIGGRAPH.

[14]  Peter R. Wilson.  Euler Formulas and Geometric Modeling , 1985, IEEE Computer Graphics and Applications.

[15]  Richard R. Patterson,et al.  Projective transformations of the parameter of a Bernstein-Bézier curve , 1985, TOGS.

[16]  Tom Lyche,et al.  Algorithms for degree-raising of splines , 1985, TOGS.

[17]  Zvi Galil,et al.  An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs , 1987, JACM.

[18]  Michael E. Mortenson,et al.  Geometric Modeling , 2008, Encyclopedia of GIS.