JPS60140473A - Growth model display system - Google Patents

Abstract

PURPOSE:To have animation display of the growth process on the graphic display device on real time basis by obtaining the model of the process of growth of trees, crystals, etc., by using the status transition rule. CONSTITUTION:The modeled status transition rule is registered in a transition table 160 by an input 110. The transition table 160 reads the present status from a part 170 which reads the status to a control processor 200 and holds the present growth status, obtains the next growth step status, and changes the present status 170. In addition, the transition rule of the transition table 160 is referred to from the shape and the color which are displayed at present, and the shape and the color which are displayed at present, and the shape and the color of the next growth step are obtained. The shape and the color of the next growth step are calculated by the processor 200, a part 210 which holds the present shape is renewed by the value, and outputted to a display device.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to computer graphics, and in particular, to modeling processes such as tree growth or crystal growth and displaying them as animations on a display device. Regarding preferred processing methods.

[Background of the invention]

Like a tree, the process of budding, growing branches and leaves, and eventually blooming is called A, I, indenmayer.
can be expressed topologically using a state transition rule model called the L system proposed by . (“
"Physics of Life" Fundamentals of Modern Physics 8 [2nd Edition], P417
-444 Iwako Homareten 1978) This L system is
The goal is to express the topology of the model, and there has been no research related to realistically displaying the actual appearance of trees and other plants during their growth process. Furthermore, as a conventionally known display method, there is the fractal theory, which makes it appear as if a figure is branching and growing by describing the rate of change between a basic figure and its next shape. However, this method expresses the relationship between figures at a certain time, and the rate of change is described as a function only of position, and does not track the actual growth process (for example, in the case of a tree). (This is just a view of one scene of a tree at a certain time as a display order in which branches gradually branch out from the trunk.) Because of this, it is not possible to create an animation that looks like a flower blooming due to the relaxation.

[Purpose of the invention]

An object of the present invention is to provide a processing method that models processes such as tree growth and crystal growth using state transition rules and displays realistic animation of the growth process on a graphic display device. It is in.

[Summary of the invention]

In the present invention, the topological state facilitation of the growth process is input as a transition rule, and the transition table to be registered and the transition state and shape at the start of display are input and held, and thereafter, the transition state and shape at the current time of the growth display step are input and retained. In addition, a part is provided to give the rate of change when moving from the current shape to the next step shape, and the number of growth steps (time) to be displayed as an animation is provided.
input, provide a timing control part, read the transition table from the current state, decide and update the transition state of the next step, read out the rate of change of shape at the same time, and read the transition table from the current state to the next step. By providing a processing section that updates and displays data in a tangible manner, it is possible to display an animation of a growing model on a graphic display device.

[Funny example of invention]

An embodiment of the present invention will be described below with reference to the drawings.

Figure 1 is an explanatory diagram for modeling the growth process in which a tree sprouts, becomes a trunk, branches, and leaves. First, in display step l, a state A in which buds have sprouted from a state of nothing.
It becomes o. This state transition is expressed as 1) 8-+4°. Next, in display step 2, the bud^0 becomes the trunk AI, and at the same time, branches appear as Bo on the right and Co on tE.

This state transition 2)　Ao　-+At　Bo　C.

It is expressed as In display step 3, AI + B-0+
Each C-0 grows to become A2*B11'CI. In other words, each state transition is 3) A
1→A2 4) Bo-+B1 5) Co-+ct. In each of the following display steps, #A2 changes to A3゜A4
．． Since it just grows and grows, I will use the expression 3') to abbreviate the state transition.

3') A+-+A2→A3→...Now, in display step 4, ``Do'' and ``Eo'' appear from branches B1 and C1. This state transition is 6) E1→132 Do E.

7)　Cs　-+C2Do　E.

Out. The subsequent state transitions of leaves Do and Eo are as follows: 8) Do-+D1→D2→ ])3-+λ9) Eo+Et
It can be expressed as →E2→E3→λ. Here, λ is a special symbol representing a dead state, and in this example, it indicates that the leaf Do at display step 6 withers and disappears at display step 7. Listing the remaining state transitions: 10) Bz →Bs A.

11) Cz → Cs A.

12) Bs→B4→B5→...song 13) C3→C4→C5→・song. At transitions 10) and 11), buds Ao appear again,
It expresses the situation where new leaves emerge while branching.

In this way, the growth process shown in FIG. 1 can be topologically modeled using a total of 13 state transition rules. With a model like this.

Therefore, in order to display a realistic tree, it is necessary to provide the necessary shape and color information for each state. In this case, state transition rules 3'), 12), 13
), if the growth is simple, all you need to do is give the rate of change in shape and color. Additionally, a part is needed to control the timing of growth steps. FIG. 2 shows a device 100 configured to realize the above functions.
shows. First, the modeled state transition rule is input 11
0 is registered in the transition table 160. This transition table 160 is read out to the device 200 (step 151) from the part 170 that holds the current growth state; the current state is read out (step 150); (step 152)
). Furthermore, the shape and color of the next growth step are determined from the currently displayed shape and color by referring to the transition rules in the transition table 160.

For this purpose, the portion 210 that retains the current shape and color is read out (step 153). However, if the state transition does not change from branch to row, but simply growth from branch to branch or leaf to leaf, it is only necessary to give the rate of change in that growth, so the rate of change is not retained. The portion 190 containing the data is read out (,X, step 154).

Based on this information, the device 200 calculates the shape and color of the next growth step, and updates the portion 210 that retains the current shape with this value (step E55).
. At the same time, this value is output to the display device (step 156). Initialization to current state portion 170 and current form portion 210 is performed by inputs 141 and 130, respectively. The rate of change is set in section 190 by input 120. The number of growth steps to be displayed as an animation is set by the input 140, the timing control of the growth steps is performed by the device 180, and a command to start calculating the growth steps is sent to the device 1 one after another.
Released from 80.

FIG. 3 shows the detailed data structure of the transition table 160. Table 3, one for each state.
10, 320, and 330 are secured, and pointers to these tables are stored and managed in the transition state management table 300. For example, the contents of tables 310, 320, and 330 are as follows: The transition rule is A→BCD, and table 32 for state A is
If 0 is secured, the number of branches is 3 in 316,
317 contains a pointer to a table 350 that stores pointers to tables for the three branch states B, C, and D. In addition, a temporary attribute table 360 is prepared to store the color of the figure in state A, the rate of change to the next figure, etc.
18 indicates the number of attributes, and 319 indicates the attribute table 360.
Stores a pointer to.

If the transition rule is simply applied n times, the number of application repetitions n is stored in 314.

A figure defined as a figure with one state is called a cell figure, and a complex figure such as a 6-leaf cell figure, in which a pointer to the program to be actually displayed is stored in 313 based on the data in the attribute table 360, is defined as a figure with one state. Since a graphic can be further divided into partial figures to define partial states, a pointer to a table for partial states is shown. 3
12 stores a pointer to a table 340 for defining an initial shape required when generating a figure from a partial state.

FIG. 4 shows the detailed data structure of the tables (170 and 210, respectively, but actually connected as in this example) that hold the current state and shape of the figure. The table 410 is called a route table, and provides coordinate values and an initial shape at which to start displaying the model. Pointers to route table 410 are managed in table 400. route table 41
Since the structure of 0 is the same as that used to hold the current state and shape of other cell shapes, the contents in the table described below are common to both. It is also common to table 340 in FIG. Pointers to state tables 310, 320 are stored in table 411 to indicate the current state of the shape. A table 412 is used to store the reference position (world coordinate system) of each cell figure, and a table 41 is used to store the values obtained by converting the coordinates to the display string.
Use 3. When the next step figure is inserted from the current figure, a plurality of new child figures are created, so tables are carefully reserved for these figures and pointers to them are stored in 440. Then, a pointer to table 440 is stored in table 417. 416 stores the number of children (branch number). The child still stores a pointer to the parent in the ancestor pointer 414 in order to know who the parent is. Furthermore, in order to reach children born in the same generation, the pointer 415 is used as a pointer to connect them. To keep the current cell shape shape,
Parameter table 450.470.

480 are used, a pointer to their parameter table is stored in table 419, and the number of parameters is stored in table 418. The same state transition rule is
Since the application is applied once, the table 421 is used to count the number of times the application has been applied up to the present time.

5 and 6 explain the contents of the program executed within the device 200. In Program 500,
First, retrieve a pointer to the table for roots (root position N) (Step 510), determine whether the display is from the beginning of growth step zero (Step 520), and if so, initialize the table. (Step 5)
21).

The processing contents include setting the root coordinate value 412 and initializing various pointers. Next, the processes from 531 to 580 are repeatedly executed until the current growth step reaches the number of growth steps specified for display (step 530). The timing control here corresponds to the function of the device 180. The processing in the loop of step 530 first takes out the contents of the generation pointer 415 from the table for the current cell figure and sets it in G (step 531). Then, until G becomes NIL (pointer contents are empty), i.e.
The processes from steps 541 to 550 are repeatedly executed until the parent becomes one child younger than the current parent. The address tp of the current cultivation table is set (step 541), and the growth of the parent figure is displayed and updated (step 542). Next, in order to check whether there is a branch in the state transition, the number of iterations is 31.
4 is zero and the number of branches 316 is not zero, or even if the number of repetitions is not zero, it is determined whether the count value 421 has reached the number of repetitions (steps 543, 544 and 546).
). Otherwise, jump to JA560. If the above conditions are met, the number of branches 316 is set in the number of children 416 of the parent table (step 547). Then, in order to branch and generate children, a table 440 for pointers to child tables is created and the pointers are registered 417 (step 547). Program 600 is run repeatedly to create a cell graphic display tape/L/420.430 for each child (step 550). In the program 600, a table 420 for the ilIth child is created and its pointer is registered in the table 440 (step 610).

A pointer value P to the parent table is set in the ancestor pointer 414 of the table 420 (step 620). The address pointer of the table 420 is stored in the generation pointer 415 of the previous child table (step 630
). The address of the state transition table 310 is stored in the state pointer of the table 420 (step 640).
. Since this system can divide one state into multiple partial states, the partial state pointer 311
is not NIL (step 650)
. If it is not NIL, in order to display the Cicell figure according to the partial state, first, remove the table 312 and the table 340, consider this as the root table,
Perform the processing described so far recursively (step 65
1). Otherwise, if it is NIL, the table 313 is linked to the cell figure display program, and the cell figure is updated and displayed (step 652). In this program,
In order to update and display a specific cell shape, prepare several procedures such as the following. Procedure for obtaining the table address of the parent or its term. Procedure to obtain coordinate address of specified table, figure parameter table address, -attribute table address, etc. Also, procedures for referencing and changing the contents of the specified table. Procedure for converting coordinates to the display surface. These include graphic display procedures. In step 660, the next child is generated. When all children are generated and displayed for one parent, the generation pointer 41
5 and moves to the next parent (step 561). In step 540, if the content of the generation pointer becomes NIL, processing for all parents ends. Then, the generation pointer 415 of the table of the last one examined among the generated children is set to NIL, indicating the end of the new parent (step 570). This completes all display calculations for one growth step, so the current growth step is advanced by one and the loop of step 530 is repeated until the designated step is reached. When the specified step is reached, the animation display ends.

〔Effect of the invention〕

According to the present invention, the growth process such as a tree's budding, branch and leaf growth, and eventually flower blooming can be realized using topological state transition rules and detailed data descriptions of each state figure. Realistic animation display is possible. Since there is no need to define detailed figures for each growth step, modeling of the growth process and its input becomes significantly easier. By adopting partial state transition rules, etc., shapes can be defined hierarchically, which is convenient. Since the part that the user has to write is limited to only the model and its data manipulation, it has the effect of becoming a general-purpose synutem that does not require consideration of other complex controls.

[Brief explanation of the drawing]

Fig. 1 is a diagram showing a modeling and display example when displaying an animation of the growth process, Fig. 2 is a configuration diagram of the apparatus of the present invention, Fig. 3 is a structural diagram of a state transition table, and Fig. 4
Figure 5 is a structural diagram of a table that stores the figures of the current growth step. FIG. 6 is a diagram showing a processing program according to the present invention. 160...Table for managing state transition rules, 170
...The part that maintains the current growth state, 180...
・The part that controls the timing of growth steps,
190... Part that holds the rate of change of the displayed figure, 200
...Control processing device, 210...Current growth shape
1 Figure y Z Figure 3 Figure η 4 Ro6o0 310 320 5th Figure 3

Claims (1)

[Claims] 1. Regarding the growth model, a table that registers and uses state transition rules of change, a part that retains the shape and color of the figure at the current growth step, and a table that stores the shape and color of the figure at the current growth step. A part that maintains the state of color transition, a part that maintains the rate of change of shape and color, a part that controls the timing of each growth step, input/output to the above data, and the shape, color, and state of the next growth step. A growth model display method characterized in that a device for controlling a program for displaying and updating the images is provided, and the growth process can be displayed as an animation. 2. The growth model display method according to item 1, characterized in that in dividing the graphic state of the growth model, one graphic state can be further divided into a plurality of partial states to define the graphic state hierarchically.