Abstract: In computer graphics, polygons constituting two polygon models are matched to realize spontaneous morphing. Each of first and second polygon models is split into corresponding parts, such as ear, eye or face, and polygons making up a part of the first polygon model are matched to polygons making up a part of the second polygon corresponding to the first-stated part. A connection relational graph, as a two-dimensional graph representing the connection relation between polygons making up the respective parts, is prepared from the two matched parts, and the connection relational graphs of the two matched parts are rendered co-morphic to match the polygons constituting the two parts.

Abstract: A base animation storing unit stores base animation, generated for each grid point in a range of adaptation with regard to a certain motion. A synthesizing unit starts adaptation motion synthesizing in the event that an end effector exists within the range of adaptation. The synthesizing unit calculates a weight array based on the position of a target and the position of each grid point, and adds base animation with the calculation results as linear addition coefficients, thereby generating the desired animation. Accordingly, animation cooperatively display with multiple objects of display can be effectively generated.

Abstract: An animation generating unit supplies start requests for entire animation and synthesizing requests for partial animation to an interpolating computation unit, based on input events. The interpolating computation unit extracts the entire animation data and partial animation data from the entire animation storing unit and the partial animation storing unit, respectively, sequentially executes interpolation computation under timer output, generates new animation data, and outputs the newly-generated animation data to an animation display unit. Thus, animation can be efficiently generated.