JP3616241B2 - Animation display method and computer-readable recording medium recording animation display program - Google Patents

Description

【００４９】
この場合の値ｈの示す位置を図解すると図７のようになる。図７に示されるように、ｔ＝０．３は、時間軸上で、第１のキーフレームの表示される時刻と、第２のキーフレームが表示される時刻との間であって、第１のキーフレームが表示される時刻から第２のキーフレームが表示される時刻に向かって３０％の位置に相当する。そこで値ｈがこのｔの位置づけを示しており、「次に描画すべき中間フレームの、時間軸上での位置づけ」を示しているものとする。
【００５０】
ｉ＝１の場合であって、かつ上述のようにｔ＝０．３と仮定すると、Ｐ_ｉ＝０、Ｐ_ｉ＋１＝１であるから、ｈ＝０．３となる。
【００５１】
続いてステップＳ９で、変数ｈで特定される時点に対応する中間フレームの各図形の各特徴値の座標が次のように計算される。これら各座標値を含めてｉ番目のキーフレームのすべての図形のパラメータをＱ_ｉと表わし、ｉ＋１番目のキーフレームでの対応するパラメータをＱ_ｉ＋１と表わすと、パラメータＱ_ｉとパラメータＱ_ｉ＋１に対応するパラメータをＲとすると、Ｒは次のようにして計算される。
【００５２】
【数２】

【００５３】
図３〜図５に示される例を用いて具体的に示すと次のようになる。
【００５４】
【表１】

【００５５】
すなわち、経過時間ｔ＝０．３（秒）に対応する中間フレームに描かれるべき三角形の各頂点の座標、すなわち座標１、座標２および座標３はそれぞれ（２．２，２）（３．２，３）および（２．２，４）となる。
【００５６】
このようにしてすべてのパラメータＱ_ｉについてＲを求めて、このＲの値を用いて中間フレームの全図形を描画する（ステップＳ１０）。この全図形の描画が終了すると、処理はステップＳ４に戻る。すなわち、ある中間フレームの全図形を描画すると、その時点で次のフレームの描画を始めることとなり、その時点までの経過時間をステップＳ４で求めて以後の処理を繰返し実行する。
【００５７】
ところで、ステップＳ１０で行なわれる図形描画にも一定の処理時間が必要とされる。この例では、図４（ａ）および（ｂ）に示されるように、第１のキーフレームと第２のキーフレームとで、描くべき図形自体は同じ三角形１３２である。ｔ＝０．３の時点で描くべき三角形も、たとえば図４（ａ）に示される初期状態（ｔ＝０）での三角形１３２と同一の大きさである。この場合にはｔ＝０．３の時点での図形の描画量自体は、ｔ＝０の時点と変わっていない。この中間フレームを描くために要する時間もまた、ｔ＝０のときの値とほぼ同じ０．３秒となるであろう。したがって、ステップＳ４の２回目の実行での経過時間ｔはｔ＝０．６となる。
【００５８】
上述の繰返し処理において、ステップＳ５での判断がＹＥＳとなると処理はステップＳ６に進む。ステップＳ６では変数ｉに１を加算する。さらにステップＳ７で、加算後のｉを用いてｉ＋１が、当初用意されたキーフレームの数ｎよりも大きいか否かについての判断が行なわれる。この条件が成立しなければ制御はステップＳ５に進んで以下の処理を繰返し実行する。ステップＳ７の条件が成立すると、最後のキーフレームの予定経過時間を過ぎたということであるから、処理を終了する。
【００５９】
上記した例では、中間フレームで描画されるべき描画量は変化しない。したがって各中間フレームの描画に要する時間は０．３秒である。またｎ＝３である。したがってこの例で図６の処理を実行することにより、図８に示されるようなタイミングでフレームの描画が行なわれる。すなわちまずｔ＝０で第１のキーフレームが描画される。さらにｔ＝０．３、０．６および０．９の時点で、第１のキーフレームと第２のキーフレームとの間での補間計算から得られた中間フレームが描画される。さらにｔ＝１．２、１．５、１．８、２．１、および２．４の時点で、第２のキーフレームと第３のキーフレームとの間での補間計算により得られた中間フレームが描画される。すなわち各時点を起点として合計９枚のフレームが描かれ、連続したアニメーションとして表現される。
【００６０】
このときの画面１３０上に描かれる三角形１３２の軌跡を図９に、各図形の描かれる時点とともに示す。図９において、実線で示されているのがキーフレームの図形であり、破線で示されているのが中間フレームで描かれる図形である。図９に示される例で特徴となっているのは、キーフレームのうち最初のキーフレームはｔ＝０の時点で描かれているが、他のキーフレーム（第２および第３のキーフレーム）は描画されていないということである。
【００６１】
なお、図８および図９に示されるｔ＝０〜２．４の０．３秒おきの各時点は、描画の開始の時刻を示している。実際に画面に表示されるまでには、各フレームの描画に対する所要時間が必要であるから、その分だけの遅れが生じる。
【００６２】
上述の例では、アニメーション表示される三角形の大きさが変化せずただ移動のみする場合を示した。しかし、今までに示した装置およびプログラムを用いて、キーフレーム間で三角形の大きさが変化するようなアニメーションを表示することもできる。この場合には、上述の例のように三角形の大きさが変化しない場合と比較して、三角形の面積が変化するために、描画量が変わり中間フレームの描画に要する時間が変わってくる。したがって、全く同じ装置およびプログラムを用いても、見かけ上の動作が上述の例とは異なってくる。
【００６３】
図１０（ａ）〜（ｃ）に、このアニメーションのための３つのキーフレームを示す。図１０（ａ）に示すように、画面１３０の左上に、三角形１３４が描かれるのが第１のキーフレームである。図１０（ｂ）を参照して、第１のキーフレームの三角形１３４が大きくなり（２倍）、三角形１３６として表示されるのが第２のキーフレームである。図１０（ｃ）を参照して、三角形１３６が画面左上から画面右上に移動した後の状態が第３のキーフレームである。
【００６４】
図１１に、図１０（ａ）〜（ｃ）に示される３つのキーフレームに対応するキーフレームデータ１６２、１６４および１６６を示す。図１１を参照して、第１のキーフレームのためのキーフレーム情報１６２は、経過時間（＝０秒）と、三角形１３４を示す第１の図形情報１７４とを含んでいる。図形の種類は閉多角形であり点の数は３、すなわち三角形である。この三角形の３頂点は（１，２）（２，３）（１，４）という座標を有する。第１の図形情報１７４のポインタ１７６は、第２のキーフレームのキーフレーム情報１６４に含まれる第１の図形情報１９４の領域の先頭を示している。
【００６５】
第２のキーフレームのキーフレーム情報１６４は、経過時間（＝１秒）と、第２のキーフレームでの三角形１３６に対応する図形情報１９４とを含んでいる。図形情報１９４によれば、描画の種類は閉多角形であり、その点の数は３、すなわち三角形である。三角形の３つの頂点の座標はそれぞれ（１，１）（３，３）（１，５）である。ポインタ１９６は、第３のキーフレームのためのキーフレーム情報１６６の第１の図形情報２１４の領域の先頭を指し示している。
【００６６】
第３のキーフレームのためのキーフレーム情報１６６は、予定経過時間（＝２．５秒）と、第１の図形のための図形情報２１４とを含んでいる。第１の図形情報２１４によれば、図形の処理は閉多角形であり、その頂点の数は３、すなわち三角形である。この三角形の３頂点の座標はそれぞれ（８，１）（１０，３）（８，５）である。第１の図形情報２１４のポインタ２１６は、この図形が第３のキーフレームで終端となっていることを示している。
【００６７】
図１０（ａ）および（ｂ）を参照して、この間の時間では、三角形１３４が徐々に拡大され三角形１３６となるアニメーションが生成される。この例では、三角形の外形を描くのみであるものとすると、描くべき図形の大きさがａ倍になると、その図形を描くための処理時間もほぼａ倍となる。図１０（ａ）（ｂ）においては、描くべき図形は三角形１３４および１３６のみであるから、図１０（ｂ）に示される第２のキーフレームを描画するための処理時間は、図１０（ａ）に示される第１のキーフレームを描画するための処理時間のほぼａ倍となる。この例ではａ＝２であるから、第２のキーフレームの処理時間は第１のキーフレームのほぼ２倍である。但し前述したとおり、第２のキーフレームは実際には描画されない。
【００６８】
なお、上述の例では三角形の外形を描くのみであるが、三角形の内部を特定の色で塗り潰す場合には、縮尺がａ倍になると面積はａ^２倍となるため、塗り潰しを行なうために必要な描画量がほぼａ^２倍となる。したがって描画量の増加率は、図１０（ａ）および（ｂ）のように外形のみを描く場合よりも大きくなる。
【００６９】
図１０（ｂ）および（ｃ）を参照して、第２のキーフレームから第３のキーフレームの間は、拡大された三角形が平行移動するアニメーションが行なわれる。この場合、１フレーム当りに必要な描画量は変化しないので、１フレーム当りの描画時間も変化せず、第２のキーフレームの処理時間と同様の処理時間を各フレームに対して必要とする。
【００７０】
すなわち、図１０（ａ）〜（ｃ）に示されるようにキーフレームからアニメーションの中間フレームを生成してアニメーション再生した場合、フレームの描画開始タイミングは図１２に示すようになる。まず第１のキーフレームの描画を開始する（ｔ＝０）。第１のキーフレームの描画が、第１の例の場合と同様に０．３秒を要するものとすると、第２のキーフレームの描画はｔ＝０．３の時点で開始される。図１１に示される図形情報１７４および１９４によれば、第２のキーフレーム（ｔ＝１に相当）での三角形の大きさは、第１のキーフレームでの三角形１３４の大きさの２倍である。この間、三角形の拡大は線形的に行なわれるものとすれば、ｔ＝０．３の時点では、三角形１３４を１．３倍した大きさの三角形を描画する必要が生じる。この場合、０．３×１．３＝０．３９（秒）、すなわち約０．４秒の処理時間を要する。ｔ＝０．３の時点で描画処理を開始した中間フレームの処理はｔ＝０．７の時点で終了する。さらにｔ＝０．７に相当する時点での描画されるべき三角形の大きさは、図１０（ａ）の三角形１３４を１．７倍した大きさとなる。その描画に要する時間は０．３×１．７＝０．５１（秒）、すなわち約０．５秒である。したがってこの中間フレームの描画はｔ＝１．２秒の時点で終了し、次のフレームの描画が開始される。ｔ＝１．２秒の時点では描かれるべき三角形は既に図１０（ｂ）に示される三角形１３６の大きさとなり、これ以後その大きさには変化はない。したがって以後の描画に要する時間は一定である。この描画には、０．３×２＝０．６秒を要する。このようにして各中間フレームの描画が開始されるタイミングを示したのが図１２である。こうして、図１２に示されるように、ｔ＝０、０．３、０．７、１．２、１．８および２．４に相当する時刻を起点とした６枚のフレームが描かれて連続したアニメーションとして表現される。
【００７１】
図８と図１２とを参照して、図８に示される例では各フレームを描画するための処理時間は一定であったのに対し、図１２に示される例ではそれらは一定ではない。しかしいずれの場合にも、各キーフレームに保持されている予定経過時間情報に沿ってアニメーションの再生が行なわれ、かつ全体の再生時間も両者ともほぼ２．５秒となることがわかる。つまり、各フレーム当りの描画量が変化しても、その変化が全体のアニメーションの表示の進行には影響を与えないということがわかる。
【００７２】
同様の考え方によれば、たとえばＣＰＵの処理能力が２倍になった場合を考える。図８に示す例の場合、ＣＰＵの処理能力が２倍になれば、各フレームの描画が開始されるタイミングは図１３に示されるように０．１５秒おきとなり、全体で１７枚のフレームが再生される。また図１０に示される例を同じく処理能力が２倍のＣＰＵで再生した場合、各フレームの描画の開始タイミングは図１４に示されるようになる。この場合、第１のキーフレームから第２のキーフレームまでの間に中間フレームの描画に要する時間は徐々に増加するが、全体としては１０枚のフレームでこのアニメーションを再生することができる。図８と図１３とを参照すれば、同じアニメーションが、同じ時間経過に沿って再生されることがわかる。しかもこの場合には、この間に生成されるフレーム数がほぼ２倍となり、より滑らかなアニメーションを得ることができる。図１２と図１４とを比較しても同様である。したがって、アニメーションの作成時にどのような処理能力のＣＰＵを想定していたとしても、また再生時に実際にどのような処理能力のＣＰＵでこのアニメーションを再生したとしても、この方法によりアニメーションを再生する限り、同じ時間経過に沿って、かつＣＰＵの処理能力に応じた滑らかさでアニメーションが再生されることになる。
【００７３】
以上、図形の特徴点の座標が変化する場合について例とした示したが、同様の方法を用いて、データの中身を変えることにより、かつ図形を描画する場合に、データの内容に応じて異なる図形描画処理を行なうようにすれば、上述の実施の形態１のコンピュータおよびプログラムを用いて、図形の色、透明度、図形を構成する線の太さ、図形を構成する線が破線の場合の実線部と空白部との比率、図形が文字である場合のフォントのサイズ、図形が複数個の図形からなる図形群の場合に、この図形群の基準点の座標、同じく図形群の表示上の縮尺比率などを、各キーフレームごとに指定しておき、中間フレームをこれらキーフレームの対応する情報の間で行なう補間計算により得ることができる。
【００７４】
たとえば図１５（ａ）に、図形の種類が多角形の場合に考えられる図形情報２６２のデータ構造を示す。図１５（ｂ）に、図形の種類として一群の文字からなるテキストが指定された場合の図形情報２６４のデータ構造の例を示す。図１５（ｃ）には、図形の種類として図形群が指定された場合の図形情報２６６のデータ構造の例を示す。
【００７５】
図１５（ａ）を参照して、図形の種類が多角形の場合には、点の数と、点の数に応じた数の座標と、図形内部を塗り潰すべき色と、透明度と、図形を構成する線の太さと、その線種と、線種が破線である場合の実線部と空白部との比率を示すデータ等が格納される。たとえば色であれば、光の三原色である赤（Ｒ）、緑（Ｇ）、青（Ｂ）の数値により表現できる。連続した２つのキーフレーム中の図形の属性情報として、この（Ｒ、Ｇ、Ｂ）を指定しておけば、対応するデータの間での補間計算を行なって中間フレームの図形を塗り潰すべき色を特定する（Ｒ、Ｇ、Ｂ）を計算することができる。透明度、線の太さ、線種が破線の場合の実線部／空白部の比率などについても全く同様である。
【００７６】
図１５（ｂ）を参照して、図形の種類がテキストである場合には、そのテキストを描画すべき座標（この場合にはテキストの基準位置の座標）と、テキスト内容と、テキストを表示すべきフォントの種類と、テキストを表示すべきフォントのサイズを示すフォントポイント数と、テキスト表示の色を指定する情報と、フォントを表示する際のそのフォントのスタイル（標準、イタリック体、ゴールド体など）と、テキスト中の文字間隔、行間隔、各行についての行揃えを示す情報、などが格納される。特に文字の場合、連続した２つのキーフレームの中のテキストの属性情報として、ポイントフォント数があれば、その値に対して補間計算を行なうことにより中間フレームで表示すべきテキストの文字の大きさを決定することができる。この場合、ポイント数が端数であってもそのポイント数に従った大きさの文字を表示できる場合には問題ないが、特定のポイント数の文字しか表示できない場合には、補間によって得られたポイント数に最も近いポイント数の文字を表示するようにしてもよい。
【００７７】
図１５（ｃ）を参照して、図形情報２６６の種類が図形群の場合には、この情報２６６には、その図形群に含まれる図形の数と、各図形に対応する図形情報への、その図形の数に対応したポインタと、図形群全体を表示する際の基準点の座標と、図形群を表示する際の表示上の縮尺比率などが格納される。この場合のポインタは、この図形群の図形情報２６６が格納されているキーフレームの中に別の図形情報として格納されている個々の図形情報へのポインタである。図１５（ｃ）に示される例の場合、基準点座標、表示上の縮尺比率などを、隣接する２つのキーフレーム間の補間計算により求めることができる。
【００７８】
次に、本発明の実施の形態２に係るアニメーション表示方法を実現するための装置について図１６を参照して説明する。実施の形態１では、隣接する２つのキーフレーム間で対応する図形情報のうち対応する特徴データの間で線形計算による補間計算で中間フレームの図形情報の対応する特徴データを生成していた。実施の形態２の方法では、このようにして補間計算により得られた特徴データをさらに所定の方法で変換して、時間軸上での各図形の動きに、線形計算では得られない変化を与えることを特徴としている。
【００７９】
図１６に、実施の形態２の方法を実現するためのコンピュータ３３０のブロック図を示す。このコンピュータ３３０が図１に示される実施の形態１を実現するためのコンピュータ３０と比較して異なるのは、メモリ３４内に、実施の形態１のためのプログラムとは異なるプログラムを記憶したプログラム情報記憶部３４４と、上述のように一旦線形計算による補間計算により得られた図形の特徴データをさらに変換する際に用いられる変換テーブル３４６とを含んでいる点である。その他の点では図１６に示されるコンピュータ３３０は図１に示されるコンピュータ３０と同様である。同一の部品には同一の参照符号および名称を与えており、それらの機能も同一である。したがってここではそれらについての詳細は繰返さない。
【００８０】
図１７を参照して、変換テーブル３４６は、実施の形態１で説明された、「次に描画すべき中間フレームの位置づけ」を示す値ｈを予め計算し、そのｈの各値に対して、その時点で実際の変化量としてとるべき値ｋを予め定め、ｈとｋとの対をテーブルとして予め準備したものである。図１７に示される変換テーブル３４６では、ｈに対してｋ＝ｈ^２の関係が想定されている。なお、ｋとしてｈと上述したような関数関係を想定して変換テーブル３４６を作成してもよいが、変換テーブルを用いた場合には、必ずしもそうした関数関係に基づかず、アニメーション作成者の恣意的な意図によってｋを定めることができ、それによって単純な関数では得られないような特殊な動きを実現することが可能になる。
【００８１】
図２７を参照して、このような変換テーブルを複数個準備し、それぞれの図形情報に付加されたテーブル番号によって、それぞれ異なる変換テーブルを対応付けることにより、キーフレームが２つだけであっても、それぞれの図形に、時間軸に対して異なる動きを表現させることが可能になる。なお、ここではテーブル番号＝０は、変換テーブルを用いないということを表すものである。
【００８２】
また、図２８を参照して、テーブル番号１はｋの変化量が次第に増加する加速度運動、テーブル番号２はｋの値が０と１の間で振動する反復運動を表している。図２９を参照して、等速で移動する飛行機の絵１００１には変換テーブルを対応させないものとし、落下するリンゴの絵１００２にはテーブル番号１すなわち加速度運動を対応させ、しゃべる人物の絵１００３にはテーブル番号２すなわち反復運動を対応させるものとすると、キーフレーム１とキーフレーム２の２つのキーフレームだけで、３種類の異なる性質の動きを同時に実現することが可能となる。
【００８３】
図１８に、図１６に示すプログラム情報記憶部３４４に格納されるプログラムの制御の流れを示す。図１８に示すフローチャートが図６に示される実施の形態１のプログラムのフローチャートと異なるのは、ステップＳ８の後に、ステップＳ８で得られたｈを、変換テーブル３４６を参照してｋに変換するステップＳ１１が含まれることと、図６のステップＳ９でｈの代わりにｋを用いてステップＳ９と同様の処理を行なうステップＳ１２が挿入されていることとである。他の点では図１８は図６に示されるフローチャートと全く同様である。
【００８４】
このように、線形計算による補間計算により得られた値ｈを、変換テーブル３４６を用いてｋに変換しｋを用いて中間フレームの対応パラメータを計算して図形を生成する。こうした処理をたとえば図形の座標点に対して適用すると、たとえば加速度を伴った図形の動きなど、時間の進行に対して非直線の動きを表現することが可能になる。また、既に述べたようにテーブル３４６の内容を自由に設定できることから、時間に対して恣意的な動きを設定することができるという利点がある。また図形の色に対して適用すると、時間軸上で色が変化する特殊な効果を出すことができる。
【００８５】
このように一旦ｈを計算した後、ｈを別の値ｋに変換する方法としては、テーブル変換ではなく或る関数の変数としてｈを代入し、そのときの関数の値をｋとすることも考えられる。たとえばｋ＝ｈ^２という演算を行なってｋを得ることが考えられる。もちろんこの例は一例であり、他のどのような関数を用いてもよい。この場合、図１８のステップＳ１１で、上述の関数による変換を行なえばよい。この場合には、テーブル変換による場合と比較して、保有しなければならないデータ量がより少なくなるという利点がある。
【００８６】
上述のように本発明によれば、隣接するキーフレームの対応する図形の対応するパラメータ間で補間を行なうことにより中間フレームを作成するキーフレーム補間方式のコンピュータアニメーションにおいて、ＣＰＵ速度や１フレーム当り必要とされる描画量に依存せず、全体の再生時間を一定とすることが可能となる。そのため画像は、音声と同期して再生させることが容易となる。また、ＣＰＵの処理能力に応じて増加する中間フレーム数でアニメーションを再生することができ、かつＣＰＵに遊び時間が発生することがないため、ＣＰＵの処理能力の増大に応じ過去に作成したデータを修正することなく、より滑らかなアニメーションを再生することができる。
【００８７】
本発明におけるアニメーション表示プログラムは、磁気テープ又はＣＤ−ＲＯＭ等の記録媒体におって供給される。当該アニメーション表示プログラムはコンピュータ本体によって実行され、操作者はグラフィックディスプレイ装置を見ながらキーボードまたはマウスを操作することによってアニメーション表示を行う。また、アニメーション表示プログラムは他のコンピュータより通信回路を経由し、通信モデムを介してコンピュータ本体に供給されてもよい。
【図面の簡単な説明】
【図１】本発明を実現するためのコンピュータのブロック図である。
【図２】キーフレーム情報を模式的に示す図である。
【図３】アニメーションの一例を模式的に示す図である。
【図４】図３に示されるアニメーションを再生する上で必要とされるキーフレームの画像を示す図である。
【図５】図４に示されるキーフレームのためのキーフレーム情報を示す図である。
【図６】実施の形態１でのアニメーション表示方法を実現するためのプログラムのフローチャートである。
【図７】中間フレームの生成タイミングを模式的に示す図である。
【図８】描画量が一定の場合の、中間フレームの描画開始タイミングを模式的に示す図である。
【図９】図３に示されるアニメーションを再生する場合の、中間フレームの各図形を模式的に示す図である。
【図１０】図形の描画量が変化するアニメーションのためのキーフレームを示す図である。
【図１１】図１０に示されるアニメーションのキーフレーム情報を示す図である。
【図１２】図１０に示されるキーフレームから再生されるアニメーションの、各フレームの描画開始タイミングを模式的に示す図である。
【図１３】図３に示されるアニメーションを、処理能力の高いＣＰＵで処理した場合の、各フレームの描画開始タイミングを模式的に示す図である。
【図１４】図１０に示されるアニメーションを、処理能力の高いＣＰＵで処理した場合の、各フレームの描画開始タイミングを示す模式図である。
【図１５】図形の色など、座標情報以外のデータを格納した図形情報の構成の例を示す図である。
【図１６】本発明の実施の形態２を実現するためのコンピュータのブロック図である。
【図１７】変換テーブルを模式的に示す図である。
【図１８】実施の形態２の方法を実現するためのプログラムのフローチャートである。
【図１９】従来のキーフレーム補間方式のアニメーションの原理を模式的に示す図である。
【図２０】従来方式によるアニメーション表示の一例を示す図である。
【図２１】従来技術によるキーフレーム補間方式のアニメーションの問題点を示すための図である。
【図２２】従来技術によるキーフレーム補間方式のアニメーションの問題点を示すための図である。
【図２３】従来技術によるキーフレーム補間方式のアニメーションの問題点を示すための図である。
【図２４】従来技術によるキーフレーム補間方式のアニメーションの問題点を示すための図である。
【図２５】従来技術によるキーフレーム補間方式のアニメーションの問題点を示すための図である。
【図２６】従来技術によるキーフレーム補間方式のアニメーションの問題点を示すための図である。
【図２７】本発明の実施の形態２における複数の変換テーブルを持つ場合のキーフレーム情報を模式的に示すための図である。
【図２８】本発明の実施の形態２における複数の変換テーブルの例を示すための図である。
【図２９】本発明の実施の形態２における複数の変換テーブルを利用したアニメーションのキーフレームの例を示すための図である。
【符号の説明】
３０、３３０ コンピュータ
３２ ＣＰＵ
３４ メモリ
３６ グラフィックメモリ
３８ ディスプレイ画面
４０ タイマ
６２、６４、６６、１６２、１６４、１６６ キーフレーム情報
３４６ 変換テーブル[0001]
BACKGROUND OF THE INVENTION
The present invention relates to an animation reproduction method for reproducing a graphic animation using a computer, and in particular, based on an image of a key frame (key frame) in a time series, an image between key frames is real-time. The present invention relates to an animation playback method for generating and playing back.
[0002]
[Prior art]
As a method of playing animation using a computer, animation is generated by generating a frame between key frames based on the coordinate data of the frame image at the key time, instead of all the frames in the time series. There is a way to play.
[0003]
A conventional method proposed in Japanese Patent Laid-Open No. 60-191366 will be described with reference to FIG. In this method, images of all frames of the animation are not stored, but only images of specific key frames are stored in advance. It is assumed that figures 362 and 364 shown in FIG. 19 are such key frame figures, and these belong to key frames adjacent to each other on the time axis. In Japanese Patent Application Laid-Open No. 60-191366, the time between the adjacent key frame figures 362 and 364 is divided into n equal parts, and the intermediate frames 366, 368 and 370 (assuming n = 3) are included. Are determined by linear interpolation between the corresponding image figures 362 and 364 in the key frame. Thus, assuming that the time axis advances in the direction indicated by the arrow in FIG. 19, first the key frame including the graphic 362, and then the three intermediate frames including the intermediate graphic 366, 368 and 370, respectively. The key frame including the figure 364 is displayed and the animation is reproduced. After the key frame including the figure 364 is displayed, the same interpolation calculation is performed between this key frame and the next key frame, and animation reproduction is performed.
[0004]
[Problems to be solved by the invention]
Such an animation reproduction method has an advantage that the amount of data required for animation reproduction is much smaller than that in the case of having information of all frames. Conventionally, it has been difficult to realize such an animation reproduction method, but it is about to be realized by improving the processing capability of a CPU (central processing unit) in recent years. However, this method has the following problems because the CPU generates intermediate frames by calculation.
[0005]
Referring to FIG. 20, it is assumed that three frames 382 to 386 correspond to intermediate frames in the conventional method described above. For each frame, the time required for drawing is 0.1 seconds. That is, it takes 0.3 seconds in total to reproduce these three frames. If this animation is played back in real time in parallel with the sound, the following problems occur.
[0006]
The first problem occurs when an attempt is made to reproduce this animation on a CPU that has a slower processing speed than expected when the animation was created. In this case, as shown in FIG. 21, the time required to draw one frame is longer than 0.1 seconds, for example, 0.12 seconds. Therefore, when the frames 392 to 396 are sequentially reproduced, the reproduction time takes longer than expected, and the delay from the initially assumed reproduction time gradually increases. On the other hand, the sound is played back at the initially assumed time. As a result, the difference between the movement of the displayed graphic and the sound becomes gradually larger. For example, as shown in FIG. 21, as the frames 392, 394, and 396 are advanced, the shape of the mouth of the person reproduced on the screen does not match the sound.
[0007]
Contrary to the first problem, the second problem occurs when an attempt is made to reproduce this animation with a CPU having a higher processing capability than assumed when the animation was created. In this case, as shown in FIG. 22, the time required to draw each of the frames 402, 404 and 406 may be shorter than 0.1 seconds, for example, only 0.06 seconds. For this reason, the animation playback time is shorter than expected when the animation is created. If the audio playback speed is constant, even in the case shown in FIG. 22, there is a difference between motion and audio. In this case, the animation moves faster than the voice.
[0008]
What has been described above is a problem caused by the difference in processing capability of CPUs. However, such a problem also arises due to fluctuations in the drawing amount required for each frame. For example, with reference to FIG. 23, consider a case where a figure to be drawn becomes larger as it advances on the time axis with frames 412, 414 and 416. In such a case, the larger the figure, the longer the time required for drawing. For example, it is assumed that drawing of frame 412 takes 0.1 seconds, drawing of frame 414 takes 0.11 seconds, and drawing of frame 416 takes 0.12 seconds. Also in this case, a delay of 0.01 seconds occurs in the frame 414, and a drawing delay of 0.01 + 0.02 = 0.03 seconds occurs in the frame 416. Therefore, also in this case, the reproduction timing of each frame is shifted from the audio reproduction timing.
[0009]
In order to solve the problem relating to the synchronization between the sound and the screen as described above, a method of determining the drawing processing start time of each frame on the basis of the first frame is also conceivable. However, this method has the following problems. Also in this case, the example shown in FIG. 20 is assumed.
[0010]
First, referring to FIG. 24, consider a case where the processing capability of the CPU is lower than that assumed. In this case, for example, the drawing time assigned to each of the three frames 422, 424 and 426 is determined to be 0.1 second. If the processing speed of the CPU is slow, it may not be possible to complete all drawing during the given drawing time. Then, as shown in a frame 422, 424, or 426 in FIG. 24, there arises a problem that drawing of the next frame starts with each frame being incomplete.
[0011]
On the other hand, when the processing capacity of the CPU is higher than the assumed processing capacity, the following problem occurs. Referring to FIG. 25, when each frame 432, 434, and 436 is played back by a CPU with high processing capability, for example, the time required to draw each frame is only 0.06 seconds. The time allocated for drawing each frame is 0.1 seconds. Therefore, for each frame, a pause time of 0.04 seconds occurs after the drawing process is completed. During this time, the CPU is idle. If the processing capacity of the CPU is maximized, not only the three frames 432, 434 and 436 as shown in FIG. 25 but also five frames 442, 444, 446, as shown in FIG. It should be possible to play 448 and 450. As the number of frames reproduced during a unit time increases, the movement of the animation becomes smoother. Therefore, the pause time as shown in FIG. 25 is avoided as much as possible, and the reproduction as shown in FIG. 26 can be performed. Is preferable.
[0012]
In addition, not only the position and size of a figure, but also the color and transparency of the figure, the thickness of the lines that make up the figure, for example, the lines that make up the figure are broken lines, It is preferable that the ratio between the drawn portion and the non-drawn portion, the font size when displaying characters, and the like can be applied. In addition, it is desirable that the same processing can be performed not only for a single figure but also for movement of a figure group composed of a group of basic figures. The same applies to the scale ratio on the group display. Furthermore, it is more preferable if an intermediate frame is generated from a key frame so that an animation can be reproduced with a specific change with respect to time as well as simple movement.
[0013]
Therefore, the object of the invention described in claim 1 and the object of the invention described in claim 2 is to generate an animation by generating intermediate frames between key frames with as many frames as possible while keeping the reproduction speed of animation constant. It is an object to provide an animation playback method that can play back video.
[0014]
In addition to the object of the invention described in claim 1 or 2, the object of the invention described in claims 3 to 10 is the time series change of the feature point of the figure, the time series change of the color of the figure, the transparency of the figure, respectively. Time-series change, time-series change of the thickness of the lines that make up the figure, time-series change of the ratio between the drawn and non-drawn parts of the lines that make up the figure, and the time-series of the font size when the figure is a character Provided is an animation reproduction method capable of displaying a time series change of a reference point of a figure group and a time series change of a scale ratio on the figure group when the figure is a figure group. That is.
[0015]
The object of the invention described in claims 11 to 13 is to provide an animation reproduction method capable of changing the motion of the animation in addition to the object of the invention described in claim 1 or 2.
[0016]
[Means for Solving the Problems]
An animation display method according to claim 1 is for displaying a graphic animation on a display device using a computer program, each of which includes information for specifying a display time, A step of preparing a plurality of key frame information in a memory including graphic information for specifying a feature of a graphic to be displayed in a display frame at a display time, a step of obtaining a current display time, and the above-described steps A step of selecting at least two pieces of key frame information each having display times before and after the obtained display time, and corresponding graphic information included in each of the at least two pieces of key frame information. The graphic information to be displayed at the obtained display time is created by performing a predetermined interpolation calculation in A step of drawing a frame at the obtained display time based on the created graphic information, a step of obtaining the current display time, a step of selecting, a step of creating, and a step of displaying And a step of repeating until a predetermined time elapses.
[0017]
After a plurality of key frame information is prepared in the memory in advance, the following repetition is performed. First, the current display time is obtained. Then, the two preceding and following key frame information is selected. A predetermined interpolation operation is performed between corresponding graphic information included in these two key frame information, and graphic information to be displayed at the obtained display time is created and drawn. Since drawing information for the next frame is not created unless one frame is drawn, each frame can be drawn completely. In addition, since the display time is not determined in advance, a large number of intermediate frames are created in the case of a CPU with high processing capability, and a small number of intermediate frames are created in a CPU with low processing capability. The corresponding animation can be displayed.
[0018]
In the animation display method according to the second aspect of the invention, in addition to the configuration of the invention according to the first aspect, the plurality of key frame information includes head key frame information relating to a frame to be displayed at the head. . The animation display method further includes a step of displaying the top frame based on the top key frame information at the start of the animation display. The step of obtaining the current display time includes the step of referring to the timer in response to the completion of the drawing process of one frame and obtaining the value of the timer at that time as the display time.
[0019]
When the drawing process of the first frame is completed, the display time of the next frame is obtained in response to the completion. When the drawing of the frame at this display time is completed, the next display time is obtained in response to the completion. When drawing processing for a certain frame is completed one after another in this way, frame creation and drawing at the display time at the time of completion are repeated, so there is no play time and the CPU's ability can be fully utilized. it can.
[0020]
In addition to the configuration of the invention described in claim 1 or 2, the graphic information includes coordinate information of graphic feature points, graphic color information, and graphic transparency information. , Information on the thickness of the lines that make up the figure, information on the ratio of the drawn and non-drawn parts of the lines that make up the figure, the size of the character font, the coordinates of the reference point of the figure group, Each of the scale ratios. By creating and drawing graphic information at an intermediate frame by interpolation between these graphic information, deformation or movement of the graphic, change in the color of the graphic, change in the transparency of the graphic, line thickness of the graphic, graphic It is possible to create an animation including changes in the broken lines of the lines, the size of the character font, the movement of the graphic group, and the change in the scale ratio on the graphic group display.
[0021]
In the animation display method according to the invention described in claim 11, in addition to the configuration of the invention described in claim 1 or 2, the creating step is performed between the corresponding graphic information included in each of the two key frame information. Interpolation calculation is performed by a predetermined linear calculation, and graphic information obtained by the interpolation calculation is converted by a predetermined conversion method.
[0022]
By further converting the graphic information generated by the interpolation calculation by linear calculation once, it becomes possible to express a non-linear movement with respect to time, such as a movement with acceleration. In other words, it is possible to change the animation on the time axis.
[0023]
In addition to the structure of the invention described in claim 11, the animation display method according to the invention described in claim 12 further includes the step of preparing a table for converting graphic information prior to the start of animation display. Contains. The converting step includes a step of looking up the converted graphic information corresponding to the graphic information created in the creating step from the above table.
[0024]
In this way, it is possible to realize arbitrary changes on the time axis on the animation by converting the graphic information once created by interpolation calculation using a table and displaying the animation with the converted graphic information. it can.
[0025]
In the animation display method according to the thirteenth aspect, in addition to the configuration of the invention according to the eleventh aspect, the converting step assigns the graphic information created in the creating step to a variable of a predetermined function. The step of using the value of this function as the converted graphic information is included.
[0026]
Since graphic information obtained by interpolation calculation by linear calculation is further substituted into a variable of a predetermined function for conversion, non-linear motion can be realized on animation. Furthermore, there is a feature that the amount of data required for this is small.
[0027]
In the animation display method according to the fourteenth aspect of the invention, in addition to the configuration of the invention of the twelfth aspect, in the step of looking up from the table, the conversion table includes a number for identifying. The graphic information has a number for associating with the table, and includes a step of looking up from a table individually associated with each graphic in advance.
[0028]
A step of preparing a plurality of conversion tables and looking up from different conversion tables according to the table number added to each graphic information is included. This makes it possible to express more complicated movements in each figure between only two key frames. For this reason, it is possible to reduce the time and effort required to create a large number of key frames and to reduce the amount of data required.
[0029]
A computer-readable recording medium recording the animation display program according to claim 15 is a recording medium recording an animation display program for displaying a graphic animation on a display device using the computer program, A step of preparing a plurality of key frame information in a memory including information for specifying a display time and graphic information for specifying a feature of a graphic to be displayed in the display frame at the display time A step of obtaining a current display time, a step of selecting at least two key frame information each having a display time before and after the obtained display time among the plurality of key frame information, and the at least two keys Predetermined interpolation calculation between corresponding graphic information included in each frame information A step of creating graphic information to be displayed at the obtained display time, and a step of displaying a frame at the obtained display time on a display device based on the created graphic information; A computer recording an animation display program for realizing the step of obtaining the current display time, the selecting step, the creating step, and the displaying step until a predetermined time elapses. It is a readable recording medium.
The present invention is also an animation display method for displaying an animation based on a plurality of key frame information including time information for specifying a time to be displayed and graphic information for specifying a graphic to be displayed. A predetermined interpolation calculation is performed based on the step of acquiring time, time information and graphic information included in at least two key frames of the plurality of key frames, and the acquired current time, and corresponds to the current time Generating an intermediate frame including graphic information for specifying a graphic to be displayed, and displaying the generated intermediate frame. The current time is acquired in response to the completion of the display of the intermediate frame. An animation display method characterized by the above is provided.
The present invention also provides an animation display method characterized in that the two key frames are key frames before and after the current time on the time axis, respectively.
Ma Further, the present invention is a computer readable recording an animation display program for displaying an animation based on a plurality of key frame information including a display time for specifying a display time and a graphic information for specifying a graphic to be displayed. A predetermined recording medium based on a step of acquiring a current time, time information and graphic information included in at least two key frames of the plurality of key frames, and the acquired current time Performing an interpolation calculation, generating an intermediate frame including graphic information for specifying a graphic to be displayed corresponding to the current time, and displaying the generated intermediate frame. The current time is acquired in response to the completion of the display of the intermediate frame. A computer-readable recording medium on which an animation display program is recorded is provided.
[0030]
DETAILED DESCRIPTION OF THE INVENTION
With reference to FIG. 1, the animation display method of the present invention is realized by a computer 30. The computer 30 executes a predetermined program to realize processing of each step of the present invention, a graphic memory 36 into which the CPU 32 writes an animation image, and an image on the graphic memory 36 for displaying. It includes a display screen 38, a memory 34 connected to the CPU 32, and a timer 40 for the CPU 32 to obtain information relating to time. The memory 34 includes a key frame information storage unit 42 that stores a plurality of key frame information, and a program information storage unit 44 that stores program information for realizing the animation display method of the present invention executed by the CPU 32. Yes.
[0031]
Referring to FIG. 2, key frame information storage unit 42 includes a plurality of key frame information 62, 64 and 66. Although the number of normal key frames is larger than this, in this example, only three cases are considered as key frames for the sake of simplicity.
[0032]
For example, the first key frame information 62 includes information for specifying a time at which the first key frame is to be displayed, that is, a scheduled elapsed time 72 from the start of animation display to the first key frame display, and a scheduled elapsed time. Graphic information 74, 78, and 82 for specifying the characteristics of the graphic to be displayed on the frame after the elapse of time 72 is included. Since the first key frame 62 is displayed at the start of the animation, the estimated elapsed time = 0 for the first key frame. Each graphic information 74, 78, and 82 has pointers 76, 80, and 84 to areas in which corresponding graphics of the second key frame described later are stored. The contents of the graphic information will be described later with reference to FIG.
[0033]
Similarly, the second key frame information 64 includes scheduled elapsed time 92 and graphic information 94, 98, 102 and 106. The pointers 76, 80, and 84 of the graphic information 74, 78, and 82 of the first key frame information 62 indicate the heads of the areas of the graphic information 94, 98, and 102 of the second key frame 64, respectively. Similarly, the graphic information 94, 98, 102 and 106 of the second key frame information 64 has pointers 96, 100, 104 and 108. Among these, pointers 96, 100, and 108 point to the beginning of the corresponding graphic information area of the third key frame 66 described later. The pointer 104 of the third graphic information 102 stores a value indicating that the key frame is the end.
[0034]
Similarly, the third key frame information 66 includes a scheduled elapsed time 112 and graphic information 114, 118, and 122. The pointers 96, 100, and 108 of the second key frame information 64 point to the heads of the graphic information 114, 118, and 122 areas of the third key frame information 66, respectively. The graphic information 114, 118, and 122 have pointers 116, 120, and 124, respectively. However, in this example, it is assumed that the third key frame is the last frame. A value indicating that is stored.
[0035]
FIG. 3 shows an outline of the animation represented by the key frame information 62, 64 and 66 shown in FIG. Referring to FIG. 3, this animation is such that triangle 132 moves within screen 130. As shown in FIG. 3, the triangle 132 translates from the upper left to the upper center of the screen 130 over 1 second, and further translates from there to the lower right position of the screen 130 over 1.5 seconds. To do. The triangles indicated by the solid lines in FIG. 3 are the shapes and positions of the figures specified by the first key frame information 62, the second key frame information 64, and the third key frame information 66 shown in FIG. Is shown. As already described, the estimated elapsed time of the first key frame 62 is zero. The time required for the triangle 132 to move to the triangle position displayed in the second key frame is 1 second, and the time required for the triangle 132 to be displayed on the third key frame is 1.5 seconds. Therefore, the scheduled elapsed time 92 of the second key frame 64 shown in FIG. 2 is “1 second”, and the scheduled elapsed time 112 of the third key frame 66 is “1 + 1.5 = 2.5 seconds”. is there.
[0036]
FIGS. 4A, 4B, and 4C show key frames specified by the key frame information 62, 64, and 66 shown in FIG. 2, respectively. The position of the triangle 132 in each key frame is as already described.
[0037]
The contents of the key frame information 62, 64 and 66 shown in FIG. 2 will be described with reference to FIG. In this case, as shown in FIG. 3, since the displayed graphic is one of the triangles 132, only the first graphic information 74, 94 and 114 (see FIG. 2) is assumed as graphic information. Referring to FIG. 5A, the meaning of the first key frame information 62 is as follows.
[0038]
“The scheduled elapsed time corresponding to the first key frame is 0 seconds. In the first key frame, the first graphic specified by the graphic information 74 exists.”
The meaning of the first graphic information 74 is as follows in the example shown in FIG.
[0039]
"The first figure is a closed polygon with three points. That is, this figure is a triangle. The coordinates of the three vertices of the triangle are (1, 2) (2, 3) (1, 4), respectively. The graphic corresponding to the first graphic also exists in the second key frame, and the graphic information is stored in the second key frame information 64 shown in FIG. First graphic information 94. "
Similarly, the meaning of the second key frame information 64 in FIG. 5B is as follows.
[0040]
“The estimated elapsed time corresponding to the second key frame is 1 second. The first graphic is present in the second key frame, and the graphic information is graphic information 94. The specified graphic is continuous with the graphic specified by the first graphic information 74 in the first key frame information 62. The graphic specified by the graphic information 94 is a triangle, and the three vertices thereof. The coordinates are (5, 2) (6, 3) (5, 4) A figure corresponding to the first figure is also present in the third key frame, and its position is indicated by a pointer 96. ing."
The meaning of the third key frame information 66 is as follows.
[0041]
“The estimated elapsed time corresponding to the third key frame is 2.5 seconds. The figure specified by the figure information 114 exists in the third key frame, and the figure is a triangle. The coordinates of the three vertices are (10, 6), (11, 7), and (10, 8), which are continuous from the first figure of the second key frame. Is broken at the keyframe.
Refer to FIG. 6 for the control flow of the program that is stored in the program information storage unit 44 shown in FIG. 1 and that is executed by the CPU 32 to realize the function of each step recited in the claims. I will explain. First, in step S1, the timer 40 (see FIG. 1) is initialized. In the present embodiment, the value of the timer 40 is reset to 0 by initialization. As another form, the timer 40 operates continuously, and the value of the timer 40 at the time of initialization is copied to a predetermined area on the memory 34 and used as a value indicating a reference value for subsequent processing. May be.
[0042]
Normally, prior to the processing shown in FIG. 6, key frame information is loaded into the key frame information storage unit 42 of the memory 34 from an external storage device such as a hard disk not shown in FIG.
[0043]
Subsequently, in step S2, based on the first key frame information 62 shown in FIG. 5A, the first key frame (FIG. 4A) is drawn on the graphic memory 36 (see FIG. 1). The The display screen 38 (see FIG. 1) displays the first key frame written in the graphic memory 36.
[0044]
By the way, when drawing a graphic in the graphic memory 36 and drawing the graphic on the display screen 38, it is more likely that the memory area to be drawn is separated from the memory area in which the data being displayed is stored. It is known that it can be reduced. In order to realize this, two methods are usually performed. One is a method in which an area on the general-purpose memory is regarded as a bitmap and a figure is drawn here, and then the data of the drawn area is transferred to the graphic memory at a high speed. The other is a method in which two screens of graphic memory are prepared, a figure is alternately drawn on both of the two screens, and only the screen of the area where the drawing is completed is displayed on the display screen. Here, any method may be used. In order to use either method, it is necessary to carry out specific processing for that purpose, but since these are within the knowledge of those skilled in the art, the details thereof will not be repeated here.
[0045]
In step S3, an initial value 1 is set in the work register i for storing the key frame number. Hereinafter, the value of each register x is referred to as “variable x”. In step S4, the elapsed time from step S1 is stored in the variable t. As shown in FIG. 6, since the processes in steps S2 and S3 are performed after the timer is initialized in step S1, the elapsed time at step S4 is not zero. Actually, among the steps S2 and S3, since the drawing process performed in step S2 is the most complicated process, the processing time of step S2 occupies most of the elapsed time.
[0046]
Thereafter, the estimated elapsed time of the i-th key frame is P _i I will call it. In step S5, it is determined whether or not the elapsed time of the (i + 1) th key frame (the second key frame if i = 1) is equal to or less than the variable t. If i = 1, P _{i + 1} = P ₂ = 1 second (FIG. 5B). If this condition is met, control proceeds to step S6, and if not, control proceeds to step S8. If the process of step S5 is first performed (i = 1), the value of t is 0.3 seconds. This value is compared with the information (= 1 second) of the scheduled elapsed time in the second key frame information 64 shown in FIG. In this case, since the condition is not satisfied, the control proceeds to step S8.
[0047]
In step S8, a value h indicating the position of the frame to be drawn next is calculated by the following equation.
[0048]
[Expression 1]

[0049]
The position indicated by the value h in this case is illustrated in FIG. As shown in FIG. 7, t = 0.3 is between the time when the first key frame is displayed and the time when the second key frame is displayed on the time axis. This corresponds to a 30% position from the time when one key frame is displayed to the time when the second key frame is displayed. Therefore, it is assumed that the value h indicates the positioning of t, and indicates “the positioning of the next intermediate frame to be drawn on the time axis”.
[0050]
Assuming that i = 1 and t = 0.3 as described above, P _i = 0, P _{i + 1} Since = 1, h = 0.3.
[0051]
Subsequently, in step S9, the coordinates of the feature values of each figure of the intermediate frame corresponding to the time point specified by the variable h are calculated as follows. The parameters of all figures in the i-th key frame including these coordinate values _i And the corresponding parameter at the (i + 1) th key frame is Q _{i + 1} Is expressed as parameter Q _i And parameter Q _{i + 1} If the parameter corresponding to is R, R is calculated as follows.
[0052]
[Expression 2]

[0053]
More specifically, the example shown in FIGS. 3 to 5 is as follows.
[0054]
[Table 1]

[0055]
That is, the coordinates of the vertices of the triangle to be drawn in the intermediate frame corresponding to the elapsed time t = 0.3 (seconds), that is, the coordinates 1, 2 and 3 are (2.2, 2) and (3.2), respectively. , 3) and (2.2, 4).
[0056]
In this way all parameters Q _i R is obtained for all the frames, and all the graphics of the intermediate frame are drawn using the value of R (step S10). When all the graphics have been drawn, the process returns to step S4. That is, when all figures of an intermediate frame are drawn, drawing of the next frame is started at that time, and the elapsed time up to that time is obtained in step S4, and the subsequent processing is repeatedly executed.
[0057]
By the way, a certain processing time is required for the graphic drawing performed in step S10. In this example, as shown in FIGS. 4A and 4B, the figure to be drawn is the same triangle 132 in the first key frame and the second key frame. The triangle to be drawn at the time of t = 0.3 is also the same size as the triangle 132 in the initial state (t = 0) shown in FIG. In this case, the drawing amount of the figure at the time of t = 0.3 is not changed from that at the time of t = 0. The time taken to draw this intermediate frame will also be about 0.3 seconds, the same as the value at t = 0. Therefore, the elapsed time t in the second execution of step S4 is t = 0.6.
[0058]
In the above iterative process, when the determination in step S5 is YES, the process proceeds to step S6. In step S6, 1 is added to the variable i. Further, in step S7, it is determined whether i + 1 is larger than the number n of key frames prepared initially using i after addition. If this condition is not satisfied, control proceeds to step S5 and the following processing is repeatedly executed. If the condition of step S7 is satisfied, it means that the scheduled elapsed time of the last key frame has passed, so the process is terminated.
[0059]
In the above example, the drawing amount to be drawn in the intermediate frame does not change. Therefore, the time required for drawing each intermediate frame is 0.3 seconds. N = 3. Therefore, by executing the processing of FIG. 6 in this example, the frame is drawn at the timing shown in FIG. That is, first, the first key frame is drawn at t = 0. Further, at t = 0.3, 0.6, and 0.9, an intermediate frame obtained from the interpolation calculation between the first key frame and the second key frame is drawn. Further, at t = 1.2, 1.5, 1.8, 2.1, and 2.4, the intermediate values obtained by the interpolation calculation between the second key frame and the third key frame A frame is drawn. That is, a total of nine frames are drawn starting from each time point, and expressed as a continuous animation.
[0060]
The locus of the triangle 132 drawn on the screen 130 at this time is shown in FIG. 9 together with the time when each figure is drawn. In FIG. 9, the solid line shows the figure of the key frame, and the broken line shows the figure drawn by the intermediate frame. The example shown in FIG. 9 is characterized by the fact that the first key frame of the key frames is drawn at time t = 0, but other key frames (second and third key frames) are drawn. Is not drawn.
[0061]
Note that each time point every 0.3 seconds from t = 0 to 2.4 shown in FIG. 8 and FIG. 9 indicates the start time of drawing. A time required for drawing each frame is required until the image is actually displayed on the screen, and a delay corresponding to that time is generated.
[0062]
In the above-described example, the case where the size of the triangle displayed by animation does not change and only moves is shown. However, it is also possible to display an animation in which the size of a triangle changes between key frames using the apparatus and program shown so far. In this case, as compared with the case where the size of the triangle does not change as in the above example, the area of the triangle changes, so the drawing amount changes and the time required for drawing the intermediate frame changes. Therefore, even if exactly the same apparatus and program are used, the apparent operation differs from the above example.
[0063]
FIGS. 10A to 10C show three key frames for this animation. As shown in FIG. 10A, a triangle 134 is drawn on the upper left of the screen 130, which is the first key frame. Referring to FIG. 10B, the triangle 134 of the first key frame is enlarged (doubled), and the second key frame is displayed as the triangle 136. Referring to FIG. 10C, the state after the triangle 136 moves from the upper left corner of the screen to the upper right corner of the screen is the third key frame.
[0064]
FIG. 11 shows key frame data 162, 164, and 166 corresponding to the three key frames shown in FIGS. 10 (a) to 10 (c). Referring to FIG. 11, key frame information 162 for the first key frame includes an elapsed time (= 0 second) and first graphic information 174 indicating triangle 134. The type of figure is a closed polygon and the number of points is 3, that is, a triangle. The three vertices of this triangle have the coordinates (1, 2) (2, 3) (1, 4). The pointer 176 of the first graphic information 174 indicates the head of the area of the first graphic information 194 included in the key frame information 164 of the second key frame.
[0065]
The key frame information 164 of the second key frame includes elapsed time (= 1 second) and graphic information 194 corresponding to the triangle 136 in the second key frame. According to the graphic information 194, the type of drawing is a closed polygon, and the number of points is 3, that is, a triangle. The coordinates of the three vertices of the triangle are (1, 1) (3, 3) (1, 5), respectively. The pointer 196 points to the head of the area of the first graphic information 214 of the key frame information 166 for the third key frame.
[0066]
The key frame information 166 for the third key frame includes a scheduled elapsed time (= 2.5 seconds) and graphic information 214 for the first graphic. According to the first graphic information 214, the graphic processing is a closed polygon, and the number of vertices thereof is 3, that is, a triangle. The coordinates of the three vertices of the triangle are (8, 1) (10, 3) (8, 5), respectively. The pointer 216 of the first graphic information 214 indicates that this graphic ends at the third key frame.
[0067]
Referring to FIGS. 10A and 10B, during the time period between them, an animation in which triangle 134 is gradually enlarged and becomes triangle 136 is generated. In this example, assuming that only the outline of a triangle is drawn, when the size of a figure to be drawn is a times, the processing time for drawing the figure is also almost a times. In FIGS. 10A and 10B, only the triangles 134 and 136 are drawn, so the processing time for drawing the second key frame shown in FIG. The processing time for drawing the first key frame shown in FIG. In this example, since a = 2, the processing time of the second key frame is almost twice that of the first key frame. However, as described above, the second key frame is not actually drawn.
[0068]
In the above example, only the outline of the triangle is drawn. However, when the inside of the triangle is filled with a specific color, the area becomes a when the scale is increased by a. ² Therefore, the drawing amount necessary for filling is almost a. ² Doubled. Therefore, the increase rate of the drawing amount is larger than that in the case of drawing only the outer shape as shown in FIGS. 10 (a) and 10 (b).
[0069]
Referring to FIGS. 10B and 10C, an animation in which the enlarged triangle moves in parallel between the second key frame and the third key frame is performed. In this case, since the required drawing amount per frame does not change, the drawing time per frame does not change, and a processing time similar to the processing time of the second key frame is required for each frame.
[0070]
That is, as shown in FIGS. 10A to 10C, when an intermediate frame of animation is generated from a key frame and the animation is reproduced, the drawing start timing of the frame is as shown in FIG. First, drawing of the first key frame is started (t = 0). Assuming that drawing of the first key frame takes 0.3 seconds as in the case of the first example, drawing of the second key frame is started at time t = 0.3. According to the graphic information 174 and 194 shown in FIG. 11, the size of the triangle in the second key frame (corresponding to t = 1) is twice the size of the triangle 134 in the first key frame. is there. In the meantime, if the triangle enlargement is performed linearly, it is necessary to draw a triangle having a size 1.3 times the triangle 134 at the time t = 0.3. In this case, 0.3 × 1.3 = 0.39 (seconds), that is, a processing time of about 0.4 seconds is required. The processing of the intermediate frame that has started drawing processing at the time t = 0.3 ends at the time t = 0.7. Further, the size of the triangle to be drawn at the time corresponding to t = 0.7 is 1.7 times the size of the triangle 134 in FIG. The time required for the drawing is 0.3 × 1.7 = 0.51 (seconds), that is, about 0.5 seconds. Therefore, the drawing of this intermediate frame ends at the time t = 1.2 seconds, and drawing of the next frame is started. At t = 1.2 seconds, the triangle to be drawn is already the size of the triangle 136 shown in FIG. 10B, and the size does not change thereafter. Therefore, the time required for subsequent drawing is constant. This drawing requires 0.3 × 2 = 0.6 seconds. FIG. 12 shows the timing at which drawing of each intermediate frame is started in this way. Thus, as shown in FIG. 12, six frames starting from the time corresponding to t = 0, 0.3, 0.7, 1.2, 1.8, and 2.4 are drawn continuously. It is expressed as an animation.
[0071]
Referring to FIGS. 8 and 12, while the processing time for drawing each frame is constant in the example shown in FIG. 8, they are not constant in the example shown in FIG. However, in any case, it is understood that the animation is reproduced along the scheduled elapsed time information held in each key frame, and the total reproduction time is approximately 2.5 seconds. That is, it can be seen that even if the drawing amount per frame changes, the change does not affect the progress of the entire animation display.
[0072]
According to the same idea, for example, consider a case where the CPU processing capacity is doubled. In the case of the example shown in FIG. 8, if the processing capacity of the CPU is doubled, the drawing start timing of each frame is every 0.15 seconds as shown in FIG. Played. Also, when the example shown in FIG. 10 is reproduced by a CPU having twice the processing capacity, the drawing start timing of each frame is as shown in FIG. In this case, although the time required to draw the intermediate frame gradually increases from the first key frame to the second key frame, the animation can be reproduced with 10 frames as a whole. Referring to FIGS. 8 and 13, it can be seen that the same animation is reproduced along the same time. Moreover, in this case, the number of frames generated during this time is almost doubled, and a smoother animation can be obtained. The same applies when FIG. 12 is compared with FIG. Therefore, no matter what processing power CPU is assumed at the time of animation creation, and what processing power CPU is actually played back at the time of playback, as long as the animation is played back by this method, The animation is reproduced along the same time and with smoothness according to the processing capability of the CPU.
[0073]
As described above, the case where the coordinates of the feature points of the figure are changed is shown as an example. However, when the figure is drawn by changing the contents of the data using the same method, it differs depending on the contents of the data. If the graphic drawing process is performed, the solid line in the case where the color of the graphic, the transparency, the thickness of the line constituting the graphic, and the line constituting the graphic are broken lines are used by using the computer and the program of the first embodiment. The ratio of the part to the blank part, the font size when the figure is a character, the coordinates of the reference point of this figure group when the figure is a figure group consisting of multiple figures, and the display scale of the figure group as well A ratio or the like is designated for each key frame, and an intermediate frame can be obtained by interpolation calculation performed between corresponding information of these key frames.
[0074]
For example, FIG. 15A shows the data structure of graphic information 262 that can be considered when the graphic type is a polygon. FIG. 15B shows an example of the data structure of the graphic information 264 when text consisting of a group of characters is designated as the graphic type. FIG. 15C shows an example of the data structure of the graphic information 266 when a graphic group is designated as the graphic type.
[0075]
Referring to FIG. 15A, when the type of figure is a polygon, the number of points, the number of coordinates corresponding to the number of points, the color to be filled in the figure, the transparency, the figure Are stored, such as data indicating the thickness of the line constituting the line, its line type, and the ratio of the solid line part to the blank part when the line type is a broken line. For example, a color can be expressed by numerical values of red (R), green (G), and blue (B), which are the three primary colors of light. If this (R, G, B) is specified as the attribute information of the figure in two consecutive key frames, the color to be filled in the figure in the intermediate frame by performing interpolation calculation between the corresponding data (R, G, B) can be calculated. The same applies to the transparency, the thickness of the line, and the ratio of the solid line part / blank part when the line type is a broken line.
[0076]
Referring to FIG. 15B, when the type of figure is text, the coordinates for drawing the text (in this case, the coordinates of the reference position of the text), the text content, and the text are displayed. Font type, the number of font points indicating the size of the font to display the text, information specifying the text display color, and the style of the font when displaying the font (standard, italic, gold, etc.) ), Character spacing in the text, line spacing, information indicating line alignment for each line, and the like are stored. In particular, in the case of characters, if there is a point font number as text attribute information in two consecutive key frames, the size of the text characters to be displayed in the intermediate frame by performing interpolation calculation on the value Can be determined. In this case, even if the number of points is a fraction, there is no problem if characters of a size according to the number of points can be displayed, but when only characters of a specific number of points can be displayed, the points obtained by interpolation You may make it display the character of the number of points nearest to the number.
[0077]
Referring to FIG. 15C, when the type of graphic information 266 is a graphic group, this information 266 includes the number of graphics included in the graphic group and the graphic information corresponding to each graphic. The pointer corresponding to the number of figures, the coordinates of the reference point when displaying the entire graphic group, the scale ratio on the display when displaying the graphic group, and the like are stored. The pointer in this case is a pointer to individual graphic information stored as another graphic information in the key frame in which the graphic information 266 of this graphic group is stored. In the case of the example shown in FIG. 15C, the reference point coordinates, the scale ratio on display, and the like can be obtained by interpolation calculation between two adjacent key frames.
[0078]
Next, an apparatus for realizing the animation display method according to Embodiment 2 of the present invention will be described with reference to FIG. In the first embodiment, the feature data corresponding to the graphic information of the intermediate frame is generated by the interpolation calculation by linear calculation between the corresponding feature data among the graphic information corresponding between the two adjacent key frames. In the method of the second embodiment, the feature data obtained by the interpolation calculation in this way is further converted by a predetermined method, and a change that cannot be obtained by the linear calculation is given to the movement of each figure on the time axis. It is characterized by that.
[0079]
FIG. 16 shows a block diagram of a computer 330 for realizing the method of the second embodiment. The computer 330 differs from the computer 30 for realizing the first embodiment shown in FIG. 1 in that program information in which a program different from the program for the first embodiment is stored in the memory 34. The storage unit 344 and the conversion table 346 used when further converting the feature data of the figure once obtained by the interpolation calculation by the linear calculation as described above are included. In other respects, the computer 330 shown in FIG. 16 is the same as the computer 30 shown in FIG. The same parts are given the same reference numerals and names, and their functions are also the same. Therefore, details thereof will not be repeated here.
[0080]
Referring to FIG. 17, conversion table 346 calculates in advance a value h indicating “position of an intermediate frame to be drawn next” described in the first embodiment, and for each value of h, A value k to be taken as an actual change amount at that time is determined in advance, and a pair of h and k is prepared in advance as a table. In the conversion table 346 shown in FIG. 17, k = h with respect to h. ² The relationship is assumed. Note that the conversion table 346 may be created assuming the function relationship as described above with h as k. However, when the conversion table is used, the conversion table 346 is not necessarily based on such a function relationship, and is arbitrarily determined by the animation creator. K can be determined according to the intention, and it is possible to realize a special movement that cannot be obtained by a simple function.
[0081]
Referring to FIG. 27, a plurality of such conversion tables are prepared, and different conversion tables are associated with each other according to the table number added to each graphic information, so that even if there are only two key frames, Each figure can express different movements with respect to the time axis. Here, the table number = 0 represents that the conversion table is not used.
[0082]
Referring to FIG. 28, table number 1 represents an acceleration motion in which the amount of change in k gradually increases, and table number 2 represents a repetitive motion in which the value of k oscillates between 0 and 1. Referring to FIG. 29, it is assumed that the conversion table does not correspond to the picture 1001 of the airplane moving at a constant speed, the table number 1, that is, the acceleration motion is made to correspond to the picture 1002 of the falling apple, and the talking picture 1003 Assuming that table number 2, ie, repetitive motion, is associated, only two key frames, key frame 1 and key frame 2, can simultaneously realize three different types of motion.
[0083]
FIG. 18 shows a control flow of a program stored in the program information storage unit 344 shown in FIG. The flowchart shown in FIG. 18 differs from the flowchart of the program of the first embodiment shown in FIG. 6 in that after step S8, h obtained in step S8 is converted to k with reference to conversion table 346. That is, S11 is included, and step S12 that performs the same processing as step S9 using k instead of h in step S9 of FIG. 6 is inserted. In other respects, FIG. 18 is exactly the same as the flowchart shown in FIG.
[0084]
In this way, the value h obtained by the interpolation calculation by the linear calculation is converted into k using the conversion table 346, and the figure is generated by calculating the corresponding parameter of the intermediate frame using k. When such processing is applied to, for example, a coordinate point of a figure, it becomes possible to express a non-linear movement with respect to the progress of time, such as a movement of a figure with acceleration. Moreover, since the contents of the table 346 can be set freely as described above, there is an advantage that an arbitrary movement can be set with respect to time. When applied to the color of a figure, a special effect that the color changes on the time axis can be produced.
[0085]
As a method of converting h to another value k after calculating h once in this way, h is substituted as a variable of a certain function instead of table conversion, and the value of the function at that time is set to k. Conceivable. For example, k = h ² It is conceivable to obtain k by performing the above operation. Of course, this example is merely an example, and any other function may be used. In this case, the conversion using the above-described function may be performed in step S11 of FIG. In this case, there is an advantage that the amount of data that must be held is smaller than in the case of table conversion.
[0086]
As described above, according to the present invention, in computer animation of a key frame interpolation method in which an intermediate frame is created by interpolating between corresponding parameters of corresponding figures of adjacent key frames, CPU speed and necessary per frame are required. It is possible to make the entire reproduction time constant regardless of the drawing amount. Therefore, the image can be easily reproduced in synchronization with the sound. In addition, since animation can be played with an intermediate number of frames that increases according to the processing capacity of the CPU, and there is no play time in the CPU, data created in the past as the processing capacity of the CPU increases. A smoother animation can be played without modification.
[0087]
The animation display program in the present invention is supplied on a recording medium such as a magnetic tape or a CD-ROM. The animation display program is executed by the computer main body, and the operator performs animation display by operating the keyboard or mouse while looking at the graphic display device. The animation display program may be supplied to the computer main body via a communication modem from another computer via a communication circuit.
[Brief description of the drawings]
FIG. 1 is a block diagram of a computer for realizing the present invention.
FIG. 2 is a diagram schematically showing key frame information.
FIG. 3 is a diagram schematically illustrating an example of an animation.
4 is a diagram showing an image of a key frame required for reproducing the animation shown in FIG.
FIG. 5 is a diagram illustrating key frame information for the key frame shown in FIG. 4;
FIG. 6 is a flowchart of a program for realizing the animation display method in the first embodiment.
FIG. 7 is a diagram schematically illustrating generation timing of an intermediate frame.
FIG. 8 is a diagram schematically showing the drawing start timing of an intermediate frame when the drawing amount is constant.
FIG. 9 is a diagram schematically showing each figure of an intermediate frame when the animation shown in FIG. 3 is reproduced.
FIG. 10 is a diagram illustrating key frames for animation in which a drawing amount of a graphic changes.
11 is a diagram showing key frame information of the animation shown in FIG.
12 is a diagram schematically showing the drawing start timing of each frame of the animation reproduced from the key frame shown in FIG.
FIG. 13 is a diagram schematically showing the drawing start timing of each frame when the animation shown in FIG. 3 is processed by a CPU having high processing capability.
14 is a schematic diagram showing the drawing start timing of each frame when the animation shown in FIG. 10 is processed by a CPU with high processing capability. FIG.
FIG. 15 is a diagram illustrating an example of a configuration of graphic information in which data other than coordinate information such as a color of a graphic is stored.
FIG. 16 is a block diagram of a computer for realizing Embodiment 2 of the present invention.
FIG. 17 is a diagram schematically showing a conversion table.
FIG. 18 is a flowchart of a program for realizing the method of the second embodiment.
FIG. 19 is a diagram schematically showing the principle of a conventional key frame interpolation type animation.
FIG. 20 is a diagram illustrating an example of animation display according to a conventional method.
FIG. 21 is a diagram illustrating a problem with a key frame interpolation type animation according to the prior art.
FIG. 22 is a diagram illustrating a problem with a key frame interpolation type animation according to the prior art.
FIG. 23 is a diagram illustrating a problem with a key frame interpolation animation according to the prior art.
FIG. 24 is a diagram illustrating a problem with a key frame interpolation animation according to the prior art.
FIG. 25 is a diagram illustrating a problem with a key frame interpolation animation according to the prior art.
FIG. 26 is a diagram illustrating a problem with a key frame interpolation type animation according to the prior art.
FIG. 27 is a diagram schematically showing key frame information in the case of having a plurality of conversion tables in Embodiment 2 of the present invention.
FIG. 28 is a diagram illustrating an example of a plurality of conversion tables according to the second embodiment of the present invention.
FIG. 29 is a diagram illustrating an example of an animation key frame using a plurality of conversion tables according to the second embodiment of the present invention;
[Explanation of symbols]
30, 330 computers
32 CPU
34 memory
36 graphics memory
38 display screen
40 timer
62, 64, 66, 162, 164, 166 Key frame information
346 conversion table

Claims (18)

An animation display method for displaying a graphic animation on a display device using a computer program,
A plurality of key frame information, each including information for specifying a display time and graphic information for specifying a feature of a graphic to be displayed in the display frame at the display time, is prepared in the memory. Steps,
Obtaining the current display time;
Selecting at least two pieces of key frame information each having a display time before and after the obtained display time among the plurality of key frame information;
Creating graphic information to be displayed at the obtained display time by performing a predetermined interpolation calculation between corresponding graphic information respectively included in the at least two key frame information;
Based on the created graphic information, displaying a frame at the obtained display time on the display device;
An animation display method including the step of obtaining the current display time, the selecting step, the creating step, and the displaying step until a predetermined time elapses. The plurality of key frame information includes head key frame information regarding a frame to be displayed at the head, and the method further includes a step of displaying the head frame based on the head key frame information at the start of animation display. The step of obtaining the current display time includes a step of referring to a timer in response to completion of drawing processing of one frame and obtaining a value of the timer at that time as the display time. The animation display method described in 1. The animation display method according to claim 1, wherein the graphic information includes coordinate information of feature points of the graphic. The animation display method according to claim 1, wherein the graphic information includes color information of a graphic. The animation display method according to claim 1, wherein the graphic information includes information on a graphic transparency. The animation display method according to claim 1, wherein the graphic information includes information on a thickness of a line constituting the graphic. The animation display method according to claim 1, wherein the graphic information includes information on a ratio of a drawn part to a non-drawn part of a line constituting the graphic. The animation display method according to claim 1, wherein the graphic to be displayed is a character, and the graphic information includes information on a size of a character font. The figure to be displayed is a group of figures including a plurality of figures,
The animation display method according to claim 1, wherein the graphic information includes coordinates of a reference point of a graphic group. The figure to be displayed is a group of figures including a plurality of figures,
The animation display method according to claim 1, wherein the graphic information includes a scale ratio on display of a graphic group. The creating step includes performing interpolation calculation by predetermined linear calculation between corresponding graphic information respectively included in the at least two key frame information;
The animation display method according to claim 1 , further comprising a step of converting graphic information obtained by the interpolation calculation by a predetermined conversion method. Preparing a table for converting the graphic information prior to the start of the animation display;
The animation display method according to claim 11, wherein the converting step includes a step of looking up the converted graphic information corresponding to the graphic information created in the interpolation calculation step from the table. The step of converting includes a step of substituting the graphic information created in the step of performing the interpolation calculation into a variable of a predetermined function, and using the value of the predetermined function as graphic information after conversion. The animation display method described. The step of looking up from the table comprises:
The table for conversion has a number for identification, and the graphic information has a number for associating with the table, and a step of looking up from a table individually associated with each graphic in advance. The animation display method according to claim 12, further comprising: A recording medium recording an animation display program for displaying a graphic animation on a display device using a computer program,
A plurality of key frame information each including information for specifying a display time and graphic information for specifying a feature of a graphic to be displayed in the display frame at the display time is prepared in the memory. Steps,
Obtaining the current display time;
Selecting at least two pieces of key frame information each having a display time before and after the obtained display time among the plurality of key frame information;
Creating graphic information to be displayed at the obtained display time by performing a predetermined interpolation calculation between corresponding graphic information respectively included in the at least two key frame information;
Based on the created graphic information, displaying a frame at the obtained display time on the display device;
A computer recording an animation display program for realizing the step of obtaining the current display time, the selecting step, the creating step, and the displaying step until a predetermined time elapses. A readable recording medium. An animation display method for displaying an animation based on a plurality of key frame information including time information for specifying a time to be displayed and graphic information for specifying a graphic to be displayed,
Obtaining the current display time;
A predetermined interpolation calculation is performed based on the time information and graphic information included in at least two key frames of the plurality of key frames and the acquired current time, and a graphic to be displayed corresponding to the current time is specified. Generating an intermediate frame including graphic information for performing,
A step of displaying the generated intermediate frames, was closed,
The current time, animated wherein the Rukoto retrieved in response to the display of the intermediate frame has been completed. The animation display method according to claim 16, wherein the two key frames are key frames before and after the current time on the time axis, respectively. A computer-readable recording medium recording an animation display program for displaying an animation based on a plurality of key frame information including a display time for specifying a display time and a graphic information for specifying a graphic to be displayed. And
Obtaining the current display time;
A predetermined interpolation calculation is performed based on the time information and graphic information included in at least two key frames of the plurality of key frames and the acquired current time, and a graphic to be displayed corresponding to the current time is specified. Generating an intermediate frame including graphic information for performing,
Displaying the generated intermediate frame, and
The current time, the display of the intermediate frame Ru is acquired in response to is complete, the computer-readable recording medium storing an animation display program.

Images