JPH05242195A - Automatic layout device for graph figure - Google Patents

Abstract

PURPOSE:To provide the graph figure layout device which is improved in visibility and made faster. CONSTITUTION:This device consists of an element data holding memory 1 which holds position information on respective elements connected by lines in a graph figure and the master-slave link relation, a data input part 2 which specifies elements at an addition position and a branch source when a figure element is added or a figure element to be deleted when the element is deleted, a position information calculation part 3 which receives a data input from the data input part 2 and calculates the positions of an element set to be redisplayed while referring to the contents of the element data memory, and a display part 4 which displays respective elements at positions calculated by the position information calculation part 3.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a graph graphic automatic layout device for performing automatic layout when a graph graphic is edited to add an element set by branching and when a branched element set is deleted.

In recent years, with the development of various industries, graph graphic data such as a state diagram for describing state transitions has become very large and complicated. In such a graph figure, it is desirable that each element is laid out based on a certain display rule so that it can be easily understood by humans. There may be cases where changes are needed. Therefore, it is required to automatically change the layout when editing the graphic.

[0003]

2. Description of the Related Art In a conventional graph figure automatic layout apparatus, when a graph figure is edited, an extra space may be formed between blocks to be displayed, which may be difficult to see. Also, when there was a change, the entire drawing was redisplayed. Therefore, it takes a lot of time and a large amount of memory to edit the graphic.

[0004]

As described above, the conventional technique has a problem in that a large amount of empty space is created when a graph figure is edited and the graph figure is diffused horizontally to make it difficult to see the entire graph figure. Further, even if only a small part of the graph figure is changed, only that part cannot be displayed again, and there is a problem that it takes time and memory to redisplay the entire drawing each time.

The present invention has been made in view of the above problems, and an object of the present invention is to provide a graph figure layout apparatus which improves visibility and is faster.

[0006]

FIG. 1 is a block diagram showing the principle of the present invention. In the figure, 1 is an element data holding memory that holds the positional information of each element connected by a line in a graph figure and the parent-child link relationship, and 2 is the addition position and branch source element when adding a figure element, In the case of deleting, the data input section 3 for designating the graphic element to be deleted receives the data input from the data input section 2, and refers to the contents of the element data holding memory 1 to redisplay the element set. A position information calculation unit for calculating the position of 4 and a display unit 4 for displaying each element at the position calculated by the position information calculation unit 3.

[0007]

The position information calculation unit 3 receives the data input by considering the element set to be added and the element set at the additional level that moves with it, and the element set to be deleted and the element set at the deletion level that moves with it, respectively. By receiving the data input from the unit 2 and referring to the contents of the element data holding memory 1 while considering the width of the blocks, each block is prevented from overlapping and no extra space is provided for each block. , The coordinates of the highest element of each block are determined, and all the elements in the block to be added and moved to the display unit 4 are displayed. By doing so, it is possible to improve the visibility and provide a higher speed graph graphic layout device.

[0008]

Embodiments of the present invention will now be described in detail with reference to the drawings. FIG. 2 is a flowchart showing the overall operation of the present invention. After performing the process 1 of calculating the position of the element set (S1), the block of the element for which position information is newly registered as a result is displayed (S2).

3 to 5 are flowcharts showing the sequence of position calculation of the element set, and show the contents of the process 1 of FIG. These sequences of flowcharts are combined to form one sequence. This sequence is performed by the position information calculation unit 3 while referring to the contents of the element data holding memory 1 based on the information input from the data input unit 2.

Here, description will be made with reference to the example of the element set shown in FIG. FIG. 17 shows block A and block B
The case where the block C is inserted between and is shown. First, the top element in the additional element set is defined as c1.
Next, the position information of the element immediately to the left of c1 is (X,
Y), and then the number of elements having the same Y coordinate and having position information (x, y) on the right side of X is m (S1). Figure 1
In the example of 7, since (X, Y) is a1 and the only element on the right side of a1 is c1, m = 1.

Next, it is checked whether or not m = 0 (S2). In the case of FIG. 17, since m = 0 is not satisfied, the process proceeds to step S3. In step S3, the m-th element from the rightmost of the elements satisfying x = X and y = Y is defined as bm. In the example of FIG. 17, since the element on the right side of a1 is the first element on the rightmost side, bm = c1.

Next, a set of elements (c1
Is included in the block C, and the Y coordinate of the bottom element in the block C is defined as D (S4). In the example of FIG. 17, the element set including c1 is block C, and the Y coordinates of the bottom elements c3 and c4 are Y = 4.

Next, the number of elements of position information (x, y) satisfying x≤X, y = Y is set to n, and a variable MAX = 0 is set (S5). In the case of the example in FIG. 17, since there are no elements on the left side of a1, n = 1. Also, the variable MA
X will be described later. Next, it is checked whether n = 0 (S6). If n = 0, jump to the sequence shown in FIG.

When n is not 0, the n-th element from the leftmost of the elements of the position information (x, y) satisfying x≤X and y = Y is an. Then, the maximum value of the Y coordinate of each element connected under an is set to Da (S7). In the example of FIG. 17, an is a1, and the maximum value Da of the Y coordinate of the elements connected under a1 is Da = 5.

Next, it is checked whether or not c1 is deleted (S8). When deleted, c1 and an are integrated, so c1 = an (S9). Next, Da <
Check if it is D. If so,
A block A is defined as a set of elements up to the Y coordinate Da among the elements connected to an and the elements below it (S12). In the case of the example shown in FIG. 17, Da> D. In this case, a block A is defined as a set of elements having an Y coordinate up to D among the elements connected to an and an element thereunder (S11). As a result, the Y coordinate of the lowest stage of the added block C and the original block A will match.

After the matching process of the Y coordinates of the block A and the block C is performed in this way, the maximum value of the X coordinate of each element of the block A is defined as Wa (S13). In the example of FIG. 17, Wa = 3. And then W
The size relationship between a and MAX defined in step S5 is checked (S14). If Wa ≦ MAX, n = n
-1 is calculated (S16), and the process returns to step S6. In the case of the example in FIG. 17, since Wa = 3 and larger than MAX (= 0), it is the case of Wa> MAX in step S14, and the value of Wa is set to MAX (S15), and step S15 is executed.
Move to 16. Next, the calculation of step n = n-1 is performed. Since n = 0 by this calculation, the sequence jumps to the sequence shown in FIG.

Next, the space data input from the data input unit 2 is defined as P (> 0) (S17). Here, when inputting the space data, it is necessary to make a decision so that there is no unnecessary space between adjacent blocks. Next, Xc = MAX + P, Yc = Y, and c
The new position information of 1 is registered as (Xc, Yc). Next, new position information of all elements of block C is registered (S18).

Next, the process of adding the block B to the right of the block C is started. In order to set c1 as a new initial value of X, X = Xc is set (S19). Next, it is checked whether m = 0 (S20). If m is not 0, it is necessary to shift the parent if the parent of the newly added block is different, so after initializing g = 1,
The parent element of bm is bpg, and the parent element of c1 is cpg (S21).

Then, it is checked whether the parent element bpg of bm and the parent element cpg of c1 are the same (S2).
2). When the two parent elements are different, the element bp (g + 1) that is one element higher than the parent element of bpg is the new parent element, and the element cp (g + 1) that is one element higher than cpg is the parent element (S23). .. Then, the new parents are compared with each other (S24). If bp (g + 1) and cp (g + 1) match, it means that the relatives have matched, and the process proceeds to the next step. If you don't like your relatives,
g = g + 1 is set (S25), and the process of comparing the elements one element higher is repeated.

Next, the number of pieces of position information (x, y) satisfying x> X, y = Y-g is m, and among the position information (x, y) satisfying x> X, y = Y-g. The m-th element from the far right is b
m (S26). Then, Y = Y-g is calculated (S
27), c1 = bm, m = m−1 (S28), the process returns to step S4 (see FIG. 3), and the above-described operation is repeated to add the block B to the right of the block C. become.

FIG. 6 is a flow chart showing how to obtain the maximum X coordinate max in the determined block. In the figure, the case of checking from Y = α to Y = α + β is shown. This operation is performed by the position information calculation unit 3 in FIG. Y
The same applies when the coordinates are obtained. First, initial setting of Y = α is performed (S1). Next, the target element is a1, the X coordinate of the target element is X1, and max = X1 is set (S
2). Next, it is checked whether Y = α + β (S3).

Next, the number of children of a1 is nu, the rightmost child of a1 is anu, and the X coordinate of anu is W.
(S4). Then, it is checked whether W is larger than max (S5), and if it is larger, max = W is set (S6).
= Y + 1 and a1 = anu (S7), and the process returns to step S3. When the above process is repeated and Y = α + β, the process ends, and the maximum X coordinate value is included in max at that time.

FIG. 7 shows the maximum Y coordinate ma in the block.
It is a flowchart which shows how to obtain x. Similar to the case of obtaining the X coordinate, the Y coordinate of the target element is Y1, max = Y
The value is set to 1 (S1), and the process proceeds to 2 (S2). The maximum Y coordinate value is held in max after the processing 2 is finished.

FIG. 8 is a flow chart showing a concrete sequence of the process 2. First, the target element is a1 (S
1). Next, it is checked whether or not a1 has any children (S2). If there are no children, check whether Y1> max (S8), and if yes, ma
Substitute Y1 for the value of x (S9), and then return, otherwise return immediately.

In step S2, if there are children in a1, the number of children in a1 is set to no (S3). Then, it is checked whether or not no is 0 (S4). If there are no children, return. If there is a child, the n-th child of a1 is ano and its Y coordinate is Y1 (S5). Next, the process 2 is recursively called for ano (S6). Next, no-1 is set as a new no (S7), and the process returns to step S4. The maximum Y coordinate value is stored in max at the time when the above processing is completed.

Next, the actual operation of the present invention will be described with reference to the drawings. FIG. 9 is a diagram showing the arrangement position coordinates of elements.
As shown in the figure, the coordinates are in the fourth quadrant, and the Y coordinate is positive in the downward direction. The elements of the figure are assumed to have only discrete values that change by 1 in the X and Y directions as shown in the figure.

FIG. 10 is a flow chart showing a sequence for calculating the coordinates of all the elements in the block. (A) shows allocation of X coordinates, and (b) shows allocation of Y coordinates. To obtain the X coordinate, the parent X coordinate is set to W (S1), and if the child is the C-th child, the value is set to C (S2), and W = W + C is calculated (S
3) The obtained value W becomes the X coordinate.

When obtaining the Y coordinate, the parent Y coordinate is D
(S1), D = D + 1 is calculated (S2), and the calculated result D is used as the Y coordinate. FIG. 11 is an explanatory diagram of the operation of the present invention, showing the state of the initial position. The figure shows the case where the block C is inserted between the block A and the block B. That is, the figure shows a case where an element set (block C) connected to c1 and c1 is added between a1 and b1.

The designated space is set to 1 so as to be arranged as close to each other as possible. The additional level (coordinate of c1) is Y = 2, and the maximum Y coordinate of the block C is 4 when calculated according to the flow of FIG. 7 and FIG. It receives the elements of Y = 2 to Y = 4.

First, when the element on the right side of the added position is searched, only b1 is found. In addition, the element set connected to c1 and c1 to be added is defined as a block C. When the element on the left side of the added position is searched, only a1 is found. Therefore, in this case, the block C is arranged on the right side of the block A in FIG.

When the maximum X coordinate of the block A is calculated according to the flow of FIG. 6, it is 3, so the X coordinate of c1 is 4, Y
The coordinates are 1. Elements c2, c3, c connected under c1
4 is calculated according to the flow of FIG. 10, and the respective coordinates (W, D) are obtained. FIG. 12 is a diagram showing the arrangement of the blocks C determined by the present invention. A block C is arranged on the right side of the block A with a space 1 therebetween.

Next, a case where the block B is arranged on the right side of the block C will be described. Since the elements b1 and c1 have the same parent, the element b1 and the element connected therebelow are arranged on the right side of the block C. Here, it is considered that the set of the element b1 and the elements connected thereunder is defined as a block B, and the block B is added to the right side of the block C.

In this case as well, the additional level is Y = 2, but the maximum Y coordinate of the block B is 3 when calculated according to the flow of FIGS. 7 and 8. Therefore, among the elements on the left side of the additional position, the block It is the elements from Y = 2 to Y = 3 that are affected by the addition of B.

Then, focusing on the elements of Y = 2 to Y = 3 of the block C, the maximum X coordinate thereof is calculated according to the flow of FIG. Therefore, element b1 of block B
Has an X coordinate of 5 and a Y coordinate of 2. The element b2 connected under b1 is calculated according to the flow of FIG. 10, and its coordinates (W, D) are obtained. FIG. 13 is a diagram showing a final layout determined by the present invention. The block B is arranged on the right side of the block C with a space 1 therebetween.

Next, in FIG. 11A, the element a3
A case where the element d1 is added between the line b2 and the line b2 is described. FIG. 14 is a diagram showing an example of initial placement of graphics. The designated space is 1 as in the previous embodiment. Element d1
Is block D. The additional level is Y = 3, and the maximum Y coordinate of the block D is Y = 3 when calculated according to the flow of FIG. 7 and FIG. It is an element of Y = 3.

First, when the element on the right side of the added position is searched, only b2 is found. When searching the elements on the left side of the addition position, only a2 and a3 are found. The block D will be arranged on the right side of the block A'in FIG. Since the maximum X coordinate of the block A ′ is 2, the X coordinate of d1 is 3 and the Y coordinate thereof is 3. FIG. 15 is a diagram showing a state in which the figures are being arranged, and shows a state in which the block D is arranged to the right of the block A ′.

Next, since the elements d1 and b2 have different parents,
Check if the parents of b1 and a1 are the same. In this case, since they are the same, Y = 2 to Y = linked to a1
A set of elements of 3 is newly set as a block D ′, and a set of elements of Y = 2 to Y = 3 connected to b1 is newly set as a block B ″. Then, the block B ″ is replaced with the block D ′.
Think of adding to the right of.

Focusing on the elements from Y = 2 to Y = 3 of the block D ', the maximum X coordinate is calculated according to the flow of FIG. Therefore, the X coordinate of b1 is 4, Y
The coordinate is 2, and the element b2 connected under b1 is calculated according to the flow of FIG. 10 to obtain the coordinate (W, D). FIG. 16 is a diagram showing a final layout determined by the present invention. A block B ″ is arranged on the right side of the block D ′ with a space 1 therebetween.

In the above embodiment, the case where the element set is added is taken as an example, but the present invention can be similarly applied to the case where the element set is deleted. For example, in FIG.
Considering the case where the block C is deleted from the layout, in this case, the present invention can be applied as it is, considering that it is a process of adding the block B to the block A.

[0040]

As described above in detail, according to the present invention, it is possible to provide a graph figure layout apparatus which has improved visibility and has a higher speed. According to the present invention, by automatically laying out a graph figure, it is necessary to manually make an additional space when branching and adding an element set at the time of editing the graph figure. Also, by deleting it, there is no problem that the element does not follow the display rule and becomes difficult to see. Further, according to the present invention, it is possible to automatically layout each element based on a certain display rule.

Therefore, according to the present invention, it is possible to create a graph figure that is easy for humans to understand by leaving a designated space between elements, and this greatly contributes to improving the visibility of the graph figure. Furthermore, when adding or deleting an element set, only the element set that needs to be displayed again can be searched, and only the necessary portion can be displayed again, and a faster automatic layout of the graph figure can be performed.

[Brief description of drawings]

FIG. 1 is a principle block diagram of the present invention.

FIG. 2 is a flowchart showing the overall operation of the present invention.

FIG. 3 is a flowchart showing a sequence of position calculation of an element set.

FIG. 4 is a flowchart showing a sequence of position calculation of an element set.

FIG. 5 is a flowchart showing a sequence of position calculation of an element set.

FIG. 6 is a flowchart showing how to obtain the maximum X coordinate max in a block.

FIG. 7 is a flowchart showing how to obtain the maximum Y coordinate max in a block.

FIG. 8 is a flowchart showing a specific sequence of processing 2.

FIG. 9 is a diagram showing arrangement position coordinates of elements.

FIG. 10 is a flowchart showing a sequence for calculating coordinates of all elements in a block.

FIG. 11 is an explanatory diagram of the operation of the present invention.

FIG. 12 is a diagram showing an arrangement of blocks C determined by the present invention.

FIG. 13 is a diagram showing a final layout.

FIG. 14 is a diagram showing an example of initial placement of graphics.

FIG. 15 is a diagram showing an intermediate state of arrangement of figures.

FIG. 16 is a diagram showing a final layout of graphics.

FIG. 17 is a diagram showing an example of an element set.

[Explanation of symbols]

 1 Element data storage memory 2 Data input section 3 Position information calculation section 4 Display section

Claims (5)

[Claims] 1. An element data holding memory (1) for holding positional information of respective elements connected by a line in a graph figure and a parent-child link relationship, and when adding a figure element, the addition position and the branch source element When deleting, the data input section (2) for designating the graphic element to be deleted and the data input from the data input section (2) are received, and the contents of the element data holding memory (1) are referred to, A position information calculation unit (3) that calculates the position of an element set that needs to be displayed again, and a display unit (4) that displays each element at the position calculated by the position information calculation unit (3). Automatic graph figure layout device. 2. An element set to be added and an element set of an additional level that moves along with it are considered as blocks, and the widths of the blocks are taken into consideration so that the blocks do not overlap and an extra space is provided for each block. 2. The graph graphic automatic layout apparatus according to claim 1, wherein the coordinates of the uppermost element of each block are determined so that all the elements in the block to be added and moved are displayed so as to prevent the display. .. 3. An element set to be deleted and an element set of a deletion level that moves along with the element set are considered as blocks, and the widths of the blocks are taken into consideration so that the blocks do not overlap and an extra space is provided between the blocks. 2. The graph graphic automatic layout apparatus according to claim 1, wherein the coordinates of the uppermost element of each block are determined so that all the elements of the moving block are displayed so as to prevent such a problem. 4. When the display positions of the element set of the same level that moves with the addition and deletion of the element set and the element set of the higher level do not follow the display rule, it is necessary to move so as to follow the display rule. 2. A graph figure automatic layout according to claim 1, wherein a new block based on the highest level element is newly considered, and all the elements in the block are displayed by determining the coordinates thereof. apparatus. 5. An element set to be added or deleted and an element set moved with it are considered as blocks,
By considering the width of the blocks, specify an arbitrary space between blocks so that each block does not overlap,
2. The graph graphic automatic layout apparatus according to claim 1, wherein all the elements in the block to be added and moved are displayed by determining the coordinates of the highest element of each block.