JP4014540B2 - Graphic arrangement method, graphic arrangement program, and storage medium storing graphic arrangement program - Google Patents

Description

（但し、ξはＡとＢが近い位置にあり、さらにＸとＹが近い位置にあるとき、０に近づき、いずれかが離れていると１に近付く関数、Ｃ_ｊとＷ_ｉはシステムの振る舞いを変更するパラメータ）を用いる。
【０００７】
本発明（請求項２）は、画面上に表示された複数の図形の配置を変更する図形配置プログラムであって、
前記画面上の図形グループと前記配置変えパターンの変更前の配置に含まれる図形グループとが前記画面上の図形グループ内の図形間の中心間の距離と、該図形の傾きと、前記配置変えパターンの変更前の配置に含まれる図形グループ内の前記画面上の図形グループ内の図形と同じ図形の中心間の距離と、該図形の傾きに基づきどれくらい近似しているかを計算するための関数を入力させる関数入力ステップと、
予めユーザから与えられ、記憶手段に記憶されている複数の図形により構成されるグループ（以下図形グループと記す）の変更前の配置と該図形グループの変更後の配置の組である全ての配置変えパターンの変更前の図形グループと前記画面上の図形グループに対して、入力された関数を用いて関数計算を行い、計算結果をメモリに格納する関数計算ステップと、
前記メモリに格納された前記関数計算の結果の値が最も大きな変更パターンを選択するパターン選択ステップと、
選択した配置変えパターンに基づいて、図形グループを変更先に配置を変更する配置変更ステップと、を有し、
前記関数入力ステップにおいて、入力される関数は、２つの図形α、βに対し、図形α、βの中心を（α_ｘ，α_ｙ）、（β_ｘ，β_ｙ）で表し、図形α、βの回転角をα_θ、β_θで表し、
２つの図形α、βの距離を
│αβ│＝√（（α_ｘ−β_ｘ）＊（α_ｘ−β_ｘ）＋（α_ｙ−β_ｙ）＊（α_ｙ−β_ｙ））
とし、αの中心とβの中心がどれくらい回転しているかを表すＳを
Ｓ＝atan（（α_ｙ−β_ｙ）／（α_ｙ−β_ｘ））＊１８０／３．１４１５９２６５４
とし、αからみたβの相対角度を
rdir（α，β）＝α_θ−Ｓ
とし、βからみたαの相対角度を
rdir（β，α）＝β_θ−Ｓ
とし、
αとβの向きの差angle（α，β）をangle（α，β）＝α_θ−β_θとしたとき、
前記配置変えパターンの変更前の図形グループの２つの図形Ａ，Ｂと前記画面上の図形グループの２つの図形Ｘ，Ｙとでどれくらい配置が近いかを
【数４】

（但し、ξはＡとＢが近い位置にあり、さらにＸとＹが近い位置にあるとき、０に近づき、いずれかが離れていると１に近付く関数、Ｃ_ｊとＷ_ｉはシステムの振る舞いを変更するパラメータ）を用いる。
【０００８】
本発明（請求項３）は、請求項２記載のプログラムを格納した記憶媒体である。
【０００９】
上記により、ユーザにより与えられたパターンに従って図形の配置を変更することが可能となる。
【００１０】
また、図形の配置がパターンとして与えられた配置と一致しなくても、図形の配置を変更することが可能となる。
【００１１】
また、図形の配置とパターンで与えられた配置とのずれに応じて、図形の配置を行うことが可能となる。
【００１２】
【発明の実施の形態】
以下、図面と共に本発明の実施の形態を説明する。
【００１３】
図２は、本発明の一実施の形態における配置の近さを計算する例を示す。
【００１４】
ここで用いるオブジェクトは３つの値（横方向のオブジェクトの中心座標Ｘ，縦方向のオブジェクトの中心座標，画面上から時計方向に計測したオブジェクトの回転θ）から構成される。２つのオブジェクトＡ，Ｂの距離を、
│ＡＢ│＝√（（Ａ_ｘ−Ｂ_ｘ）＊（Ａ_ｘ−Ａ_ｘ）＋（Ａ_ｙ−Ｂ_ｙ）＊（Ａ_ｙ−Ｂ_ｙ））
とする。また、Ａの中心とＢの中心がどれくらい回転しているかＳを
Ｓ＝atan（（Ａ_ｙ−Ｂ_ｙ）／（Ａ_ｙ−Ｂ_ｘ））＊１８０／３．１４１５９２６５４
とすると、ＡからみたＢの相対角度ｒｄｉｒ（Ａ，Ｂ）を
rdir（Ａ，Ｂ）＝Ａ_θ−Ｓ
ＢからみたＡの相対角度ｒｄｉｒ（Ｂ，Ａ）を、
rdir（Ｂ，Ａ）＝Ｂ_θ−Ｓ
とする。また、ＡとＢの向きの差angle（Ａ，Ｂ）を
angle（Ａ，Ｂ）＝Ａ_θ−Ｂ_θ
とする。以上の関係は、後述する図２の左側に示されている。
【００１５】
以上の式を用いて、２つのオブジェクトＡ，Ｂが別の２つのオブジェクトＸ，Ｙとで、どれくらい配置が近いかを調べる関数ｒｅｌ２（Ａ，Ｂ，Ｘ，Ｙ）を（１）で定義する。
【００１６】
［数５］

ここで、属性の差δと、重みξは、
【００１７】
［数６］

のように定義される。上記式（１）のδ（Ｘ，Ｙ，Ｗ）は、ＸとＹが近ければ１に近付き、離れるほど０に近付く。ξは、ＡとＢが近い位置にあり、さらにＸとＹが近い位置にあるとき、０に近付き、いずれかが離れていると１に近付くことを意味する。上記において、Ｃ_ｊとＷ_ｉはシステムの振る舞いを変更するパラメータである。
【００１８】
図２に２つの図形Ａ，Ｂと別の２つの図形Ｘ，Ｙの図形の配置の近さを計算する例を示す。
【００１９】
２つの図形のグループ間の図形の対応関係をｍａｐとしたとき、relは、
【００２０】
［数７］

のように定義される。
【００２１】
例えば、図３において、ある図形のグループ{ａ，ｂ，ｃ}と別のグループ{２，３，４}があったとき、それらのグループの対応関係を２＝ｍａｐ（ａ），３＝ｍａｐ（ｂ），４＝ｍａｐ（ｃ）とすると、このグループ間の配置の近さは、
【００２２】
［数８］

のようになる。ここで、ｒｅｌ２は、図形を入れ換えても対象であるため、逆の関係は省略されている。
【００２３】
次に、図形の配置変えのパターンを与えることで、そのパターンに最も近くなるように対象の配置を変更する方法を定義する。配置変えのパターンを図３の上部のように与える。図３では、図形のグループ{ａ，ｂ，ｃ}が配置を変更して{Ａ，Ｂ，Ｃ}のようになることを示している。なお、このような情報は、記憶手段に格納されているものとする。パターンには配置変えの種となる図形(ａ)が矢印で示されている。このパターンを記憶手段から読み込んで、対象の図形のグループ{１，２，３，４，５，６}に対して配置変えを行う。このパターンでは、図形２に対して、配置変えの指示をしたとする。そこで、まず、配置変えの種ａと、２とを対応させる。次に、relが最も大きな値になるように他の図形同士の組み合わせを探す。この例では、図形ｂを３に、ｃを４に対応させたときrelが最大になるので、その組み合わせをｍａｐとする。
【００２４】
パターンの左辺Ｌと右辺Ｒの関係に最も近くなるように、配置変えをする。右辺と対象の新しい配置の図形との対応を９＝gen(A),8=gen(B),7=gen(C)とすると、
【００２５】
［数９］

を最大にするように、ｇｅｎで対応する図形の配置が変更される。
【００２６】
このように、図形の配置を変更する例を複数用意しておき、変更したい対象の図形に対して、用意された全てのパターンでrelを計算し、それぞれの計算結果をメモリ等に一時的に格納しておき、relが最も大きな値になる（即ち、変更したい対象に最も近い配置を持っている）パターンを選ぶ。選ばれたパターンにおいて、Ｇを最大にするように各図形の配置を計算する。なお、この計算には、多変数関数の最大化のための数値計算を用いるものとする。
【００２７】
なお、上記の動作をプログラムとして構築し、図形配置装置として利用されるコンピュータにインストールし、ＣＰＵ等の制御手段に実行させる、または、ネットワークを介して流通させることも可能である。
【００２８】
また、構築されたプログラムを、図形配置装置として利用されるコンピュータに接続されるハードディスク装置や、フレキシブルディスク、ＣＤ−ＲＯＭ等の可搬記憶媒体に格納しておき、本発明を実施する際に、コンピュータにインストールし、実行させることも可能である。
【００２９】
【実施例】
以下、図面と共に本発明の実施例を説明する。
【００３０】
図４は、本発明の一実施例の動作を説明するためのフローチャートである。
【００３１】
以下では、システムの挙動を決めるためのｒｅｌ２の定義、つまり、Ｃ，Ｗ、ξのパラメータを入力する。また、システムを起動する前に、予め複数の並び替えのパターン（Ｐ１，Ｐ２，…，Ｐｎ）を入力する。また、ユーザは、並び替えをさせようと思う図形の配置Ｘを入力する。さらに、メモリには、中間状態として、Ｘに一番近いパターンｍａｘＰとそのときの対応関係ｍａｘＭａｔが格納される。最終的に、以下の動作により得られる図形配置Ｙが出力される。
【００３２】
ステップ１０１） ユーザが図形の配置を変更する複数のパターン（Ｐ１，Ｐ２，Ｐ３，…Ｐｎ）を用意し、これを記憶手段に格納しておく。なお、パターンＰは、左側の図形群Ｌ（Ｐ）と右側の図形群Ｒ（Ｐ）から構成されるものとする。
【００３３】
ステップ１０２） ユーザが特定の図形の配置Ｘに対して、パターンに従った配置変更の指令を入力する。
【００３４】
ステップ１０３） システムは、配置Ｘと記憶手段に格納されている各パターンＰ∈{Ｐ１，Ｐ２，Ｐ３，…}の左側の図形群Ｌ(Ｐ)との配置の近さを、前述の式（３）により、ｒｅｌ（Ｐ，ｍａｐ）により計算し、メモリに記憶する。このとき、メモリ内の計算値から、配置Ｘに含まれる図形ｘ∈ＸとパターンＰに含まれるｐ∈Ｐの対応関係ｘ＝ｍａｐ（ｐ）の中で、ｒｅｌ（Ｐ，ｍａｐ）が最も大きくなる対応関係を選択する。
【００３５】
つまり、メモリに格納される値は、これまでに計算したパターンと配置の対応関係で配置の近さが最大になるもの
ｍａｘＰ：配置の近さが最大となるパターン；
ｍａｘＭａｐ：配置の近さが最大になる配置の対応関係；
ｍａｘＲｅｌ：ｍａｘＰとｍａｘＭａｐのとき配置の近さ；
全てのパターンと配置の対応関係で配置の近さｒｅｌを計算するが、その最大値を求めるときにこれらのメモリ内の変数を更新しながら行う。
【００３６】
ステップ１０４） 記憶手段に格納されている全てのパターンに対して上記のステップ１０３の計算が終了すればステップ１０５に移行し、終了していない場合は、ステップ１０３に移行する。
【００３７】
ステップ１０５） 配置の近さＭａｘＲｅｌが最大となるｍａｘＰとｍａｘＭａｐを選択する。
【００３８】
ステップ１０６） 選択されたｍａｘＰとｍａｘＭａｐを用いて、新たに生成する図形群Ｙの各図形ｙ∈Ｙを、ｙ＝ｇｅｎ（ｒ）、ｒ∈Ｒ（ｍａｘＰ）とすると、前述の式（５）により、Ｇ（Ｌ（ｍａｘＰ），Ｒ（ｍａｘＰ），ｍａｘＭａｐ，ｇｅｎ）を最大にするように生成する各図形ｙ∈Ｙの配置を決める。このとき、ｙの初期配置を適当に決めて、数値計算によって各ｙの配置を求める。
【００３９】
以下に、上記の動作を適用した場合の例を説明する。
【００４０】
図５は、本発明の一実施例の図形配置の例であり、図形の配置をどのように変更するかを実際の図形の並びの例で示したものである。左側の図の並びを右側の図の並びのように配置変えする。ここでは、２つの図形（太陽と棒と星の棒）があった場合、棒の根本を寄せるように配置を変更する、という例である。この配置変えの例を用いて、実際の図形の対象の配置を変更させると図６のようになる。
【００４１】
具体的には、図５のルールの具体的な値を、
左側太陽オブジェクトＬ１［−５０，０，０］（Ｘ座標−５０，Ｙ座標０、回転０度）
左側星オブジェクトＬ２［５０，０，０］
右側太陽オブジェクトＲ１［−５０，０，−３０］
右側星オブジェクトＲ２［５０，０，３０］
とする。
【００４２】
図６のＡの配置が、
太陽Ａ［３００，２００，０］
星Ａ２［４００，２００，０］
であるとき、これによって新しい配置Ａ３，Ａ４は、
Ａ１＝ｍａｐ（Ｌ１），Ａ２＝ｍａｐ（Ｌ２），
Ａ３＝ｇｅｎ（Ｒ１），Ａ４＝ｇｅｎ（Ｒ２）
とすると、
Ｇ（｛Ｌ１，Ｌ２｝、｛Ｒ１，Ｒ２｝，ｍａｐ，ｇｅｎ）
＝Ｗ（Ｌ１，Ｒ１）ｒｅｌ２（Ｌ１，Ｒ１，Ａ１，Ａ３）
＋Ｗ（Ｌ１，Ｒ２）ｒｅｌ２（Ｌ１，Ｒ２，Ａ１，Ａ４）
＋Ｗ（Ｌ２，Ｒ１）ｒｅｌ２（Ｌ２，Ｒ１，Ａ２，Ａ３）
＋Ｗ（Ｌ２，Ｒ２）ｒｅｌ２（Ｌ２，Ｒ２，Ａ２，Ａ４）
＋Ｗ（Ｒ１，Ｒ２）ｒｅｌ２（Ｒ１，Ｒ２，Ａ３，Ａ４）
となる。
【００４３】
ここで、具体的な値を入れると、
Ａ３＝［Ｘ３，Ｙ３，θ３］
Ａ４＝［Ｘ４，Ｙ４，θ４］
とするとき、
ｆ（Ｘ３，Ｙ３，θ３，Ｘ４，Ｙ４，θ４）
＝Ｗ（Ｌ１，Ｒ１）ｒｅｌ２（Ｌ１，Ｒ１，Ａ１，Ａ３）
＋Ｗ（Ｌ１，Ｒ２）ｒｅｌ２（Ｌ１，Ｒ２，Ａ１，Ａ４）
＋Ｗ（Ｌ２，Ｒ１）ｒｅｌ２（Ｌ２，Ｒ１，Ａ２，Ａ３）
＋Ｗ（Ｌ２，Ｒ２）ｒｅｌ２（Ｌ２，Ｒ２，Ａ２，Ａ４）
＋Ｗ（Ｒ１，Ｒ２）ｒｅｌ２（Ｒ１，Ｒ２，Ａ３，Ａ４）
ｗｈｅｒｅ Ｌ１＝［−５０，０，０］
Ｌ２＝［−５０，０，０］
Ｒ１＝［−５０，０，−３０］
Ｒ２＝［５０，０，３０］
Ａ１＝［３００，２００，０］
Ａ２＝［４００，２００，０］
を最大にするＸ３，Ｙ３，θ３，Ｘ４，Ｙ４，θ４を求め、その値を用いて、新しい図の配置を決める。
【００４４】
同様に、図６Ｂ，図６Ｃに関しても、Ａ１，Ａ２の値をそれぞれ入れ替えることによって上記の計算を行う。
【００４５】
上記のような計算の結果、以下に示すような配置変えを行うことができる。
【００４６】
図６のＡは、図５の左側と殆ど同じ配置をしているので、配置変えの結果も同じような配列になっている（２つの棒の根本が近付いている）。図６のＢは、星の図形が少し下に配置されている。そのため、配置変えを行うと、それぞれの棒の根本が近付くだけでなく、星の位置も少し下になるように配置される。図６のＣは、もともとの並びが根本が開いたような配置になっているので、その結果も根本が完全に近付くのではなく、元の開き具合に応じた閉じ方をしている。
【００４７】
このように、与えた配置変えのパターンに完全に一致していなくても、そのずれ具合に応じた配置変えをする。
【００４８】
図７、図８は、それぞれ、図形の配置を変更する例である。図９は、それらを実際の対象に対して配置変えさせたときの動作を示している。図９に対して、図７を用いて図形の配置を変更しようとすると、車はハンドルと同じ向きに変わる。この配置の変更を連続して行うと、車は図９のＡで示される経路に従って移動するように見える。この理由は、まず、車とハンドルの向きが違っている場合には、図７の右上のパターンに一番近い配置であるので、車の向きをハンドルと同じ方向に回転させようとする。その後、車とハンドルは同じ向きになるので、図７の左上のパターンに近い配置となり、車は前に進んだようなアニメーションとなる。
【００４９】
一方、図８のパターンを用いて図９の配置を変更しようとすると、図９の図形の配置では、車とハンドルの関係よりも、ハンドルと運転台との関係を重視するので、常に図８の右側のパターンが一番近くなる。そのため、連続して配置の変更を行うと、図９のＢに沿って車が移動するようになる。
【００５０】
なお、本発明は、上記の実施の形態及び実施例に限定されることなく、特許請求の範囲内において、種々変更・応用が可能である。
【００５１】
【発明の効果】
上述のように、本発明によれば、変更パターンとの近似の度合い（ずれ）に応じて図形の配置を変更することが可能となるため、図形の配置の変更方法を厳密に定義しなくてもよい。
【図面の簡単な説明】
【図１】本発明の原理を説明するための図である。
【図２】本発明の一実施の形態における配置の近さを計算する例を示す図である。
【図３】本発明の一実施の形態における配置変えの例である。
【図４】本発明の一実施例の動作を説明するための図である。
【図５】本発明の一実施例の図形の配置の例である。
【図６】本発明の一実施例の図形の対象配置を変更させる例である。
【図７】本発明の一実施例の図形の配置の変更の例（その１)である。
【図８】本発明の一実施例の図形配置の変更の例（その２）である。
【図９】本発明の一実施例の実際の対象に対して配置変えさせた時の動作を示す図である。[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a graphic arrangement method, a graphic arrangement program, and a storage medium storing the graphic arrangement program, and in particular, a graphic arrangement method for changing the arrangement of a plurality of figures displayed on a drawing in a graphic editor or the like. The present invention relates to a graphic arrangement program and a storage medium storing the graphic arrangement program.
[0002]
[Prior art]
Conventionally, in order to change the arrangement of a figure using a figure editor or the like, an alignment method such as a power point alignment function provided in advance in the system (for example, align the right side of a figure with a vertical line) ( for example, Microsoft PowerPoint 2000) You can use the official manual, pp.319-320 , August 16, 1999 ISBN4-89100-104-6 ) , or you can define the program exactly and make changes accordingly.
[0003]
[Problems to be solved by the invention]
However, the conventional alignment method such as the power point alignment function has a problem that it is difficult to perform unprepared alignment and lacks expandability. In addition, the method of changing the arrangement based on the definition of the program can be changed in various ways, but it requires a strict definition of the program and is not easy.
[0004]
The present invention has been made in view of the above points, and it is possible to change the arrangement of the figures according to the general instructions without changing the arrangement of the figures accurately, and to change the arrangement of the figures. It is an object of the present invention to provide a graphic arrangement method, a graphic arrangement program, and a storage medium storing the graphic arrangement program capable of obtaining an animation by being continuously performed.
[0005]
[Means for Solving the Problems]
FIG. 1 is a diagram for explaining the principle of the present invention.
[0006]
The present invention (Claim 1) is a graphic layout method for changing the layout of a plurality of graphics displayed on a screen.
An arrangement change pattern which is a set of an arrangement before changing a group composed of a plurality of figures given by the user (hereinafter referred to as a figure group) and an arrangement after the change of the figure group is stored in the storage means ( Step 1),
The figure group on the screen and the figure group included in the arrangement before the change of the change pattern are the distance between the centers in the figure group on the screen, the inclination of the figure, and the change pattern before the change of the change pattern. the distance between the centers of FIG type and same shapes in graphic group on the screen in the graphic group contained in the arrangement, whether the approximate much based on the inclination of the figure type, enter the function to compute (step 2),
The function calculation is performed on the graphic group before the change of the rearrangement pattern stored in the storage means and the graphic group on the screen using the input function, and the calculation result is stored in the memory (step 3). ),
A change pattern having the largest function calculation result value stored in the memory is selected (step 4), and the graphic group is changed to the change destination based on the selected arrangement change pattern (step 5).
For the two figures α and β , the function defines the center of the figures α and β as (α _x ,
α _y ), (β _x , β _y ), and the rotation angles of the figures α, β are represented by α _θ , β _θ ,
The distance between the two figures α and β is expressed as | αβ | = √ ((α _x −β _x ) * (α _x −β _x ) + (α _y −β _y ) * (α _y −β _y ))
S = atan ((α _y −β _y ) / (α _y −β _x )) * 180 / 3.1415926544, which represents how much the center of α and the center of β rotate.
And the relative angle of β as seen from α
rdir (α, β) = α _θ −S
And the relative angle of α viewed from β
rdir (β, α) = β _θ −S
age,
When the difference angle (α, β) between α and β is angle (α, β) = α _θ −β _θ ,
Equation 3] how much disposed closer in the two figures A before the change graphic group arrangement changing pattern, B and two figures shaped X graphic group on the screen, and Y

(However , ξ is a function that approaches 0 when A and B are close to each other, and X and Y are close, and approaches 1 when either is apart, and C _j and _Wi are system behaviors. there use the parameters to be changed).
[0007]
The present invention (Claim 2 ) is a figure arrangement program for changing the arrangement of a plurality of figures displayed on a screen,
The figure group on the screen and the figure group included in the arrangement before the change of the arrangement change pattern are the distance between the centers of the figures in the figure group on the screen, the inclination of the figure, and the arrangement change pattern. the distance between the centers of the FIG type and same shapes in graphic group on the screen in the graphic group contained in the pre-change arrangement, a function for calculating whether the approximated much based on the inclination of the figure type A function input step to be input;
All rearrangements that are combinations of the arrangement before the change of the group (hereinafter referred to as a graphic group) composed of a plurality of figures previously given by the user and stored in the storage means and the arrangement after the change of the graphic group A function calculation step for performing a function calculation using the input function for the figure group before the pattern change and the figure group on the screen, and storing the calculation result in a memory;
A pattern selection step of selecting a change pattern having the largest value of the result of the function calculation stored in the memory;
An arrangement changing step for changing the arrangement of the graphic group to the change destination based on the selected arrangement changing pattern ,
In the function input step, for the two figures α and β , the input function represents the centers of the figures α and β by (α _x , α _y ) and (β _x , β _y ), and the figures α and β _Is expressed by α _θ and β _θ ,
The distance between the two figures α and β is expressed as | αβ | = √ ((α _x −β _x ) * (α _x −β _x ) + (α _y −β _y ) * (α _y −β _y ))
S = atan ((α _y −β _y ) / (α _y −β _x )) * 180 / 3.1415926544, which represents how much the center of α and the center of β rotate.
And the relative angle of β as seen from α
rdir (α, β) = α _θ −S
And the relative angle of α viewed from β
rdir (β, α) = β _θ −S
age,
When the difference angle (α, β) between α and β is angle (α, β) = α _θ −β _θ ,
Equation 4] how much arranged close in two figures A graphic group before the change before Symbol arrangement changing pattern, and B 2 single figure shaped X graphic group on the screen, and Y

(However , ξ is a function that approaches 0 when A and B are close to each other, and X and Y are close, and approaches 1 when either is apart, and C _j and _Wi are system behaviors. there use the parameters to be changed).
[0008]
The present invention (claim 3) is a storage medium storing Claim 2 Symbol placement program.
[0009]
As described above, the arrangement of the figures can be changed according to the pattern given by the user.
[0010]
Further, even if the graphic layout does not match the layout given as a pattern, the graphic layout can be changed.
[0011]
In addition, it is possible to perform graphic arrangement in accordance with the deviation between the graphic arrangement and the arrangement given by the pattern.
[0012]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[0013]
FIG. 2 shows an example of calculating the closeness of arrangement according to an embodiment of the present invention.
[0014]
The object used here is composed of three values (the center coordinate X of the object in the horizontal direction, the center coordinate of the object in the vertical direction , and the rotation θ of the object measured clockwise from the screen). The distance between two objects A and B
_{│AB│ = √ ((A x -B} x) * (A x -A x) + (A y -B y) * (A y -B y))
And In addition, how much the center of A and the center of B is rotating is set to S = atan ((A _y −B _y ) / (A _y −B _x )) * 180 / 3.1415192654
Then, the relative angle rdir (A, B) of B seen from A is
rdir (A, B) = A _θ −S
The relative angle rdir (B, A) of A viewed from B is
rdir (B, A) = B _θ −S
And Also, the difference angle (A, B) between A and B
angle (A, B) = A _θ −B _θ
And The above relationship is shown on the left side of FIG.
[0015]
Using the above formula, a function rel2 (A, B, X, Y) for determining how close the two objects A and B are to the other two objects X and Y is defined by (1). .
[0016]
[Formula 5 ]

Here, the attribute difference δ and the weight ξ are
[0017]
[Equation 6 ]

Is defined as follows. Δ (X, Y, W) in the above formula (1) approaches 1 when X and Y are close to each other, and approaches 0 when they are apart. ξ means that when A and B are close to each other, and X and Y are close to each other, it approaches 0, and when any of them is separated, it approaches 1. In the above, C _j and W _i are parameters that change the behavior of the system.
[0018]
FIG. 2 shows an example of calculating the closeness of the arrangement of two figures A and B and another two figures X and Y.
[0019]
When the map correspondence between two groups of figures is map, rel is
[0020]
[Equation 7 ]

Is defined as follows.
[0021]
For example, in FIG. 3, when there is a group of graphics {a, b, c} and another group {2, 3, 4}, the correspondence between these groups is expressed as 2 = map (a), 3 = map. If (b), 4 = map (c), the closeness of arrangement between the groups is
[0022]
[Equation 8 ]

become that way. Here, since rel2 is a target even if a figure is replaced, the reverse relationship is omitted.
[0023]
Next, a method for changing the arrangement of the target so as to be closest to the pattern by defining a pattern for changing the arrangement of the figure is defined. A pattern of rearrangement is given as shown in the upper part of FIG. FIG. 3 shows that the figure group {a, b, c} changes its arrangement to become {A, B, C}. It is assumed that such information is stored in the storage means. In the pattern, a figure (a) as a seed for changing the arrangement is indicated by an arrow. This pattern is read from the storage means and rearranged for the target graphic group {1, 2, 3, 4, 5, 6}. In this pattern, it is assumed that an instruction to change the arrangement is given to the graphic 2. Therefore, first, the rearrangement seed a is associated with 2. Next, the combination of other figures is searched so that rel becomes the largest value. In this example, when the figure b is set to 3 and c is set to 4, rel is maximized, and the combination is set to map.
[0024]
The arrangement is changed so as to be closest to the relationship between the left side L and the right side R of the pattern. If the correspondence between the right-hand side and the target figure is 9 = gen (A), 8 = gen (B), 7 = gen (C),
[0025]
[Equation 9 ]

The layout of the corresponding figure is changed with gen so as to maximize.
[0026]
In this way, prepare multiple examples to change the layout of figures, calculate rel with all the prepared patterns for the figure you want to change, and temporarily store each calculation result in memory etc. Store the pattern, and select the pattern in which rel is the largest value (that is, the layout closest to the object to be changed). In the selected pattern, the arrangement of each figure is calculated so as to maximize G. In this calculation, a numerical calculation for maximizing a multivariable function is used.
[0027]
It is also possible to construct the above operation as a program, install it in a computer used as a graphic layout apparatus, and execute it by a control means such as a CPU, or distribute it via a network.
[0028]
Further, when the constructed program is stored in a hard disk device connected to a computer used as a graphic arrangement device, a portable disk such as a flexible disk or a CD-ROM, and the present invention is carried out, It can also be installed and executed on a computer.
[0029]
【Example】
Embodiments of the present invention will be described below with reference to the drawings.
[0030]
FIG. 4 is a flowchart for explaining the operation of the embodiment of the present invention.
[0031]
In the following, the definition of rel2 for determining the behavior of the system, that is, parameters of C, W, and ξ are input. Further, before starting the system, a plurality of rearrangement patterns (P1, P2,..., Pn) are input in advance. In addition, the user inputs an arrangement X of figures to be rearranged. Furthermore, the memory stores a pattern maxP closest to X and the corresponding relationship maxMat as an intermediate state. Finally, a graphic layout Y obtained by the following operation is output.
[0032]
Step 101) The user prepares a plurality of patterns (P1, P2, P3,... Pn) for changing the arrangement of the figure and stores them in the storage means. The pattern P is composed of a left figure group L (P) and a right figure group R (P).
[0033]
Step 102) The user inputs an arrangement change command according to the pattern for the arrangement X of the specific figure.
[0034]
Step 103) The system calculates the closeness of the arrangement X to the left graphic group L (P) of each pattern Pε {P1, P2, P3,. According to 3), it is calculated by rel (P, map) and stored in the memory. At this time, rel (P, map) is the largest among the correspondences x = map (p) between the figure x∈X included in the arrangement X and p∈P included in the pattern P from the calculated values in the memory. Select the corresponding relationship.
[0035]
In other words, the value stored in the memory is the one that has the maximum arrangement proximity in the correspondence relationship between the pattern calculated so far and the arrangement maxP: the pattern that has the maximum arrangement proximity;
maxMap: Correspondence of the arrangement with the maximum arrangement proximity;
maxRel: closeness of arrangement when maxP and maxMap;
The closeness rel of the arrangement is calculated based on the correspondence relationship between all the patterns and the arrangement. When obtaining the maximum value, the variables in the memory are updated.
[0036]
Step 104) If the calculation in step 103 is completed for all patterns stored in the storage means, the process proceeds to step 105. If not, the process proceeds to step 103.
[0037]
Step 105) Select maxP and maxMap that maximize the placement MaxRel.
[0038]
Step 106) Using the selected maxP and maxMap, if each figure y∈Y of the figure group Y to be newly generated is y = gen (r) and r∈R (maxP), the above-described formula (5) Thus, the arrangement of each figure yεY to be generated is determined so as to maximize G (L (maxP), R (maxP), maxMap, gen). At this time, the initial arrangement of y is appropriately determined, and the arrangement of each y is obtained by numerical calculation.
[0039]
Hereinafter, an example in which the above operation is applied will be described.
[0040]
FIG. 5 is an example of a graphic layout according to an embodiment of the present invention, and shows how to change the graphic layout using an example of an actual graphic arrangement. Change the arrangement of the left figure to the same arrangement as the right figure. In this example, when there are two figures (sun, stick, and star stick), the arrangement is changed so as to bring the root of the stick closer. Using this example of changing the layout, the actual layout of the target object is changed as shown in FIG.
[0041]
Specifically, the specific value of the rule in FIG.
Left sun object L1 [-50, 0, 0] (X coordinate -50, Y coordinate 0, rotation 0 degree)
Left star object L2 [50, 0, 0]
Right sun object R1 [-50, 0, -30]
Right star object R2 [50, 0, 30]
And
[0042]
The arrangement of A in FIG.
Taiyo A [300, 200, 0]
Star A2 [400, 200, 0]
Thus, the new arrangements A3 and A4 are
A1 = map (L1), A2 = map (L2),
A3 = gen (R1), A4 = gen (R2)
Then,
G ({L1, L2}, {R1, R2}, map, gen)
= W (L1, R1) rel2 (L1, R1, A1, A3)
+ W (L1, R2) rel2 (L1, R2, A1, A4)
+ W (L2, R1) rel2 (L2, R1, A2, A3)
+ W (L2, R2) rel2 (L2, R2, A2, A4)
+ W (R1, R2) rel2 (R1, R2, A3, A4)
It becomes.
[0043]
Here, if you enter a specific value,
A3 = [X3, Y3, θ3]
A4 = [X4, Y4, θ4]
And when
f (X3, Y3, θ3, X4, Y4, θ4)
= W (L1, R1) rel2 (L1, R1, A1, A3)
+ W (L1, R2) rel2 (L1, R2, A1, A4)
+ W (L2, R1) rel2 (L2, R1, A2, A3)
+ W (L2, R2) rel2 (L2, R2, A2, A4)
+ W (R1, R2) rel2 (R1, R2, A3, A4)
where L1 = [− 50, 0, 0]
L2 = [− 50, 0, 0]
R1 = [− 50, 0, −30]
R2 = [50, 0, 30]
A1 = [300, 200, 0]
A2 = [400, 200, 0]
X3, Y3, [theta] 3, X4, Y4, [theta] 4 that maximize the value of X is obtained, and the value is used to determine the layout of the new figure.
[0044]
Similarly, regarding FIGS. 6B and 6C, the above calculation is performed by replacing the values of A1 and A2.
[0045]
As a result of the calculation as described above, the following rearrangement can be performed.
[0046]
6A has almost the same arrangement as the left side of FIG. 5, so the result of the arrangement change is the same (the two rods are close to each other). In FIG. 6B, the star figure is arranged slightly below. Therefore, when the arrangement is changed, not only the roots of the respective bars approach, but also the stars are arranged slightly below. In FIG. 6C, the original arrangement is such that the roots are opened, so that the results are not completely close to each other, but are closed according to the original degree of opening.
[0047]
As described above, even if the pattern does not completely match the given pattern for changing the arrangement, the arrangement is changed according to the degree of deviation.
[0048]
7 and 8 are examples of changing the arrangement of figures. FIG. 9 shows an operation when they are rearranged with respect to an actual object. In contrast to FIG. 9, when attempting to change the layout of the figure using FIG. 7, the car changes in the same direction as the steering wheel. If this arrangement change is made continuously, the car appears to move along the route indicated by A in FIG. The reason for this is that when the direction of the car and the handle are different, the arrangement is closest to the upper right pattern in FIG. 7, so the direction of the car is rotated in the same direction as the handle. After that, the car and the steering wheel are in the same direction, so the arrangement is close to the upper left pattern in FIG.
[0049]
On the other hand, when trying to change the arrangement of FIG. 9 using the pattern of FIG. 8, in the graphic arrangement of FIG. 9, the relationship between the steering wheel and the cab is emphasized rather than the relationship between the car and the steering wheel. The pattern on the right side of is closest. Therefore, if the arrangement is continuously changed, the vehicle moves along B in FIG.
[0050]
The present invention is not limited to the above-described embodiments and examples, and various modifications and applications are possible within the scope of the claims.
[0051]
【The invention's effect】
As described above, according to the present invention, it is possible to change the arrangement of the figure according to the degree of approximation (deviation) with the change pattern. Also good.
[Brief description of the drawings]
FIG. 1 is a diagram for explaining the principle of the present invention.
FIG. 2 is a diagram illustrating an example of calculating the closeness of arrangement according to an embodiment of the present invention.
FIG. 3 is an example of arrangement change in one embodiment of the present invention.
FIG. 4 is a diagram for explaining the operation of an embodiment of the present invention.
FIG. 5 is an example of an arrangement of figures according to an embodiment of the present invention.
FIG. 6 is an example of changing the target arrangement of a graphic according to an embodiment of the present invention.
FIG. 7 is an example (part 1) of changing the arrangement of a graphic according to an embodiment of the present invention;
FIG. 8 is an example (part 2) of a change in the graphic layout according to the embodiment of the present invention;
FIG. 9 is a diagram illustrating an operation when an arrangement is changed with respect to an actual target according to an embodiment of the present invention.

Claims (3)

In the graphic layout method for changing the layout of multiple graphics displayed on the screen,
A storage unit stores a rearrangement pattern that is a set of an arrangement before changing a group composed of a plurality of figures given by a user (hereinafter referred to as a figure group) and an arrangement after the change of the figure group,
The figure group on the screen and the figure group included in the arrangement before the change of the arrangement change pattern are the distance between the centers of the figures in the figure group on the screen, the inclination of the figure, and the arrangement change pattern. A function for calculating the approximate distance based on the distance between the center of the same figure as the figure in the figure group on the screen in the figure group included in the arrangement before the change and the inclination of the figure. Input,
Perform a function calculation using the input function for the graphic group on the screen and the graphic group before the change of all the rearrangement patterns stored in the storage means, and store the calculation result in the memory.
Select the change pattern with the largest value of the result of the function calculation stored in the memory,
Based on the selected relocation pattern, change the arrangement to the destination of the graphic group,
The function is
For the two figures α, β, the centers of the figures α, β are represented by (α _x , α _y ), (β _x , β _y ), the rotation angles of the figures α, β are represented by α _θ , β _θ ,
The distance between the two figures α and β is expressed as | αβ | = √ ((α _x −β _x ) * (α _x −β _x ) + (α _y −β _y ) * (α _y −β _y ))
S = atan ((α _y −β _y ) / (α _y −β _x )) * 180 / 3.1415926544, which represents how much the center of α and the center of β rotate.
And the relative angle of β as seen from α
rdir (α, β) = α _θ −S
And the relative angle of α viewed from β
rdir (β, α) = β _θ −S
age,
When the difference angle (α, β) between α and β is angle (α, β) = α _θ −β _θ ,
Calculates how much arranged close in the two figures shaped X, Y of the two shapes A, B and graphic group on the screen of the arrangement changing pattern before the change graphic group

(However , ξ is a function that approaches 0 when A and B are close to each other, and X and Y are close, and approaches 1 when either is apart, and C _j and _Wi are system behaviors. FIG shaped arrangement how to characterized by using the parameters to be changed). A figure placement program for changing the placement of a plurality of figures displayed on a screen,
The figure group on the screen and the figure group included in the arrangement before the change of the arrangement change pattern are the distance between the centers of the figures in the figure group on the screen, the inclination of the figure, and the arrangement change pattern. Enter the function to calculate the approximate distance based on the distance between the center of the same figure as the figure in the figure group on the screen in the figure group included in the layout before the change and the inclination of the figure A function input step
All rearrangements that are combinations of the arrangement before the change of the group (hereinafter referred to as a graphic group) composed of a plurality of figures previously given by the user and stored in the storage means and the arrangement after the change of the graphic group A function calculation step for performing a function calculation using the input function for the figure group before the pattern change and the figure group on the screen, and storing the calculation result in a memory;
A pattern selection step of selecting a change pattern having the largest value of the result of the function calculation stored in the memory;
An arrangement changing step for changing the arrangement of the graphic group to the change destination based on the selected arrangement changing pattern,
In the function input step, for the two figures α and β, the input function represents the centers of the figures α and β by (α _x , α _y ) and (β _x , β _y ). The rotation angle is expressed by α _θ and β _θ ,
The distance between the two figures α and β is expressed as | αβ | = √ ((α _x −β _x ) * (α _x −β _x ) + (α _y −β _y ) * (α _y −β _y ))
S = atan ((α _y −β _y ) / (α _y −β _x )) * 180 / 3.1415926544, which represents how much the center of α and the center of β rotate.
And the relative angle of β as seen from α
rdir (α, β) = α _θ −S
And the relative angle of α viewed from β
rdir (β, α) = β _θ −S
age,
When the difference angle (α, β) between α and β is angle (α, β) = α _θ −β _θ ,
Two shapes A of the arrangement changing pattern before the change graphic group, B and two figures shaped X graphic group on the screen, how much disposed closer in the Y

(However , ξ is a function that approaches 0 when A and B are close to each other, and X and Y are close, and approaches 1 when either is apart, and C _j and _Wi are system behaviors. using the parameter to be changed), graphic placement program for causing a computer to execute A storage medium storing a graphic layout program, wherein the program according to claim 2 is stored.

Images