JP4729116B2 - GAME SYSTEM AND INFORMATION STORAGE MEDIUM - Google Patents

Description

  The present invention relates to a game system and an information storage medium.

  Conventionally, a game system that generates an image that can be seen from a given viewpoint in an object space that is a virtual three-dimensional space is known, and is popular as a device that can experience so-called virtual reality. Taking a game system that can enjoy a role-playing game as an example, a player operates a character (object) and moves it on a map in the object space to play against enemy characters or interact with other characters. Or enjoy the game by visiting various towns.

  Now, in such a game system, it is an important technical problem to generate a more realistic image in order to improve the virtual reality of the player. Therefore, it is desirable that the state in which an object is burned by a flame can be expressed with a realistic image. In other words, taking the case where the cloth is burned by the flame as an example, it is desirable to be able to express how the ignited flame gradually spreads and the cloth is burnt off and disappears.

  And the following 1st, 2nd methods, for example can be considered as a method of implement | achieving such a burning torn expression of a cloth.

In the first approach, the cloth object OB _1-1 representing the fabric after torn and burning cloth objects OB ₁ representing the fabric before burning Tochigi, are prepared the OB _1-2 beforehand. When it is determined that the cloth has burned off, the cloth object to be used is switched from OB ₁ to OB _1-1 and OB _1-2 .

Japanese Patent Laid-Open No. 9-223247

  However, the first method has a problem that the generated image becomes uniform, and it is impossible to generate a variety of real images. In order to solve this problem, a method of preparing a large number of objects for expressing various tearing methods can be considered, but this causes a problem of an increase in storage capacity of object data. .

In the second method, when it is determined that the fabric is torn burning, produce by dividing the fabric object OB ₁ in real time, the cloth object OB _1-1 representing the fabric after burning torn, the OB _1-2 in real time To do.

  However, in this second method, every time the cloth burns off, the data structure of the cloth object changes, and the data management becomes complicated. Also, every time the fabric burns off, the amount of data increases. There is also a problem that the amount of data used in the memory increases.

  The present invention has been made in view of the above-described problems, and the object of the present invention is to generate a realistic image representing how an object is burned by a flame with a small amount of data and a small processing burden. A system and an information storage medium are provided.

The present invention is a game system that performs image generation,
Means for setting in the object space an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force;
Means for determining a color of the node based on a node state parameter which the node has as attribute data;
Means for generating an image at a given viewpoint in object space;
It is characterized by including.

  The present invention also relates to an information storage medium that can be read by a computer and stores a program for causing the computer to function as each of the above-described means.

It is an example of the block diagram of the game system of this embodiment. 2A and 2B are examples of game images generated by this embodiment. 3A and 3B are also examples of game images generated by this embodiment. It is a figure for demonstrating the method of making the polygon which makes the node the vertex non-display while invalidating the binding force of the burned-out node. It is a figure which shows the example of the data structure of a node. It is a figure which shows the example of the data structure of a virtual spring. FIGS. 7A and 7B are diagrams for explaining a technique for realizing a fabric burn-off expression using a burnup (node state) parameter. FIGS. 8A and 8B are also diagrams for explaining a method for realizing the burn-off expression of the cloth using the burnup parameter. It is a figure for demonstrating the method of generating a particle based on a burnup parameter. It is a figure for demonstrating the method of expressing a particle by 3D sprite. FIGS. 11A and 11B are diagrams for explaining flame particles. 12A and 12B are also diagrams for explaining flame particles. FIGS. 13A and 13B are also diagrams for explaining flame particles. It is a figure for demonstrating the method to change the image of a node vicinity based on a burnup parameter. FIGS. 15A and 15B are examples of cloth object images in which the image gradually changes by the method of the present embodiment. FIGS. 16A and 16B are also examples of the wire frame image of the cloth object in which the image gradually changes by the method of the present embodiment. FIGS. 17A and 17B are also examples of the wire frame image of the cloth object in which the image gradually changes by the method of the present embodiment. It is a flowchart shown about the detailed process example of this embodiment. It is a flowchart shown about the detailed process example of this embodiment. It is a flowchart shown about the detailed process example of this embodiment. It is a flowchart shown about the detailed process example of this embodiment. It is a flowchart shown about the detailed process example of this embodiment. FIGS. 23A, 23B, and 23C are diagrams for explaining a detailed processing example of the present embodiment. It is a figure which shows an example of the structure of the hardware which can implement | achieve this embodiment. 25A, 25B, and 25C are diagrams showing examples of various types of systems to which the present embodiment is applied.

  In order to solve the above-described problem, the present embodiment is a game system that performs image generation, and an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force is placed in the object space. Means for setting, means for invalidating a binding force connecting the invalid node and an adjacent node of the invalid node when it is determined that a node of the plurality of nodes has become an invalid node, and object space Means for generating an image at a given viewpoint. The information storage medium according to the present embodiment is an information storage medium that can be used by a computer, and includes a program for executing the above means. The program according to the present embodiment is a program (including a program embodied in a carrier wave) that can be used by a computer, and includes a processing routine for executing the above means.

  According to this embodiment, when it is determined that a certain node has become an invalid node, the binding force that connects the invalid node and its adjacent node becomes invalid. Accordingly, the invalid node is separated from the neighboring nodes around the invalid node, and image expression such as a hole in the object or tearing of the object becomes possible.

  In particular, when each node has attribute data such as position, velocity, acceleration, etc., it is possible to drop a torn part of an object based on physical calculation, etc., so that a more realistic image can be generated. become.

  In addition, the present embodiment is a game system that performs image generation, a unit that sets an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force, in the object space; When it is determined that a node in the node becomes an invalid node, among the primitives constituting the object, a means for omitting drawing of a primitive including the invalid node as a definition point, and a given in the object space Means for generating an image at a viewpoint. The information storage medium according to the present embodiment is an information storage medium that can be used by a computer, and includes a program for executing the above means. The program according to the present embodiment is a program (including a program embodied in a carrier wave) that can be used by a computer, and includes a processing routine for executing the above means.

  According to the present embodiment, when it is determined that a certain node has become an invalid node, drawing of a primitive including the invalid node as a definition point (vertex, control point) is omitted. Accordingly, an image near the invalid node is not displayed, and an image expression such as a hole in the object or tearing of the object becomes possible.

  Note that when drawing a primitive including an invalid node as a definition point is omitted, it is desirable to invalidate the binding force that connects the invalid node and the adjacent node of the invalid node.

  The game system, information storage medium, and program according to the present embodiment are characterized in that it is determined whether or not the node has become an invalid node based on a node state parameter that the node has as attribute data.

  In this way, for example, it becomes possible to determine that the node has become invalid on the condition that the node state parameter has changed or the node state parameter has reached a given value, and the processing can be simplified. .

  Further, the game system, information storage medium, and program according to the present embodiment provide means (or the means) for transmitting the node state of the node to an adjacent node of the node based on the node state parameter that the node has as attribute data. Including a program or a processing routine for executing

  In addition, the present embodiment is a game system that performs image generation, in which an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force is set in the object space; Including means for transmitting a node state of the node to an adjacent node of the node based on a node state parameter included as attribute data, and means for generating an image at a given viewpoint in the object space. Features. The information storage medium according to the present embodiment is an information storage medium that can be used by a computer, and includes a program for executing the above means. The program according to the present embodiment is a program (including a program embodied in a carrier wave) that can be used by a computer, and includes a processing routine for executing the above means.

  According to the present embodiment, it is possible to transmit a node state of a certain node to an adjacent node using a node state parameter. Accordingly, it is possible to express a state in which a node state of a certain node is gradually transmitted from the node to surrounding nodes, and for example, it is possible to perform an optimal image expression for a flame burning expression.

  In addition, the game system, information storage medium, and program according to the present embodiment determine whether to transmit the node state of the node to the adjacent node of the node based on the node state parameter that the node has as attribute data. If the node state is determined to be transmitted, the node state parameter of the adjacent node to which the node state is transmitted is changed.

  In this way, it becomes possible to change the node state parameter of the adjacent node of the node on the condition that the node state parameter of the node changes or the node state parameter reaches a given value. . As a result, it is possible to express a state in which the node state of a node around the node changes one after another from a certain node.

  In addition, the present embodiment is a game system that performs image generation, in which an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force is set in the object space; The image processing apparatus includes means for generating particles from the node based on a node state parameter included as attribute data, and means for generating an image at a given viewpoint in the object space. The information storage medium according to the present embodiment is an information storage medium that can be used by a computer, and includes a program for executing the above means. The program according to the present embodiment is a program (including a program embodied in a carrier wave) that can be used by a computer, and includes a processing routine for executing the above means.

  According to the present embodiment, it is possible to generate particles from the node using the node state parameter. Therefore, particles according to the node state can be generated from the node, and a more realistic particle expression can be realized.

  When the game system, information storage medium, and program according to the present embodiment determine whether or not to generate particles from the node based on the node state parameter that the node has as attribute data, Is characterized in that the attribute data of the particles is determined based on the node state parameter of the node.

  In this way, on the condition that the node state parameter of the node has changed or the node state parameter has reached a given value, particles having attribute data corresponding to the value of the node state parameter are transferred to the node. It becomes possible to generate from. Therefore, for example, when combined with the invention that transmits the node state to the adjacent node based on the node state parameter, it is possible to express how the area of the node that generates the particles gradually expands, which is optimal for expressing the flame spread It becomes possible to generate a simple image.

  In addition, the present embodiment is a game system that performs image generation, in which an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force is set in the object space; The image processing apparatus includes: means for changing an image of an object near the node based on a node state parameter included as attribute data; and means for generating an image at a given viewpoint in the object space. The information storage medium according to the present embodiment is an information storage medium that can be used by a computer, and includes a program for executing the above means. The program according to the present embodiment is a program (including a program embodied in a carrier wave) that can be used by a computer, and includes a processing routine for executing the above means.

  According to the present embodiment, it is possible to change the image of the object near the node using the node state parameter. Therefore, an image such as the color of an object near the node can be locally changed according to the node state, and a more realistic image expression can be realized.

  In addition, the game system, information storage medium, and program according to the present embodiment change an image of a primitive that includes the node as a definition point among primitives constituting the object, based on a node state parameter that the node has as attribute data. It is characterized by that.

  In this way, it is possible to change the image data given to the definition point of the primitive and change the image in units of primitives based on the image data.

  The game system, information storage medium, and program according to the present embodiment are characterized in that the node state parameter is a parameter that represents the burnup degree of each node.

  Using such burnup parameters, it is possible to determine whether or not a node has been burned out, determine whether or not to transmit the combustion state of a node to other nodes, determine whether or not to generate flame particles from a node, etc. Can be realized by a simple process.

  The game system, information storage medium, and program according to the present embodiment determine that the state change of the node has started when the node state parameter has changed from a first value that is an initial value, and the node state When the parameter becomes the second value, it is determined that the state change of the node is completed.

  In this way, for example, when the node state parameter changes from the first value, it is determined that the change of the node state has started, and when the node state parameter is between the first and second values. Determines that the node state change is in progress, and if the node state parameter reaches the second value, the node state change ends, and for example, it can be determined that the node has become invalid. .

  The game system, information storage medium, and program according to the present embodiment are characterized in that each node has the position, velocity, and acceleration of each node as attribute data.

  If each node has such attribute data such as position, velocity, and acceleration, each node can be moved by physical simulation, and a more realistic image representation can be achieved.

  The game system, information storage medium, and program according to the present embodiment are nodes in which the plurality of nodes are arranged in a grid pattern.

  In this way, the state change expression and tearing expression of the plate-like object such as the cloth object or the paper object can be realized realistically.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

1. Configuration FIG. 1 shows an example of a block diagram of a game system (image generation system) of the present embodiment. In this figure, the present embodiment only needs to include at least the processing unit 100 (or include the processing unit 100 and the storage unit 170), and the other blocks can be optional components.

  The operation unit 160 is for a player to input operation data, and the function can be realized by hardware such as a lever, a button, a microphone, or a housing.

  The storage unit 170 serves as a work area such as the processing unit 100 or the communication unit 196, and its function can be realized by hardware such as a RAM.

  An information storage medium (storage medium usable by a computer) 180 stores information such as programs and data, and functions thereof are an optical disk (CD, DVD), a magneto-optical disk (MO), a magnetic disk, and a hard disk. It can be realized by hardware such as a magnetic tape or a memory (ROM). The processing unit 100 performs various processes of the present invention (this embodiment) based on information stored in the information storage medium 180. That is, the information storage medium 180 stores information (program or data) for executing the means of the present invention (this embodiment) (particularly, the blocks included in the processing unit 100).

  Part or all of the information stored in the information storage medium 180 is transferred to the storage unit 170 when the system is powered on. The information storage medium 180 also includes a program for performing the processing of the present invention, image data, sound data, shape data of the display object, information for instructing the processing of the present invention, or processing in accordance with the instructions. Information etc. can be included.

  The display unit 190 outputs an image generated according to the present embodiment, and the function thereof can be realized by hardware such as a CRT, LCD, or HMD (head mounted display).

  The sound output unit 192 outputs the sound generated by the present embodiment, and its function can be realized by hardware such as a speaker.

  The portable information storage device 194 stores player personal data, game save data, and the like. As the portable information storage device 194, a memory card, a portable game device, and the like can be considered.

  The communication unit 196 performs various controls for communicating with the outside (for example, a host device or other game system), and functions thereof are various processors, hardware such as a communication ASIC, It can be realized by a program.

  The program or data for executing the means of the present invention (this embodiment) may be distributed from the information storage medium of the host device (server) to the information storage medium 180 via the network and the communication unit 196. Good. Use of such an information storage medium of the host device (server) is also included in the scope of the present invention.

  The processing unit 100 (processor) performs various processes such as a game process, an image generation process, and a sound generation process based on operation data from the operation unit 160, a program, and the like. The functions of the processing unit 100 can be realized by hardware such as various processors (CPU, DSP, etc.) or ASIC (gate array, etc.) and a given program (game program).

  Here, game processing performed by the processing unit 100 includes coin (price) acceptance processing, various mode setting processing, game progress processing, selection screen setting processing, position of an object (one or more primitive surfaces), Processing for obtaining a rotation angle (rotation angle about X, Y or Z axis), processing for moving an object (motion processing), processing for obtaining a viewpoint position (virtual camera position) and a line-of-sight angle (virtual camera rotation angle), Processing to place objects such as map objects in the object space, hit check processing, processing to calculate game results (results, results), processing for multiple players to play in a common game space, game over processing, etc. Can think.

  Further, the processing unit 100 generates an image that can be seen from a given viewpoint (and a virtual camera) in the object space, for example, based on the game processing result, and outputs the image to the display unit 190.

  Further, the processing unit 100 performs various kinds of sound processing based on the above-described game processing result, generates a sound such as BGM, sound effect, or sound, and outputs the sound to the sound output unit 192.

  Note that all of the functions of the processing unit 100 may be realized by hardware, or all of them may be realized by a program. Alternatively, it may be realized by both hardware and a program.

  The processing unit 100 includes an object space setting unit 102, a node state processing unit 104, a binding force processing unit 106, a node movement processing unit 108, a particle processing unit 110, and a drawing processing unit 112.

  Here, the object space setting unit 102 performs processing for setting various objects (models) such as game characters and maps in the object space. More specifically, the position and rotation angle (direction) of the object in the world coordinate system are determined, and the object is arranged at the position at the rotation angle.

  In this embodiment, an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force is set in the object space as an object for representing a display object such as cloth. become.

  The node state processing unit 104 performs node state (burning degree etc.) determination processing, node state transmission processing to adjacent nodes, and the like based on node state parameters (burning degree parameter) that the node has as attribute data. More specifically, based on the node state parameter, it is determined whether or not to transmit the node state (combustion state) to the adjacent node (whether or not to make the flame burn out), and when it is determined to transmit the node state The process of changing the node state parameter of the adjacent node to which the node state is transmitted (the process of setting the combustion state) is performed.

  The node state parameter is a variable for quantitatively or qualitatively representing the state of the node at that time (burning rate, temperature, humidity, intensity, luminous intensity, etc.), and various determinations are made in processing related to the node state. It is used for the material.

  Further, as attribute data given to a node, in addition to the node state parameter, the position, velocity, acceleration, or the like of each node can be considered.

  Based on the node state parameter, the binding force processing unit 106 determines whether or not the node is invalid (whether or not it is burned out). If the binding force processing unit 106 determines that the node is an invalid node, the binding force processing unit 106 connects the invalid node and its adjacent node. Process to invalidate force (virtual spring). On the other hand, when it is determined that the nodes are not invalid, the binding force to be applied between the nodes is calculated.

  The node movement processing unit 108 calculates the acceleration, speed, and position of the node in each frame. In this case, the acceleration of the node is calculated based on a binding force acting on the node and physical parameters such as gravity and wind force.

  The particle processing unit 110 may sequentially generate particles (for example, flame particles and smoke particles) for expressing an irregular display object (for example, flame, smoke, water, and explosion) whose shape is deformed over time. , Move or extinguish. More specifically, a process of randomly changing the generation amount, generation position, movement state (speed, acceleration, etc.) or lifetime of particles is performed. As a result, it is possible to realistically represent an irregular display such as a flame.

  In the present embodiment, the particle processing unit 110 performs processing for generating particles from the node based on the node state parameter. More specifically, it is determined whether particles are generated from the node based on the node state parameter. If it is determined that a particle is generated, the attribute data of the particle (flame intensity, light intensity, generation amount, speed, acceleration, life, etc.) is determined based on the node state parameter of the node. For example, when the degree of burning of the node is high, strong flame particles are generated.

  The drawing processing unit 112 performs processing for drawing an object (primitive surface) after geometry processing in a drawing area 174 (for example, a frame buffer) while performing texture mapping, color (luminance) interpolation processing, hidden surface removal, and the like. Thereby, an image at a given viewpoint (virtual camera) in the object space in which the object is arranged is generated.

  In this embodiment, when a node in a plurality of nodes is determined to be invalid based on the node state parameter or the like, the invalid node is defined as a definition point (a point for defining the shape of an object). The drawing of primitives (polygons, free-form surfaces, etc.) included as polygon vertices or free-form surface control points) is omitted. More specifically, by drawing a primitive having a node as a defining point, an image of an object (for example, cloth) whose shape is specified by a plurality of nodes is generated. For example, when the primitive is a polygon, if there is an invalid node in the vertex of the polygon, the drawing of the polygon is omitted.

  Furthermore, in this embodiment, based on the node state parameter described above, the image (properties such as color and brightness) of the object near the node is changed. More specifically, based on the node state parameter, an image of a primitive that includes the node as a definition point among the primitives constituting the object is changed. For example, when it is determined that the node is in the combustion state based on the node state parameter, the color of the cloth (object) in the vicinity of the node is changed from the original color to gradually become black.

  Note that the game system according to the present embodiment may be a system dedicated to the single player mode in which only one player can play, and not only such a single player mode but also a multiplayer mode in which a plurality of players can play. A system may be provided.

  Further, when a plurality of players play, game images and game sounds to be provided to the plurality of players may be generated using one terminal, or connected via a network (transmission line, communication line) or the like. Alternatively, it may be generated using a plurality of terminals.

2. 2. Features of the Present Embodiment 2.1 Representation of Burned-off Cloth FIGS. 2A, 2B, 3A, and 3B show examples of game images generated by the present embodiment.

  In FIG. 2A, a flame 20 is lit on the candle 18. The flame 20 is represented by a plurality of flame particles generated from the tip of the candle 18. Objects such as the small bear 22, the desk 24, the cloth 25, and the carpet 29 around the flame 20 are light from the flame 20 (specifically, light from a representative light source set at a representative position of the flame particle). Is shaded. In addition, the shadow 30 of the small bear 22 is also generated by this light.

  In FIG. 2B, the candle 18 has fallen, and the flame 20 has burned onto the cloth 25 on the desk 24. In FIG. 3A, the flame 20 that has burned out further spreads and spreads, and the cloth is burned off by the cloth pieces 26 and 28. Moreover, the color of the cloth pieces 26 and 28 is also gradually blackened. In FIG. 3B, the cloth is burned off by the cloth pieces 26, 27, and 28, and the color is further black. Also, the burned pieces 26 and 28 are starting to fall down due to gravity (or wind).

  As described above, the present embodiment realistically represents a state in which the flame that has been burned on the cloth gradually spreads and the cloth burns off and disappears. And in order to implement | achieve such a burning torn expression of a cloth, in this embodiment, the method demonstrated below is employ | adopted.

  In other words, in this embodiment, as shown by A1 in FIG. 4, adjacent nodes are connected by a virtual spring (binding force in a broad sense), and a cloth object is expressed using a plurality of nodes arranged in a lattice shape. is doing. Then, as shown by A2 in FIG. 4, the image of the cloth object is generated by drawing a polygon (primitive surface in a broad sense) including these nodes as vertices (definition points in a broad sense).

  In this embodiment, when the flame has burned onto the cloth and it is determined that a certain node has been burned out (when it is determined that the node has become invalid), as shown in A3 of FIG. 4, the burned-out node and its adjacent node The virtual spring (binding force in a broad sense) that was connected to is invalidated. Further, as shown at A4 in FIG. 4, a polygon including a burned-out node as a vertex is hidden (drawing omitted).

  By doing in this way, in this embodiment, cloth can be burned gradually and it can be expressed realistically that cloth is burned off. That is, as the non-display area of the cloth as shown by A4 in FIG. 4 gradually expands, the appearance of the cloth burning is realistically expressed. Also, the state shown in A5 of FIG. 4 is cut off from the part shown in A6 and dropped by gravity (or wind) or the like, so that the cloth can be burned off in a realistic manner.

  In addition, the present embodiment has an advantage that it is possible to realize the burning-out representation of the cloth without changing the data structure of the cloth object.

  For example, FIGS. 5 and 6 show the data structure of the cloth object used in this embodiment. FIG. 5 is an example of a data structure for nodes, and FIG. 6 is a data structure for virtual springs (binding force) that connect the nodes.

  As shown in FIG. 5, each node has a node position p, velocity v, acceleration a, mass M, and burnup parameter F (node state parameter in a broad sense) as its attribute data. These attribute data can be read by specifying the indices i and j of the node.

  As shown in FIG. 6, each virtual spring has, as its attribute data, a tension T and a drag D acting between the nodes, a static distance R (a distance at which the tension becomes 0), and a node A connected to one end of the virtual spring. Index i, j of node B and index i, j of node B connected to the other end. These attribute data can be read by designating the index K of the virtual spring.

  For example, the first and second methods can be considered as a method for realizing the burning and tearing expression of the cloth.

In a first approach, if it is determined that the fabric is torn burning, a fabric object OB ₁ representing the fabric before burning Tochigi, fabric objects OB _1-1 representing the fabric after burning torn switches to OB _1-2 By doing so, it realizes the expression of burning and tearing of cloth.

  However, this first method has problems such as a uniform image to be generated and an increase in storage capacity of object data.

In the second method, when it is determined that the cloth is burned off, the cloth object OB ₁ is divided in real time, and cloth objects OB _1-1 and OB _1-2 representing the cloth after being burned off are generated in real time. To do.

  However, in this second method, the data structure of the cloth object changes, so the processing becomes complicated, or the amount of data increases each time the cloth burns off, so the amount of data used in the memory increases. There is a problem.

  According to the present embodiment, as apparent from FIGS. 5 and 6, the data structure and the data amount of the cloth object do not change even when the cloth is burned or burnt off. Accordingly, it is possible to generate a realistic image representing how the cloth is burned off with a small amount of data and a small processing load.

2.2 Burnup (Node State) Parameters In this embodiment, as shown in FIG. 5, the burnup (node state) parameter F is included in the attribute data of each node. In the present embodiment, by effectively using the burnup parameter F, it has succeeded in realizing the spread of the flame and the expression of the burned-off of the cloth with a simple process.

  For example, as shown in FIG. 7A, in the initial state, the burnup parameter F is set to 1000 (first value) in all nodes. This F = 1000 indicates that the node is not burned.

  Then, when the flame burns to the node for some reason, the value of the burnup parameter F at that node is decreased by 1 and changed to 999, as indicated by C1 in FIG. 7B. When the burn-up parameter F of the node becomes smaller than 1000 in this way, the combustion state (node state) is transmitted from the node to the adjacent node.

  That is, the flame burns out to a node randomly selected from adjacent nodes (including its own node). For example, in FIG. 8A, the fire has been burned from the node indicated by D1 to the node indicated by D2, and the value of the burnup parameter F of the node indicated by D2 where the flame has been burned is also decreased by 1, and changed to 999. To do.

  In this case, the flame starts to burn not only from the node indicated by D1 in FIG. 8A but also from the node indicated by D2 to the adjacent node. Further, the value of the burnup parameter F of the node indicated by D1 is further decreased by 1 and changes to 998.

  Once the flame has burned out, the burn-up parameter at that node continues to decrease by one every one or more frames. In the node indicated by D3 in FIG. 8B, the burnup parameter F = 0, and it is determined that the node has been burned out (invalidated). Then, the virtual spring that connects the node and the adjacent node is also invalidated.

  Thus, if the node has the burnup parameter F as attribute data, it is determined whether or not the node is in a burning state, a process of burning the flame to an adjacent node, a determination whether or not the node is burned out, A process for invalidating a virtual spring of a burned-out node can be centrally processed using one burnup parameter F. Therefore, the processing can be simplified and the processing load can be reduced.

  In this embodiment, the burnup parameter F is also effectively used for the generation of flame particles. That is, based on the burnup parameter F of each node, it is determined whether or not flame particles are generated from that node. Then, when it is determined that it occurs, flame particle attribute data (flame strength, etc.) is determined based on the burnup parameter F.

  More specifically, in the present embodiment, as indicated by E1 and E2 in FIG. 9, a random number of nodes out of nodes (burning nodes) where the burnup parameter F is smaller than 1000 (burning nodes). Select a node. Then, flame particles are generated from the selected node. At this time, the flame strength IF of the generated flame particles is calculated based on the burnup parameter F.

  For example, if IF = sin (π × F / 1000), when the burnup parameter F = 1000, the flame strength IF = 0, when F = 500, the IF is maximum, and when F = 0. The flame strength returns to IF = 0. That is, when the flame starts when the node starts to burn, the flame strength of the flame particle is weak and then gradually increases. When the node burns out, the flame strength of the flame particle becomes zero. Therefore, the flame strength of the flame particles can be expressed more realistically.

  In the present embodiment, the speed, acceleration, life, light intensity, etc. of the flame particles are obtained based on the flame intensity IF of the flame particles obtained based on the burnup parameter F.

  By the way, in this embodiment, by using flame particles that are sequentially generated, moved, and disappeared with the passage of time, as shown in FIGS. 2 (A), (B), FIGS. Has succeeded in expressing the flame 20 that changes into an irregular shape.

  Here, the flame particle may be a three-dimensional object such as a sphere, or may be a planar object. Alternatively, it may be a line or a point.

  In the case of adopting plane-shaped flame particles, as shown in FIG. 10, the main surface of the flame particle FP is substantially perpendicular to the line (or line-of-sight vector) connecting the viewpoint VP and the flame particle FP. It is desirable to arrange FP so that it becomes. Thus, if the flame particles are expressed by so-called 3D sprites, the flame particles FP are always at the maximum size when viewed from the viewpoint VP even when the relative positional relationship between the viewpoint VP and the flame particles FP changes. It will be displayed. Therefore, it is possible to efficiently express an irregular display such as a flame without increasing the number of flame particles FP so much.

  In the 3D sprite of FIG. 10, the α value (transparency) of the region where the flame picture is drawn is set to a value other than 0 (0 <α ≦ 1), and the α value of the other region is , 0 (transparent). In this way, it is possible to represent a flame particle having a drop shape while using a rectangular polygon.

  Next, a specific method for controlling flame particles will be described.

  For example, in FIG. 11A, the flame 20 that shines on the candle 18 is represented by flame particles that are sequentially generated from the generation position 40. Each of these flame particles is generated at the generation position 40, then moves upward (Y direction), and disappears when the lifetime is exhausted. By generating such flame particles one after another from the generation position 40, the flame 20 as shown in FIG. 11A can be expressed.

  In this case, in this embodiment, the movement state (speed or acceleration, etc.) and life of the flame particles change randomly. Therefore, even if a plurality of flame particles are generated at the same time, the range occupied by the plurality of flame particles has a certain extent (area), so that the flame 20 of the candle 18 can be expressed realistically. Become.

  In FIG. 11B, the candle 18 has fallen and the flame has burned onto the cloth 25. In this case, as indicated by B1 in FIG. 6B, flame particles are sequentially generated from the positions of nodes randomly selected from the nodes where the flame has burnt out. Also, the amount of flame particles generated changes randomly.

  In FIGS. 12A and 12B, as shown in B2 and B3, the range of the node where the flame has burned out (the spread range of the flame) is further expanded, and flame particles are generated from various places on the cloth 25. ing. As a result, it is possible to realistically express how the flame burns and spreads on the cloth 25.

  In FIGS. 13A and 13B, the range of burning spreads over the entire cloth 25. In this case, in this embodiment, the generation amount, generation position, movement state, and life of the flame particles change randomly, and the position of each flame particle also changes in real time. Accordingly, as shown in FIGS. 13A and 13B, the overall shape of the flame changes as if it were a real-world flame, so that a very realistic flame image can be generated. Become.

  In the present embodiment, an image in the vicinity of the node (an image of a primitive including the node as a definition point) is changed based on the burnup parameter F.

  For example, in FIG. 14, the color (R, G, B) of each node is a function of the burnup parameter F. That is, the smaller the burnup parameter F, the closer the color is to black. Accordingly, among the nodes indicated by G1 to G4 in FIG. 14, the color of the node indicated by G2 is the blackest.

  In the present embodiment, the color of each node obtained based on the burnup parameter F is set as the vertex color of the polygons 50 and 52. That is, the colors of the nodes indicated by G1, G3, and G4 are set as the three vertex colors of the polygon 50, and the color of each dot in the polygon 50 is obtained by interpolating these three vertex colors. Similarly, the colors of the nodes indicated by G1, G2, and G4 are set as the three vertex colors of the polygon 52, and the color of each dot in the polygon 52 is obtained by interpolating these three vertex colors.

  FIGS. 15A, 15B, 16A, 16B, 17A, and 17B show examples of cloth object images whose images gradually change according to the method of this embodiment. Show.

  The flame gradually burns and spreads from the portion indicated by F1 in FIG. Therefore, the color of the portion indicated by F1 gradually becomes black from the original color.

  In the portion indicated by F2 in FIG. 16A, the nodes are burned out by the flame, the virtual springs connected to the nodes become invalid, and the polygons including these nodes are gradually hidden. . Moreover, the whole cloth is gradually blackened.

  In F3 of FIG. 16B, the range of the burned-out node is further expanded. In FIGS. 17A and 17B, the portions indicated by F4, F5, and F6 are burned off and separated from the other portions. In addition, the color of the cloth becomes even blacker.

  As described above, according to the present embodiment, it is possible to generate an image that looks as if the cloth is really burning, and the virtual reality of the player can be greatly enhanced.

3. Processing of this embodiment Next, a detailed example of the processing of this embodiment will be described with reference to the flowcharts of FIGS. 18, 19, 20, 21, and 22.

  First, cloth object setting (construction) processing is performed (step S1). Specifically, as shown in the flowchart of FIG. 19, first, an initial value is set to the burnup parameter F of each node (step S11).

  Here, F = 1000 indicates that the node is not burned, 0 <F <1000 indicates that the node is in a burning state, and F = 0 indicates that the node is burned out. In the initial state, since all the nodes are not burned, the burnup parameter F of all the nodes is set to 1000.

  Next, initial values are set for the remaining attribute data (see FIG. 5) other than the burnup parameter F of each node (step S12).

Position p _{i, j} ← Constant (x _{i, j} , y _{i, j} , z _{i, j} )
Speed v _{i, j} ← Constant (0.0, 0.0, 0.0)
Acceleration a _{i, j} ← Constant (0.0, 0.0, 0.0)
Mass M _{i, j} ← Constant m _{i, j}
The position p _{i, j} , velocity v _{i, j} , and acceleration a _{i, j} are vectors.

  Next, the index of the connection node is set for all the virtual springs so that adjacent nodes are connected in a grid pattern (step S13).

  Next, a constant is substituted into the remaining parameters for each virtual spring (step S14).

Tension T _S ← Constant t _S
Drag D _S ← constant d _S
Static distance R _S ← constant r _S
As described above, the cloth object setting process ends.

  Next, as shown in FIG. 18, the drawing area (frame buffer or the like) is cleared and frame processing is started (step S2).

  Next, burnup processing (burn spread determination) is performed (step S3).

More specifically, as shown in FIG. 20, it is determined whether or not the burnup parameter F _{i, j} of the node i _{, j} is 0 <F _{i, j} <1000 (step S21). If 0 < _{Fi, j} <1000, it is randomly determined whether or not to burn the adjacent node of the node (step S22).

If it is determined to burn, as shown in FIG. 23A, one randomly selected node is selected from the nodes k and l adjacent to the nodes i and j, and the combustion of that node is selected. 1 is subtracted from the degree parameter F _{k, l} (step S23). As a result, the burnup degree of the node is transmitted to the adjacent node.

F _{k, l} ← F _{k, l} −1
Here, k, l means all combinations of k, j such that k = i-1, i, i + 1, l = j-1, j, j + 1, as shown in FIG. To do.

  As described above, the burnup processing is completed.

  Next, as shown in FIG. 18, processing for applying wind and gravity forces to all nodes is performed according to the following equation (step S4).

  Next, binding force processing (binding force determination) is performed (step S5).

More specifically, as shown in the flowchart of FIG. 21, first, it is determined whether or not any of the burnup parameters F _A and F _B of the two nodes A and B connected to the virtual spring is zero ( Step S31). When either F _A or F _B is 0, the virtual spring is invalidated as described in A3 of FIG. On the other hand, if both F _A and F _B are not 0, the force of the virtual spring as shown in the following equation is applied to the two connected nodes A and B (step S32).

  As described above, the binding force process ends.

  Next, as shown in FIG. 18, the position p (vector) is determined based on the acceleration a (vector) and the velocity v (vector) for all nodes (step S6).

v ← v + a
p ← p + v
a ← 0
Next, a random number of nodes are selected from the nodes where the burnup F is 0 <F <1000, and flame particles are generated from the positions of the nodes as described in FIG. 9 (step S7). ). At this time, the flame strength IF of the flame particle is expressed by the following equation.

  Next, a cloth object drawing process is performed (step S8).

  More specifically, as shown in FIG. 22, first, four nodes i, j, i + 1, j, i + 1, j + 1, i, j + 1 that form a quadrangle adjacent to each other are selected (step S41).

  Next, in order to draw a polygon, a vertex position and a vertex color are determined using the position p and the burnup parameter F for each node (step S42).

  Next, if none of the nodes i, j, i + 1, j, i + 1, j + 1 have a burnup parameter F = 0, a triangle polygon having these three nodes as vertices is drawn. (Step S43). For example, in FIG. 23B, when there is no node where F = 0 among the nodes i, j, i + 1, j, i + 1, j + 1, the polygon PL1 is drawn.

  Next, if none of the nodes i, j, i + 1, j + 1, i, j + 1 has a burnup parameter F = 0, a triangular polygon having these three nodes as vertices is drawn. (Step S44). For example, in FIG. 23B, when there is no node where F = 0 among the nodes i, j, i + 1, j + 1, i, j + 1, the polygon PL2 is drawn.

  Next, using these four nodes i, j, i + 1, j, i + 1, j + 1, i, j + 1, it is determined whether at least one polygon has been drawn (step S45). The process proceeds to step S48, and if not drawn, the process proceeds to step S46. That is, if any of the polygons PL1 and PL2 in FIG. 23B is drawn, the process proceeds to step S48, and if neither is drawn, the process proceeds to step S46.

  In step S46, if there is no node i, j, i + 1, j, i, j + 1 that has no burn-up parameter F = 0, a triangular polygon having these three nodes as vertices is selected. draw. For example, in FIG. 23C, when there is no node where F = 0 among the nodes i, j, i + 1, j, i, j + 1, the polygon PL3 is drawn.

  Next, if none of the nodes i + 1, j, i + 1, j + 1, i, j + 1 has a burn-up parameter F = 0, a triangle polygon having these three nodes as vertices is drawn. (Step S47). For example, in FIG. 23C, when there is no node where F = 0 among the nodes i + 1, j, i + 1, j + 1, i, j + 1, the polygon PL4 is drawn.

  The above processing is repeated until all the nodes i and j are finished (step S48).

  Note that the processing as shown in steps S43 to S47 is performed for the following reason.

  That is, in FIG. 23B, for example, when the burn-up parameter F of the nodes i and j is 0 (when burned out), the polygons PL1 and PL2 are not drawn by the processing in steps S43 and S44.

  However, even in such a case, in step S47, only the polygon PL4 is drawn (PL3 is not drawn), and a correct result can be obtained.

  Similarly, in FIG. 23B, for example, when the burn-up parameter F of the nodes i + 1 and j + 1 is 0, the polygons PL1 and PL2 are not drawn by the processing of steps S43 and S44.

  However, even in such a case, in step S46, only the polygon PL3 is drawn (PL4 is not drawn), and a correct result can be obtained.

  As described above, the cloth object drawing process is completed.

  Finally, as shown in FIG. 18, the drawn cloth object is displayed on the display unit, and the frame processing is ended (step S9).

4). Hardware Configuration Next, an example of a hardware configuration capable of realizing the present embodiment will be described with reference to FIG.

  The main processor 900 operates based on a program stored in the CD 982 (information storage medium), a program transferred via the communication interface 990, or a program stored in the ROM 950 (one of information storage media). Various processes such as processing, image processing, and sound processing are executed.

  The coprocessor 902 assists the processing of the main processor 900, has a product-sum calculator and a divider capable of high-speed parallel calculation, and executes matrix calculation (vector calculation) at high speed. For example, if a physical simulation for moving or moving an object requires processing such as matrix operation, a program operating on the main processor 900 instructs (requests) the processing to the coprocessor 902. )

  The geometry processor 904 performs geometry processing such as coordinate transformation, perspective transformation, light source calculation, and curved surface generation, has a product-sum calculator and a divider capable of high-speed parallel computation, and performs matrix computation (vector computation). Run fast. For example, when processing such as coordinate transformation, perspective transformation, and light source calculation is performed, a program operating on the main processor 900 instructs the geometry processor 904 to perform the processing.

  The data decompression processor 906 performs a decoding process for decompressing the compressed image data and sound data, and a process for accelerating the decoding process of the main processor 900. As a result, a moving image compressed by a given image compression method can be displayed on an opening screen, an intermission screen, an ending screen, a game screen, or the like. Note that the image data and sound data to be decoded are stored in the ROM 950 and the CD 982 or transferred from the outside via the communication interface 990.

  The drawing processor 910 performs drawing (rendering) processing of an object composed of primitive surfaces such as polygons and curved surfaces at high speed. When drawing an object, the main processor 900 uses the function of the DMA controller 970 to pass the object data to the drawing processor 910 and transfer the texture to the texture storage unit 924 if necessary. Then, the rendering processor 910 renders the object in the frame buffer 922 at high speed while performing hidden surface removal using a Z buffer or the like based on the object data and texture. The drawing processor 910 can also perform α blending (translucent processing), depth cueing, mip mapping, fog processing, trilinear filtering, anti-aliasing, shading processing, and the like. When an image for one frame is written in the frame buffer 922, the image is displayed on the display 912.

  The sound processor 930 includes a multi-channel ADPCM sound source and the like, and generates high-quality game sounds such as BGM, sound effects, and sounds. The generated game sound is output from the speaker 932.

  Operation data from the game controller 942, save data from the memory card 944, and personal data are transferred via the serial interface 940.

  The ROM 950 stores system programs and the like. In the case of the arcade game system, the ROM 950 functions as an information storage medium, and various programs are stored in the ROM 950. A hard disk may be used instead of the ROM 950.

  The RAM 960 is used as a work area for various processors.

  The DMA controller 970 controls DMA transfer between the processor and memory (RAM, VRAM, ROM, etc.).

  The CD drive 980 drives a CD 982 (information storage medium) in which programs, image data, sound data, and the like are stored, and enables access to these programs and data.

  The communication interface 990 is an interface for transferring data to and from the outside via a network. In this case, as a network connected to the communication interface 990, a communication line (analog telephone line, ISDN), a high-speed serial bus, or the like can be considered. By using a communication line, data transfer via the Internet becomes possible. Further, by using the high-speed serial bus, data transfer with other game systems becomes possible.

  All of the means of the present invention may be executed by hardware alone, or may be executed only by a program stored in an information storage medium or a program distributed via a communication interface. Alternatively, it may be executed by both hardware and a program.

  When each means of the present invention is executed by both hardware and a program, a program for executing each means of the present invention using hardware is stored in the information storage medium. Become. More specifically, the program instructs each processor 902, 904, 906, 910, 930, etc., which is hardware, and passes data if necessary. Each processor 902, 904, 906, 910, 930, etc. executes each means of the present invention based on the instruction and the passed data.

  FIG. 25A shows an example in which the present embodiment is applied to an arcade game system. The player enjoys the game by operating the lever 1102, the button 1104, and the like while viewing the game image displayed on the display 1100. Various processors and various memories are mounted on the built-in system board (circuit board) 1106. Information (program or data) for executing each means of the present invention is stored in a memory 1108 which is an information storage medium on the system board 1106. Hereinafter, this information is referred to as storage information.

  FIG. 25B shows an example in which the present embodiment is applied to a home game system. The player enjoys the game by operating the game controllers 1202 and 1204 while viewing the game image displayed on the display 1200. In this case, the stored information is stored in the CD 1206, which is an information storage medium that is detachable from the main system, or in the memory cards 1208, 1209, and the like.

  FIG. 25C shows a host device 1300 and terminals 1304-1 to 1304-n connected to the host device 1300 via a network 1302 (a small-scale network such as a LAN or a wide area network such as the Internet). An example of applying this embodiment to a system including In this case, the stored information is stored in an information storage medium 1306 such as a magnetic disk device, a magnetic tape device, or a memory that can be controlled by the host device 1300, for example. When the terminals 1304-1 to 1304-n can generate game images and game sounds stand-alone, the host device 1300 receives a game program and the like for generating game images and game sounds from the terminal 1304-. 1 to 1304-n. On the other hand, if it cannot be generated stand-alone, the host device 1300 generates a game image and a game sound, which is transmitted to the terminals 1304-1 to 1304-n and output at the terminal.

  In the case of the configuration shown in FIG. 25C, each unit of the present invention may be executed in a distributed manner between the host device (server) and the terminal. The storage information for executing each means of the present invention may be distributed and stored in the information storage medium of the host device (server) and the information storage medium of the terminal.

  The terminal connected to the network may be a home game system or an arcade game system. When connecting the arcade game system to a network, a portable information storage device capable of exchanging information with the arcade game system and exchanging information with the home game system. It is desirable to use (memory card, portable game device).

  The present invention is not limited to that described in the above embodiment, and various modifications can be made.

  For example, in the invention according to the dependent claims of the present invention, a part of the constituent features of the dependent claims can be omitted. Moreover, the principal part of the invention according to one independent claim of the present invention can be made dependent on another independent claim.

  Moreover, although this embodiment mainly demonstrated the case where this invention was applied to the cloth object, the object to which this invention is applied is not limited to a cloth object. That is, any object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force may be used. For example, the present invention can be applied to a paper object, a steel plate object, a rock object, and the like.

  Moreover, although this embodiment demonstrated the case where a node becomes invalid because a node burns out, this invention is applicable also, for example, when a node becomes invalid by destruction by a blow etc.

  Further, the data structure of the object is particularly preferably the structure described with reference to FIGS. 5 and 6, but is not limited thereto.

  In the present embodiment, the case where the node state parameter is a burnup parameter has been described. However, the node state parameter of the present invention is a parameter that represents another state of the node (temperature, humidity, intensity, luminous intensity, etc.). May be.

  Further, the display object represented by the particles is not limited to the flame, and various display objects whose shapes are deformed in real time such as an explosion can be expressed.

  Further, it is desirable to express the particles by 3D sprites as shown in FIG. 10, but they may be expressed by solid objects, lines, and points.

  The present invention can also be applied to various games (such as fighting games, shooting games, robot fighting games, sports games, competitive games, role playing games, music playing games, dance games, etc.).

  The present invention is also applicable to various game systems (image generation systems) such as a commercial game system, a home game system, a large attraction system in which a large number of players participate, a simulator, a multimedia terminal, and a system board for generating game images. Applicable.

100 processing unit 102 object space setting unit 104 node state processing unit 106 binding force processing unit 108 node movement processing unit 110 particle processing unit 112 drawing processing unit 160 operation unit 170 storage unit 174 drawing area 180 information storage medium 190 display unit 192 sound output Unit 194 portable information storage device 196 communication unit

Claims (2)

A game system for generating images,
Means for setting in the object space an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force;
Means for changing the node state parameter of an adjacent node of the node based on the node state parameter of the node as attribute data;
Based on the node status parameter having nodes, means for determining the color of the node,
Means for generating an image at a given viewpoint in object space;
A game system comprising: A computer-readable information storage medium,
Means for setting in the object space an object whose shape is specified by a plurality of nodes in which adjacent nodes are connected by a binding force;
Means for changing the node state parameter of an adjacent node of the node based on the node state parameter of the node as attribute data;
Based on the node status parameter having nodes, means for determining the color of the node,
An information storage medium storing a program for causing a computer to function as means for generating an image at a given viewpoint in an object space.

Images