JPH04322370A - Network structure display device - Google Patents

Network structure display device

Info

Publication number
JPH04322370A
JPH04322370A JP3091950A JP9195091A JPH04322370A JP H04322370 A JPH04322370 A JP H04322370A JP 3091950 A JP3091950 A JP 3091950A JP 9195091 A JP9195091 A JP 9195091A JP H04322370 A JPH04322370 A JP H04322370A
Authority
JP
Japan
Prior art keywords
node
network structure
nodes
display device
relations
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP3091950A
Other languages
Japanese (ja)
Inventor
Miharu Kuboi
久保井 ミハル
Naoki Tamura
直樹 田村
Takeshi Nakajima
毅 中島
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Mitsubishi Electric Corp
Original Assignee
Mitsubishi Electric Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mitsubishi Electric Corp filed Critical Mitsubishi Electric Corp
Priority to JP3091950A priority Critical patent/JPH04322370A/en
Publication of JPH04322370A publication Critical patent/JPH04322370A/en
Pending legal-status Critical Current

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

PURPOSE:To recognize the depth of relations between nodes at sight by graphically displaying degrees of relations of a noticed node to the other nodes by size relations of nodes to make them conspicuous. CONSTITUTION:A network structure is stored in a network structure information storage device 1, and the noticed node is selected by a node selecting device 2. Degrees of relations of the noticed node to the other nodes are calculated by an inter-node relation degree calculating device 3, and the network structure is displayed on a display device 4. That is, the noticed node is selected from the normal network structure display with an arbitrary device by the node selecting device 2. Degrees of relations of the node to the other nodes are calculated by the inter-code relation degree calculating device 3, and the network structure where scales of nodes are changed is displayed on the display device. When another node should be notice, it is selected with the arbitrary device by the node selecting device 2 in the same manner. This operation is repeated till selection of END.

Description

【発明の詳細な説明】[Detailed description of the invention]

【0001】0001

【産業上の利用分野】本発明は、網構造を有するデータ
の1表示装置に関するものである。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a display device for data having a network structure.

【0002】0002

【従来の技術】図2に示すのは、米国Hewlett 
 Packard社のTeamworkで用いている網
構造表示装置である。網構造は、節(円形あるいは矩形
にて表現)と節間の関係を表す接続線(直線、あるいは
曲線にて表現)から成る。
[Prior Art] Fig. 2 shows the US Hewlett
This is a network structure display device used in Packard's Teamwork. The network structure consists of nodes (represented by circles or rectangles) and connecting lines (represented by straight lines or curved lines) representing the relationships between the nodes.

【0003】0003

【発明が解決しようとする課題】従来の網構造表示装置
では、複数の節が同じ大きさで表示されていた。このた
め節と接続線の数が多く網構造が複雑な場合、各節の間
の関係の深さを一目で見てとることは難しいという問題
があった。
[Problems to be Solved by the Invention] In conventional network structure display devices, a plurality of nodes are displayed in the same size. For this reason, when the network structure is complex with a large number of nodes and connecting lines, there is a problem in that it is difficult to see at a glance the depth of the relationship between each node.

【0004】本発明は、この問題点を解消するためにな
されたもので、注目する1つの節と深く関連する節との
接続度の大きさを表示図形の大小によって示し、かつ網
構造全体としての節間の接続情報を失うことなく表示す
ることを目的とする。
The present invention has been made to solve this problem, and it shows the degree of connectivity between a node of interest and nodes that are deeply related to each other by the size of a displayed figure, and also shows the degree of connectivity between a node of interest and nodes that are deeply related to each other. The purpose is to display the connection information between the nodes without losing the connection information.

【0005】[0005]

【課題を解決するための手段】本発明による網構造表示
装置は、網構造情報を記憶する網構造情報記憶装置と、
注目する節を選択する節選択装置と、注目する節と他の
節との関連度を計算する節間関連度計算装置と、網構造
を表示する表示装置とを備えたものである。
[Means for Solving the Problems] A network structure display device according to the present invention includes a network structure information storage device for storing network structure information;
The present invention includes a clause selection device for selecting a clause of interest, an interclause degree calculation device for calculating the degree of association between the clause of interest and other clauses, and a display device for displaying a network structure.

【0006】[0006]

【作用】本発明による網構造表示装置においては、注目
する節と他の節との接続数が大きくなるにしたがって、
節を小さく表示する。すなわち、節は関連度が大きけれ
ば、大きく表示され、関連度が小さくなるにしたがって
小さく表示される。このようにして、注目する節と他の
節との関連度を、節の大小関係で図示し際だたせようと
するものである。
[Operation] In the network structure display device according to the present invention, as the number of connections between the node of interest and other nodes increases,
Display sections smaller. That is, the greater the degree of relevance, the larger the node is displayed, and the smaller the degree of relevance, the smaller the node is displayed. In this way, the degree of association between the clause of interest and other clauses is illustrated and highlighted by the size relationship of the clauses.

【0007】[0007]

【実施例】【Example】

実施例1.以下、本発明の実施例を図を用いて説明する
。図1は、本発明による網構造表示装置の一実施例であ
る。1は網構造情報記憶装置で、網構造を記憶する。 2は節選択装置で、注目する節を選択する。3は節間関
連度計算装置で、注目する節からみた他の節との関連度
を計算する。4は表示装置で、網構造を表示する。
Example 1. Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 shows an embodiment of a network structure display device according to the present invention. A network structure information storage device 1 stores the network structure. 2 is a clause selection device that selects a clause of interest. 3 is an interclause relevance calculation device that calculates the relevance of the node of interest to other clauses. 4 is a display device that displays the network structure.

【0008】本発明の実施例の動作について、図3にし
たがって説明する。通常の網構造表示から、任意のデバ
イスにより注目する節を節選択装置2により選択する。 次に、その節から見た他の節との関連度を節間関連度計
算装置3により計算し、節のスケールを変更した網構造
を表示装置4に表示する。他の節について、注目する場
合は、同様に任意のデバイスにより、注目する節を節選
択装置2により選択する。これをENDを選択するまで
繰り返す。
The operation of the embodiment of the present invention will be explained with reference to FIG. From the normal network structure display, a node of interest is selected by an arbitrary device using the node selection device 2. Next, the degree of association between this node and other nodes is calculated by the internodal relationship calculating device 3, and the network structure with the scale of the nodes changed is displayed on the display device 4. When paying attention to other clauses, the clause of interest is similarly selected by the clause selection device 2 using an arbitrary device. Repeat this until you select END.

【0009】次に本発明の一実施例の詳細について、図
4、5に従って説明する。図4に示すようにn11から
n33まで9つの節があるとする。今注目する節を真中
のn22とする。このn22を親とすると、子の場合は
{n11,n12,n23,n32}である。また孫の
場合は{n21,n31,n33}である。ただし、n
23,n32のように親から見て子にも孫にもなる節は
、近い方をとり、子とする。従って、n22に注目する
場合、n22に結び付く節の孫までの集合は次の3つで
ある。これを次のように表す。       S0={n22}・・・親自身     
 S1={n11,n12,n23,n32}・・・子
の集合      S2={n21,n31,n33}
・・・孫の集合
Next, details of one embodiment of the present invention will be explained with reference to FIGS. 4 and 5. As shown in FIG. 4, it is assumed that there are nine nodes from n11 to n33. The node we are currently focusing on is n22 in the middle. If n22 is the parent, the children are {n11, n12, n23, n32}. In the case of grandchildren, it is {n21, n31, n33}. However, n
23, n32, which can be both a child and a grandchild from the parent's point of view, choose the one that is closest to the parent and make it the child. Therefore, when focusing on n22, there are the following three sets of nodes connected to n22, including grandchildren. This is expressed as follows. S0={n22}...Parent itself
S1={n11, n12, n23, n32}...Set of children S2={n21, n31, n33}
...Grandchildren's gathering

【0010】次に親の節とそれぞれの集
合との関連度を、次のように定義する。S0は親の節自
身なので、親の節からの距離は0である。S1は親から
1離れていると考える。S2は親から2離れている。同
様にして、Smの集合は親からm離れていると考える。 本実施例では、減衰関数としてy=an (0<a<1
,0<n<5)を用いることとする。nは関連度であり
、yはその関連度の節集合に属する節のスケールを示す
。nにそれぞれの節の集合の関連度を代入すると、次の
ようになる。   もし、a=1/2と代入すれば、S0のスケールを
1としたとき、S1のスケールは1/2、S2のスケー
ルは1/4となる。図5に示す実施例1では、nが2以
上の節は一定のスケールとなっている。
Next, the degree of association between the parent node and each set is defined as follows. Since S0 is the parent node itself, the distance from the parent node is 0. S1 is considered to be one distance away from the parent. S2 is 2 away from the parent. Similarly, consider that the set of Sm is m away from the parent. In this example, the attenuation function is y=an (0<a<1
, 0<n<5). n is the degree of association, and y indicates the scale of the clauses belonging to the set of clauses with that degree of association. Substituting the degree of association of each set of clauses into n, we get the following. If a=1/2 is substituted, when the scale of S0 is 1, the scale of S1 will be 1/2, and the scale of S2 will be 1/4. In Example 1 shown in FIG. 5, nodes where n is 2 or more have a constant scale.

【0011】実施例2.本発明の応用として、次のよう
な減衰関数 y=an (0<a<1,n=0,1)y=0(n>1
) を選んだ場合、図6に示すように親節と直接の子節のみ
を表示することができる。このように減衰関数を、関連
度がある一定値以上になると、表示しないようにするこ
とができる。
Example 2. As an application of the present invention, the following attenuation function y=an (0<a<1, n=0,1)y=0(n>1
), only the parent clause and direct child clauses can be displayed, as shown in Figure 6. In this way, the attenuation function can be made not to be displayed when the degree of association exceeds a certain value.

【0012】実施例3.他の実施例として、木構造は網
構造の特別な場合であり、節間の関連度を同様に定義す
ることができるので、図7に示すように木構造について
も応用できる。
Example 3. As another example, a tree structure is a special case of a network structure, and the degree of association between nodes can be defined in the same way, so the present invention can also be applied to a tree structure as shown in FIG.

【0013】[0013]

【発明の効果】以上のような本発明によれば、網構造の
節と接続線の数が多く網構造が複雑な場合でも、注目す
る節と他の節の関連度を節のスケールを変えることによ
って、視覚的に把握することができる。また、注目する
節と関連する節の関連度による表示の制御を行なうこと
ができる。また、木構造についても同様に使用できる。 また、画面効率上網構造の表示面積を小さくしたい場合
には、本発明によって節のスケールを決定した後、任意
の画面圧縮処理を行なう応用もある。
[Effects of the Invention] According to the present invention as described above, even when the network structure has a large number of nodes and connecting lines and is complex, the scale of the nodes can be changed to determine the degree of association between the node of interest and other nodes. This allows you to understand it visually. Furthermore, the display can be controlled based on the degree of association between the target clause and related clauses. It can also be used similarly for tree structures. Further, when it is desired to reduce the display area of the network structure in terms of screen efficiency, there is also an application in which arbitrary screen compression processing is performed after determining the scale of nodes according to the present invention.

【図面の簡単な説明】[Brief explanation of the drawing]

【図1】本発明の網構造表示装置の構成図である。FIG. 1 is a configuration diagram of a network structure display device of the present invention.

【図2】データ・フロー・ダイアグラムの例である。FIG. 2 is an example of a data flow diagram.

【図3】本発明による網構造表示装置の実施例の動作を
示す流れ図である。
FIG. 3 is a flowchart illustrating the operation of an embodiment of the network structure display device according to the present invention.

【図4】網構造グラフの一例を示す図である。FIG. 4 is a diagram showing an example of a network structure graph.

【図5】本発明による網構造表示装置の表示の実施例1
を示す図である。
FIG. 5: Example 1 of the display of the network structure display device according to the present invention.
FIG.

【図6】本発明による網構造表示装置の表示の実施例2
を示す図である。
FIG. 6: Embodiment 2 of the display of the network structure display device according to the present invention.
FIG.

【図7】本発明による網構造表示装置の表示の実施例3
を示す図である。
FIG. 7: Embodiment 3 of the display of the network structure display device according to the present invention.
FIG.

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】  複数のデータを網構造で表示する装置
において、網構造情報を記憶する網構造情報記憶装置と
、注目する節を選択する節選択装置と、注目する節と他
の節との関連度を計算する節間関連度計算装置と、網構
造を表示する表示装置とを備えたことを特徴とする網構
造表示装置。
Claim 1: A device for displaying a plurality of data in a network structure, comprising: a network structure information storage device for storing network structure information; a node selection device for selecting a node of interest; and a node selection device for selecting a node of interest and a node of interest and other nodes. A network structure display device comprising: an internodal relevance calculation device that calculates a relevance degree; and a display device that displays a network structure.
JP3091950A 1991-04-23 1991-04-23 Network structure display device Pending JPH04322370A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3091950A JPH04322370A (en) 1991-04-23 1991-04-23 Network structure display device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3091950A JPH04322370A (en) 1991-04-23 1991-04-23 Network structure display device

Publications (1)

Publication Number Publication Date
JPH04322370A true JPH04322370A (en) 1992-11-12

Family

ID=14040861

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3091950A Pending JPH04322370A (en) 1991-04-23 1991-04-23 Network structure display device

Country Status (1)

Country Link
JP (1) JPH04322370A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1640919A2 (en) 2004-09-21 2006-03-29 Hewlett-Packard Development Company, L.P. Method, apparatus, processor arrangement, and computer-readable medium storing program for displaying network data

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1640919A2 (en) 2004-09-21 2006-03-29 Hewlett-Packard Development Company, L.P. Method, apparatus, processor arrangement, and computer-readable medium storing program for displaying network data

Similar Documents

Publication Publication Date Title
Becker et al. Visualizing network data
Ahlberg Spotfire: an information exploration environment
CN1658234B (en) Method and device for generating hierarchy visual structure of semantic network
US20040225635A1 (en) Browsing user interface for a geo-coded media database
US7024419B1 (en) Network visualization tool utilizing iterative rearrangement of nodes on a grid lattice using gradient method
JP2002525736A (en) Method and apparatus for mapping data files
US20030132944A1 (en) User control of generalized semantic zooming
Dachselt et al. Collapsible cylindrical trees: A fast hierarchical navigation technique
US20070150485A1 (en) Navigating through a displayed hierarchical data structure
Boardman Bubble trees the visualization of hierarchical information structures
JPH04322370A (en) Network structure display device
JP3296365B2 (en) Hypertext model display device and display method
Hao et al. A Java-based visual mining infrastructure and applications
CN115658779B (en) Population data display method and device
Nuchprayoon et al. GUIDO, a visual tool for retrieving documents
JPS6398780A (en) Drawing display system
US20040236733A1 (en) Searching device, searching method and program
Komzák et al. Scaleable GIS data transmission and visualisation
JPH06251081A (en) Hypermedia processor
CN109286522A (en) A kind of method and device based on map real-time exhibition network traffic information
JPH04227529A (en) Method and device for information display and information retrieval device
CN109697238A (en) Data processing method and device
JP2853144B2 (en) Image processing device
JP3058388B2 (en) Information presentation device
Wei et al. A parameter analysis method for the weight‐set to satisfy preference orders of alternatives in additive multi‐criteria value models