JP3130496B2 - A method for creating spatial information in a pseudo three-dimensional game space, a method for determining contact between a pseudo three-dimensional image and a movable model, a contact determination device, and a readable recording medium storing a program for performing such contact determination - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a virtual three-dimensional space information defined in either the sky or the dense state, for example, a virtual model having a stationary model simulating a building including a fortress, a cave, or the like. How to create spatial information in game space, etc.
The present invention relates to a method for determining contact between a pseudo three-dimensional image and a movable model such as a character, a contact determination device, and a readable recording medium storing a program for performing such contact determination.

[0002]

2. Description of the Related Art Conventionally, a pseudo three-dimensional game space has been constructed, in which a flight is performed based on a stationary model of a building or the like, an enemy aircraft model controlled by a computer, and an operation of a player. 2. Description of the Related Art There has been known a game machine in which a player is displayed on a two-dimensional monitor as a movable model that moves (moves) and a battle game is played. Each of the above models is composed of the required number of polygons, so it is determined whether the bullet fired from the own aircraft aimed at the enemy aircraft and landed on the static model or whether the own aircraft touched the static model Is a problem.

[0003] In this case, if the pseudo space is in the air or the universe and the relationship with the static model is under certain restrictions, for example, the data on the static model is represented by two-dimensional polygon vertex coordinates and its height data. In a simple case that can be expressed, the contact determination is relatively easy because the arithmetic processing related to contact determination can be processing that does not require multiplication, such as height check and matching processing of polygon vertex coordinate data. is there.

On the other hand, generally, vertex coordinates are extracted one by one between a polygon on the movable model side and a large number of polygons on the stationary model side, and the distance between the two is multiplied. It is desired that the operation be performed in a state where the player does not feel uncomfortable.
By this contact determination, the next operation, for example, a crash operation is performed, or a sound indicating contact is emitted to create a sense of reality.

[0005]

The recent battle games are:
Static models tend to be complex and refined,
The number of polygons defined by three-dimensional vertex coordinates representing a static model is also increasing. In such a situation, if the contact with the movable model is determined by multiplying the distance between the polygon vertex coordinates, it can be performed hundreds or thousands of times within a time shorter than the frame speed at which the game image is rewritten. It is necessary to perform the contact determination by performing the multiplication described above, but it is extremely difficult to perform an operation that takes a short time within one frame time.

For this reason, for example, a collision-determining obstacle having a square shape is provided at a position where there is a possibility of contact to shorten the calculation processing time required for contact determination.
There has been proposed a device in which the range of movement of the own device is restrictedly controlled so as to reduce the possibility of contact. However, in the above-described various solutions, other problems such as unnaturalness and unnaturalness of the contact, and unnaturalness and coarseness of the image occur in the other aspects.

[0007] The present invention has been made in view of the above,
By reducing the amount of data by accurately classifying a pseudo three-dimensional space having a static model, which has no direct relationship with polygons, into three states: sky, dense, and a mixture of sky and dense Pseudo 3 which is advantageous for usability and high speed
Provided is a method for creating three-dimensional space information, a method for determining contact between a pseudo three-dimensional image and a movable model, a device for determining contact, and a readable recording medium storing a program for performing contact determination, which is excellent in high speed. It is intended for.

[0008]

According to the first aspect of the present invention, there is provided a method for creating spatial information in a pseudo three-dimensional game space, comprising the steps of: The pseudo three-dimensional space defined in either the sky or the dense state, which has been recalculated into a solid model, is spatially divided into a plurality of blocks, and each block is sequentially subdivided until it reaches a unit small space. Into a plurality of blocks in the direction of segmentation, and in one stage in the segmentation direction, each of a plurality of blocks segmented by one stage forming a block in the segmentation stage is Depending on the spatial state occupied by the block, it is classified into one of sky, dense, and a mixture of sky and dense, and for this block classified as mixed in this classification The blocks classified in the mixture are further subdivided until the blocks obtained in the stage toward the subdivision direction in the direction toward the subdivision direction are classified as either empty or dense, up to the minimum unit small space, and each subdivision is performed. In this case, the classification contents at the conversion stage are stored in association with the corresponding blocks.

According to this method, the pseudo three-dimensional space in which the stationary model is arranged is defined as being empty or dense. For example, the inside of a static model composed of a plurality of polygons is a solid state model in a dense state. Then, this space is divided into a plurality of blocks and divided into blocks, and each block is divided into a plurality of blocks sequentially in the direction of subdivision until reaching a unit small space. Moreover,
In one stage in the subdivision direction, for each of a plurality of blocks subdivided by one stage forming a block in the subdivision stage, empty, dense, and It is classified as either a mixture of sky and dense. At this time, the blocks classified as mixed are further subdivided until the blocks obtained in the stage toward the subdivision direction further down to the minimum unit small space are classified as either empty or dense. Has been done. The obtained classification content at each subdivision stage is stored in the storage medium in association with the corresponding block.

In this case, the data indicating the classification contents of empty, dense, and mixed stored corresponding to each of the above blocks has a predetermined data length. If the data to be indicated is a mixture, data specifying a one-stage subdivided block to be read next may be added. In this way, the data length is constant, which is extremely effective for data processing by a computer. In addition, when determining the state of space, the next block position is specified as it is, so that a separate position specification is required. It becomes unnecessary. If the block is empty or dense, there is no need to determine the state of the block any more, so there is no need to have more data than necessary.

According to a third aspect of the present invention, there is provided a method for judging contact between a pseudo three-dimensional image and a movable model in a pseudo three-dimensional game space. 3. A method according to claim 1, wherein when a region is defined as dense and a region including a boundary surface is defined as mixed, a contact between a movable model and a stationary model movable in a pseudo three-dimensional space is determined. The classification contents obtained by the method of creating spatial information in the three-dimensional game space are stored in a storage medium, and the subdivision is sequentially performed from one or a required maximum number of blocks adjacent to the position of the movable model in the pseudo three-dimensional space. For each block, read out the classification contents in the block at each stage, and determine whether or not the classification contents in the block have a mixture. It is intended to certify the contact if there is a kind.

[0012] According to this method, the classification contents in the blocks in each stage are sequentially divided into the subdivided blocks starting from one or the largest required block adjacent to the position of the movable model in the pseudo three-dimensional space. Is read, and it is determined whether or not there is a mixture in the classification contents in each block. If there is a classification corresponding to the mixture, it is determined that the block is in contact with the movable model.

In this case, it is preferable to locate the most subdivided block classified as mixed.
Thereby, the positional accuracy of the contact increases.

Further, in the method for judging contact between a pseudo three-dimensional image and a movable model in a pseudo three-dimensional game space according to claim 3 or 4, the classification contents of the largest block read are temporarily stored in an auxiliary memory. In the meantime, when the block is specified later, a read instruction is issued to the auxiliary memory instead of the recording medium on the condition that the classification content of the block is stored in the auxiliary memory. Is preferred. The movable model may be stopped or moved at a low speed in the pseudo three-dimensional game space.
In such a case, the read block for contact determination may be the same. Therefore, if the read data is temporarily stored in the auxiliary memory, the data of the same block does not need to be read each time, and the data reading time can be shortened accordingly. In particular, when block data is stored in a compressed form on a storage medium, it is possible to contribute to faster processing by considering that data reading, that is, data decompression (decompression) requires a relatively long time. Become.

According to a sixth aspect of the present invention, in the pseudo three-dimensional game space, the apparatus for determining contact between a pseudo three-dimensional image and a movable model has an empty area in the pseudo three-dimensional space where no static model exists. 3. An apparatus for determining contact between a movable model and a stationary model movable in a pseudo three-dimensional space when a region is defined as dense and a region including a boundary surface is defined as a mixture, wherein the pseudo 3 according to claim 1 or 2. A storage medium for storing the classification contents obtained by the method of creating spatial information in the three-dimensional game space, position detecting means for detecting the position of the movable model in the pseudo three-dimensional space, Reading means for reading, from the storage medium, the contents of classification in the blocks at each stage from the largest block to the blocks subdivided sequentially; Determining means for determining whether there is a mixed class content, in which a certification means for certifying the contact when it is determined that a classification corresponding to the mixing.

According to this configuration, when the position of the movable model in the pseudo three-dimensional space is detected by the position detection means, the reading means detects the position of the movable model near the detected position of the movable model.
Alternatively, the classification contents in the blocks at each stage are read out from the storage medium in order from the largest required block to the subdivided block. Then, the judging means judges whether or not there is a mixture in the classification contents in each block. If there is a classification corresponding to the mixture, the judging means judges that the block and the movable model have come into contact with each other.

Further, it is preferable to provide a detecting means for detecting the most subdivided block classified as mixed. By detecting the most subdivided block, the contact position can be detected with high accuracy.

Further, in the device for judging contact between a pseudo three-dimensional image and a movable model in a pseudo three-dimensional game space according to claim 6 or 7, an auxiliary memory for temporarily storing the readout contents of the largest block. Read control means for instructing a readout to the auxiliary memory instead of the recording medium on condition that the contents of classification of the block are stored in the auxiliary memory, when the block is specified later; Is preferably provided.

In a readable recording medium according to the present invention, an area in a pseudo three-dimensional space where a static model does not exist is defined as empty, an existing area is defined as dense, and an area including a boundary surface is defined as mixed. When determining the contact between a movable model and a stationary model that can move in a pseudo three-dimensional game space,
A storage medium storing classification contents obtained by the method for creating spatial information in a pseudo three-dimensional game space according to claim 1 or 2, which is located near a detection position of the movable model in the pseudo three-dimensional space. While sequentially reading the classification contents in the block at each stage from the largest block to the sequentially subdivided block, it is determined whether or not the classification contents in the block have a mixture, and If there is a corresponding classification, a contact between the pseudo three-dimensional image recognized as contact and the movable model is determined.

In the above, it is preferable to locate the most subdivided block classified as mixed.

[0021]

FIG. 1 is a block diagram showing an embodiment of a game apparatus to which the present invention is applied. The game device includes a main body control unit 1 composed of a microcomputer and the like, and a storage unit 2 such as a ROM for storing necessary data required for executing the game.

In the storage unit 2, a program storage unit 21
Stores a game program for executing the game. The polygon data storage unit 22 stores a three-dimensional image of each vertex of a polygon constituting each of various models generated in accordance with the progress of the game, such as a background image of a character, which is a movable model, and a building, which is a stationary model, displayed on the screen. The coordinates are stored. The texture data storage unit 23 stores texture data, which is two-dimensional image data attached to each polygon, in association with a corresponding polygon.

The hit judging data storage section 24 is for judging a hit between the movable model and the stationary model. The hit judging data storage section 24 stores a state of a pseudo three-dimensional space, for example, a "dense" state where a stationary model exists (an obstacle is present). , The state of “sky” without obstacles is stored in a predetermined format on the basis of the pseudo space. The memory structure of the hit determination data storage unit 24 will be described later in detail.

The main body control section 1 has a CPU 10 for causing a movable character or the like to fly (move) in accordance with the operation content from the operation section 11 in accordance with the game program, thereby performing a game progress. Part 1
A ROM 12 which stores software of an operation system for causing each unit on the side to perform a basic operation, and a RAM 1 which is used as a work area for temporarily storing various data read from the storage unit 2 as necessary.
3 is provided.

The operation unit 11 includes keys and buttons for giving various necessary movements, actions, and the like for the character, which is a movable monitor displayed on the monitor 17, and for giving necessary instructions such as game selection and start / end. The instruction signal is C
It is led to PU10. The various movements with respect to the movable character include, for example, when the movable model is a flying object, instructions for up, down, left, and right in the flight direction, instructions for speed adjustment, other attack instructions, and the like, and by operating these operation keys and the like. Instructions are available.

The graphics data generation unit 14 performs geometry processing such as coordinate conversion and light source calculation, and uses the coordinate data of each vertex of the polygon in the polygon data storage unit 22 and the movement amount and rotation data input from the CPU 10. The coordinate transformation is performed to obtain new polygon vertex coordinate data. Also, calculate the light source,
The brightness of each vertex of the polygon corresponding to the distance to the virtually set light source is calculated from the newly obtained polygon vertex coordinate data after the coordinate conversion. Further, the graphics data generation unit 14 obtains address data in the texture data storage unit 23 of the texture data to be attached to each polygon by using the polygon vertex coordinate data after the coordinate conversion. Then, the texture data generation unit 14 converts each of the obtained data into C
PU10, and the CPU 10 outputs the received data to R
Store in AM13.

The drawing processing unit 15 performs a drawing process on the frame memory 16 in accordance with a drawing command from the CPU 10. Note that the drawing command includes data obtained by the graphics data generation unit 14. This data is composed of two-dimensional coordinate data among the new polygon vertex coordinate data after the coordinate conversion, and includes polygon vertex address data indicating address data on the frame memory 16 and texture data to be pasted on the polygon. It consists of address data indicating a storage position in the texture data storage unit 23 and brightness data of the polygon.

Then, the drawing processing section 15 pastes a texture on the polygon, that is, performs texture mapping for writing texture data corresponding to the range of polygon vertex address data in the frame buffer 16.

The drawing processor 15 displays all these objects in a pseudo three-dimensional manner. Here, the process of creating a pseudo three-dimensional image will be briefly described. The vertex address data of the polygon can be obtained by replacing the polygon vertex coordinate data in the three-dimensional space with the movement amount data and rotation amount data of the screen itself corresponding to the viewpoint and the line of sight. The coordinate data in the three-dimensional space of each polygon constituting the model thus obtained is temporarily stored in the RAM 13. When the model is moved in accordance with the game program on the screen of the monitor 17, the RAM
Based on the three-dimensional coordinate data of the vertices of each polygon temporarily stored in 13 and the movement amount data and rotation amount data of each polygon, three-dimensional coordinate data after movement and rotation of each polygon are sequentially obtained. . Of the three-dimensional coordinate data of each polygon thus obtained, the coordinate data in the horizontal and vertical directions is used as address data on the display area of the RAM 13, that is, polygon vertex address data. Next, the drawing processing unit 15 writes the texture data indicated by the texture address data assigned in advance to the address of the frame memory 16 indicated by the polygon vertex address data. by this,
On the screen of the monitor 17, a character to which texture data corresponding to each of a large number of polygons is pasted is displayed via the frame memory 16.

The game device of the present embodiment can take various forms such as a so-called arcade game device, a home game machine, and a general personal computer. In the case of an arcade game device, the operation unit 11 includes dedicated operation keys, operation buttons, a multi-directional operation rod, and the like.
Reference numeral 7 also includes a dedicated CRT, a projector, and the like. In the case of a home-use game machine, the above-described operation unit 11 is usually called a controller, and includes a cross key, operation buttons, and a joystick. The monitor 17, the graphics data generation unit 14, the drawing processing unit 15, and the storage units 12, 13, and 16 are all provided in the consumer game machine. As the monitor 17, a TV monitor is often used. In the case of a personal computer, the operation unit 11 may be replaced by an input device such as a keyboard and a mouse, and a graphic display is used as the monitor 17. Further, the monitor 17, the graphics data generator 14, the drawing processor 15, and the storages 12, 13, 16 are all provided in the personal computer. In addition, in the case of a home-use game machine or a personal computer, the game program and the like stored in the storage section 2 of the game program are initially recorded on a computer-readable recording medium such as a floppy disk, CD-ROM, or magneto-optical disk DVD-ROM. The recording medium may be recorded in a medium, and the recording medium may be read by reading means provided in a home-use game machine or the like to be introduced into the main body control unit.

FIG. 2 shows a pseudo three-dimensional space model (hereinafter referred to as a map space). The map space S is, for example, 20000 m (depth) × 2000 m (width) × 2
000m (height), this map space S
Are divided by, for example, a cube having a side of 1 m (hereinafter, referred to as a block B).

The stationary model in the map space S is defined as coordinate data of each vertex of the polygon in the polygon data storage unit 21, and as shown in FIG.
Is composed of an underground model G and a hollow model H crawled within the underground model G. The flying object as a movable model, which will be described later, flies up, down, left, and right in the cavity model H in accordance with the operation status of the operation unit 11 by the player, and the contact determination is mainly based on the contact between the flying object and the cavity wall surface. The presence / absence and / or the contact position are detected.

FIG. 3 is an explanatory diagram showing a procedure for forming a block and hit determination data in the map space S.

In the drawing, B (1) is a block made of the above-mentioned cube having a side of 1 m, and this block B (1)
Is a group as a unit at the time of a search, which is a total of 16 aggregates of 4 adjacent to each other in each of the depth, width and height directions (or a total of 8 aggregates of 2 in each direction). Eight cubes 0.5 m on each side obtained by dividing the one block B (1) into two in the depth, width and height directions are each referred to as a block B (2). Each of the cubes obtained by equally dividing (2) into eight is defined as a block B (3). That is, in the numbers in parentheses attached to the block B, (1) indicates the first stage of the subdivision, (2) indicates the second stage of the subdivision, and (3) indicates the third stage of the subdivision. Is shown. Hereinafter, subdivision is performed for every eight divisions into a unit small space having a size substantially corresponding to the size of one polygon. In FIG. 3, each block B (i) (i is 1, 2,...) Is “sky” in which the underground model G is not included at all.
Is defined as B0 (i) using the suffix “0”, and the “dense” state in which the entire block is filled with the underground model G is defined as B1 (i) using the suffix “1”. When the underground model G is included in a part of (i.e., when the cavity model H is partially included), the state of "mixed" is represented as B2 (i) using the subscript "2". ing. Although not specifically shown in FIG. 3, each of the eight blocks in the same subdivision stage can be specified by another method.

Here, the polygon is usually a plane (surface model) composed of triangles or quadrangles. Therefore, it can be understood that the front side of the polygon constituting the cavity H is “empty”. However, if the surface model is used, the back side of the polygon is also “empty”. As it is, "sky",
It is not possible to create hit determination data that correctly defines the “dense” state. Therefore, the surface model is once again calculated as a solid model (space map S ′) so as to fill the space on the back side of the polygon, that is, the underground side.

In this method, for example, the space that can be moved is a finite space in nature, and the underground that is not otherwise is infinite space. Therefore, when converting data, it is easier to handle the space that can be moved. So, first, about the space that can be moved,
While defining the wall with vertex, ridge and face data,
The front and back sides are defined using the surface (normal) vector, and the space is graphed. Then, based on the obtained graph, for each of the minimum unit meshes, for example, the inside / outside determination of the target coordinates is performed by examining the number of intersections of the search vectors in the up, down, left, right, front and rear directions with the surface. As another method, the same determination can be made by drawing a finite space. In other words, regardless of the front and back of the surface constituting the finite space, a method of examining the number of intersections described above by drawing the static model in a slice shape in order from the depth side, for example, and measuring the number of times of overwriting at this time It is possible to obtain the same result as. In this case, it is necessary to convert the coordinates of the drawing result into corresponding spatial coordinates.

Next, with reference to the drawings in order from the upper side of FIG. 3, a description will be given of a multi-step block forming of the space map S ′ converted into the solid model and a procedure of creating hit determination data.

That is, after the map space S 'defined by the polygons shown in FIG.
The state in each block B (1) is checked by sequentially scanning the map space S ′ in one direction (for example, the width direction) for each first-stage block B (1) in units of
It is classified into “sky”, “dense”, and “mixed” in association with the block position in the map space S ′. At this time, 64
If all of them are “empty”, that is, B0 (1), it can be immediately determined that there is no contact, so that they are collectively B0 (0) (however, (0) means that 64 first blocks have been collected), and Similarly, all 64 are “dense”, ie, B1
In the case of (1), it can be immediately determined that there is a contact, so that it is similarly set to B1 (0). Since further subdivision is unnecessary, the process proceeds to an adjacent block in the same subdivision stage. Thereby, the storage capacity can be reduced. Otherwise, that is, in the case of “mixed”, it is created for each block B (1). The scanning order of the blocks is determined by the map space S ′.
Since it is sufficient to have a corresponding relationship with the upper position, scanning may be performed according to a predetermined rule. For example, in the first stage 64 blocks, the scanning in the width direction is sequentially performed in the depth direction, and when one surface is completed, it may be shifted one stage to the lower side. May be set counterclockwise from the block at the upper predetermined reference position (head block), and then set in the same direction from the block immediately below the lower reference position.

Now, with respect to the block B (1) determined to be "mixed" in the block B (1), that is, the block B (1) determined to be B2 (1), the block B (1) is subdivided and the second stage block ( 8) are formed, and each is classified into “sky”, “dense”, and “mixed” in association with the map space S ′ and in association with the block position. Block B
If “2” is “mixed”, that is, if B2 (2) is present, the block is subdivided and the third-stage block B (3) is set to 8
Individually, each of them is associated with a map space S ′ and classified (B0 (3), B1 (3) or B2 (3)
(3)) is performed. In the following, every time there is "mixed", such subdivision is performed up to the unit small space,
Classify as either “sky” or “dense”. In the example of FIG. 3, the block B (3) is a unit small space. In this case, B2 (3) may not be necessary.

The scanning of the map space S 'is sequentially repeated in units of 64 blocks as one group, so that the entire map space S' can be classified. In this case, in block B (i) at a certain stage in the subdivision direction,
If it is determined that the block is “empty” or “dense”, no further subdivision is required for this block, and there is no need to have data for the block. Therefore, the memory capacity of the storage medium for storing the hit determination data Can be reduced. Theoretically, 3
Since only two states need to be stored so as to be identifiable, only two bits are required. According to this, it is possible to greatly reduce the memory capacity of the vertex coordinate data of the polygon in the type of performing the hit determination using the polygon.

As will be described later, the contact between the movable model and the stationary model is determined based on the pseudo three-dimensional spatial coordinates (x, y, z), while the hit determination data is determined by blocks. Because they are defined, both dimensions must be matched (matchable).
Therefore, a conversion table with at least the coordinates (x, y, z) of the reference block among the blocks in each group is simultaneously created and saved in association with the scanning of the map space S ′ at the time of hit determination data creation. Need to be kept. In FIG. 1, this conversion table is stored in the hit determination data storage unit 24.
Is stored in association with a block. This makes it possible to specify a group within a range that comes into contact with the movable model. Further, based on a reference block in the group, (x) of all blocks (including each subdivision step) in the group , Y, z) coordinates can be calculated. Therefore, the contact position detected by the contact determination can be converted from the block into (x, y, z) coordinates and output, that is, obtained.

FIG. 4 is a diagram showing an example of “sky”, “dense”, and “mixed” in one group as viewed from above (in one coordinate axis direction). In this figure, the upper 16 blocks B (1) are visible.

In the figure, the side wall of the cavity H crosses obliquely from upper left to lower right. Then, of the 16 blocks B (1), three “dense” completely contained in the ground (represented by “1” in the figure) and 10 completely “empty” in the figure. (Represented by “0” in the figure), and the remaining three are “mixed”. “Mixed” is subdivided 2
As a stage, it is divided into eight, but in FIG. 4, only the upper four are seen in each block B (2). In block B (2), block B (2) at the upper right of the figure
Is “dense”, the lower left block B (2) is “empty”, and the lower right and upper left blocks B (2) are “mixed”. Therefore, these "mixed" blocks B (2)
It is divided into eight as the third stage of subdivision (only four upper surfaces are visible), and each block B (3) is “empty”,
Classified as "dense". Now, assuming that B (3) is a unit small space, the hit position is detected by the size of this block B (3) (a cube having a side of 0.25 m in this embodiment).

In the present embodiment, the state of "empty", "dense", "mixed" is defined as hit determination data for each block, and data indicating the position of a block to be searched next to the current block, The data means the final stage of the subdivision of the data, and is basically defined using 16 bits per block for the convenience of the microcomputer.

Returning to FIG. 1, the main body control section 1 includes a hit judging processing means 101, a hit judging data reading means 102 and a data expanding means 103. The hit judging processing means 101 performs hit judgment by searching for hit judgment data of a block near the position data in the pseudo three-dimensional space of the flying object that is a movable model. Hit determination data reading means 10
Numeral 2 designates at least a group including the position data of the flying object, and takes it into the RAM 13 of the main body control unit 1 from the hit determination data storage unit 24. Since the hit determination data in the hit determination data storage unit 24 is stored in the form of data compression, the data expansion means 103 performs data expansion to the original data format that can be recognized by the computer when reading this data. It is.

The hit determination data is developed in the RAM 13 by quantitative data including one or a predetermined number of groups. The data amount of the hit determination data storage unit 24 is not constant depending on the shape or the like of the static model in the map space S ′, that is, depending on the presence or absence and the number of “mixed”. However, if the amount of data to be expanded is not constant, the CPU 10
Since it is necessary to separately manage the data position (that is, the address), the load on the software increases correspondingly, and extra time is spent for data search. Therefore, the hit determination data is divided into certain transfer areas, and the data is collectively transferred in units of the corresponding transfer areas according to the transfer instruction. The start of the transfer area starts from the group and ends when the fixed data amount is reached, and the next transfer area is set so that the group containing the interrupted data becomes the top, which causes data loss. I try not to. The data transfer may be performed one by one or a required number of groups. The CPU 10 stores, in association with the address of the RAM 13, which transfer area the data that has been expanded and taken into the RAM 13 is associated with the address of the RAM 13, and whether the data has been updated (erased from the RAM 13) later by newly transferred data. We also manage whether or not.

In the RAM 13, a fixed memory capacity of the data amount included in the transfer area at least once, preferably a plurality of times (to be used in step S15 shown in FIG. 6) is prepared, and the address Along with this, data for the transfer area is sequentially expanded and stored. The hit determination data storage unit 24 is sequentially provided according to the deployment instruction.
Is written while updating old data at an address immediately downstream of the immediately preceding read data. The data in the plurality of transfer areas is pre-expanded and stored in the RAM 13
In the RAM when hitting
The data already expanded in the storage area 13 is effectively used, so that it is not necessary to expand the data each time, and the time required for the expansion processing is reduced.

FIGS. 5A and 5B are views showing an example of a model of a flying object, wherein FIG. 5A is a plan view and FIG. 5B is a side view. The aircraft model A simulates a general fighter having a substantially conical fuselage, left and right wings and a tail, and the aircraft model A collides with a stationary model in the map space S ′. One or two or more required points are set for use in the determination. That is, there are a total of five points P1 to P5 of the nose and rear end, the left and right wing tips, and the tail wing tips. As described above, when the flight direction can be changed in the up, down, left, and right directions in addition to the front in accordance with the operation from the operation unit 11 (in some cases, further retreat), a contact determination point is set around the flight model A. If this is the case, it is possible to confirm the presence or absence of a contact that is closer to the actual vehicle without a sense of incongruity, and to perform a contact operation to be given to the flying object (a display of damage to the flying object model, a turning display indicating a crash, generation of a contact or collision sound, etc.). It should be noted that only one point P1 of the nose position or points P1, P2,
The three points P3 may be used. When it is necessary to judge the landing on the ground surface or the like, the point P5 may be adopted as one point on the fuselage bottom surface side. In addition, as in the present embodiment, especially in the case of a device having a ceiling, it is important to determine the contact with the ceiling surface. Therefore, the use of the point P4 is significant.

FIG. 6 is a flowchart showing a subroutine for judging the contact between the flying object and the stationary model (hit judgment) by the hit judgment processing means 101.

This contact determination operation is performed in a predetermined cycle, for example, a frame cycle, during execution of the game program. When this subroutine is called, first, the 3D coordinate data (x, y,
z) is read (step S1). Then, this 3
A block (or group) containing the dimensional coordinate data (x, y, z) is retrieved from the matching function f (x, y, z) in the hit determination data storage unit 24. The transfer area including the transfer area is determined (step S3).

When the transfer area is determined, it is determined whether or not all the transfer areas are "empty" (step S5). This is because the block B (1) is classified as “empty” or “dense” as B (0) in units of 64 in the creation of the hit determination data. The determination can be made by storing the data in the data storage unit 24. If all the transfer areas are "empty", the flow is determined as no hit and the process exits the flow. As described above, when the entire transfer area is “empty”, the hit determination itself is unnecessary in the first place, so that the processing is skipped in order to speed up the processing.

On the other hand, if all the transfer areas are not "empty" (NO in step S5), it is determined whether or not the determined transfer area has been used in the past contact determination (step S7). This means that the flying object model P can move forward, left, right, up and down in response to an operation from the operation unit 11, while the operation unit 11 can stop at that position or move at a low speed. Therefore, in such a case, the coordinate data (x, y, z) of the point P1 changes only slightly, and as a result, the coordinate data (x, y, z)
z) a function f (x, y,
Considering that there is a high possibility that the same transfer area will be obtained immediately before or at a relatively short time point z), the data expansion processing can be omitted.

Next, in step S7, if there is no record developed in the past, a transfer area having the same contents is stored in the RAM1.
3 is determined (step S9). This depends on the content of the static model,
As in the map space S of the present embodiment, a part of a cavity formed in the ground may be commonly used in another cavity part. In such a case, another common area is used for each transfer area. By associating the transfer areas with each other, the data expansion processing can be omitted. Therefore, in step S9, such data in the common transfer area is
It is determined whether or not the data is still present in the RAM 13 without being updated. If not, the process proceeds to step S11, in which the data of the determined transfer area is read out from the hit determination data storage unit 24. The data is expanded and stored after the immediately expanded storage area of the RAM 13 (step S13).

On the other hand, if it remains (steps S7 and S7).
9 (YES), the data contents are used. That is, in steps S7 and S9, R
The transfer area is designated so as to use the data currently expanded without expanding the data in the AM 13 (step S15). In order to execute step S9, the main body control unit 1 previously creates and stores a data table indicating a common transfer area. Data relating to the common transfer area is stored in the hit determination data storage unit 24, and the main body control unit 1 may read this data at the start of the game.

In step S17, a predetermined group within the transfer area is focused on, and a search process for hit determination is started for the focused group in order from the predetermined first block in the block B (1). Is done. This hit determination procedure will be described later. When the hit determination block is specified (searched), the position of the specified block is converted into pseudo three-dimensional coordinate data and output to the main body control unit 1 (step S1).
9).

Next, the contact determination in step S17 will be described.

(I) First, the data structure will be described.

In the basic structure of data, one row is allocated to each subdivision stage, and data of eight blocks in each stage is 16 bits (per block) × 8.
(The number of blocks). The 16-bit data of each block is defined by special information (code or numerical value) that makes it possible to distinguish between the case where the block is “empty” and the case where the block is “dense”. This indicates that it is not necessary to search for a block that is further subdivided from the block.

On the other hand, data indicating the state of “mixed” is 1
A predetermined bit of the six bits, for example, the latter eight bits is used to indicate a row position to be searched next. For example, when a certain block of the eight blocks B (1) is “mixed”, the latter eight bits of the block B (1) are subdivided into one block of the block B (1). The row position of the data of the block B (2) is shown. That is, the latter eight bits of data indicate the row position to be searched next from the current search row position. Therefore, when the "mixed" block B (1) is searched, in the next search, the state search is continued for the block B (2) obtained by subdividing the block B (1) by one stage.

Further, if "mixed" is included in the block B (2), the latter eight bits include the eight blocks B divided by one stage of the block as described above.
The row position of the data of (3) is shown.

In this way, data of the block B (i) at the same stage is sequentially created in row units by the same method until the data reaches the unit small space.

Using a predetermined bit of the 16 bits except for the latter 8 bits, for example, the first 8 bits, the next row position to be searched is the last search for a certain block B (1). To show that. In this case, since the last search line is applied only when it is either “empty” or “dense”, it can be defined with one bit per block. As a result, 64 blocks The "empty" and "dense" states are defined in one row, and the memory capacity is reduced.

(Ii) Next, the contact determination will be described.

The first group is designated from the transfer area, and the eight data of 16 bits each defining the state of the eight blocks B (1) of the group are in the first row and are assigned to this group. Eight pieces of data of each block B (i) at each subdivision stage up to the unit small space are read out in the second row and below. First, “empty”, “dense”,
A determination of "mixed" is made. In this determination, if the first block is “empty” or “dense”, “empty”, “dense”, and “mixed” are determined for the second block. In this way, if the block is “empty” or “dense”, the process is sequentially shifted to the subsequent block, and the determination is repeated. Once it is determined that the block is “sky” or “dense”, no further search is performed because the block subdivided into this block is “sky” or “dense”. On the other hand, when a certain block is determined to be “mixed” during the search for the block B (1), the determination check proceeds in the subdivided direction of the block B (1). In this case, the information of the next search line position is read from the data defining “mixed”, and the processing jumps to the specified line position. Eight pieces of state data of the block B (2) exist at the designated row position, and the data of each block of this one row is sequentially searched from the head side. On the way, if it is determined to be "mixed", it jumps to a row position having data which is further subdivided from the latter 8 bits determined to be "mixed".
In this way, up to the unit small space or the last block (after that, if it is either “empty” or “dense”)
When the search up to is completed, the process returns to the row position of the data of the block B (1), and the search is continued for the subsequent block.

When "dense" or "mixed" exists in any of the blocks B (1), it can be regarded as touching at any position. In this case, the hit determination specifies the contact position. It becomes possible. Therefore, the block B at the subdivision stage closest to the unit small space during the search
(I) are all detected, the coordinate data of these blocks in the pseudo three-dimensional space are converted, and the coordinate position closest to the point P1 in the position coordinate data is determined as the contact position. .

When the number of detected blocks is large, the recognition can be speeded up as follows. That is, while it is detected in which block B (1) in the group including the point P1 the point P1 is present, among the blocks detected by the search, the block B (1) is most frequently detected. Close block B (i)
May be identified as the contact position.

In addition, the state of the space is defined as “recalculation” in addition to the three states of “sky”, “dense” and “mixed”. As described above, the shape of the static model can be changed as the time changes. By doing so, on the condition that the movable character has come into contact, a calculation such as the collapse of the static model of that part can be executed using a prepared arithmetic expression or a data table storing the calculation results. I just need.
With this configuration, the stationary model is deformed in response to the contact, and it is possible to bring out a more powerful and realistic feeling. Such an arithmetic process has a heavy software burden and cannot be used in normal contact determination, or needs to be executed as a separate process. However, by employing the present invention, sorting can be easily performed.

[0068]

According to the first aspect of the present invention, it is possible to provide a method of creating pseudo three-dimensional game space information which is advantageous in usability and high speed by reducing the data amount.

According to the second aspect of the present invention, data indicating empty, dense, and mixed classification contents stored corresponding to each block is constituted by a predetermined data length, and the classification contents are empty, dense, and mixed. If this is the case, the data indicating the end is added, and if mixed, data specifying the one-stage subdivided block to be read next is added, so that the data length is constant, which is extremely effective for data processing by a computer. other,
When determining the state of the space, the next block position is specified as it is, so that it is not necessary to specify a separate position. In addition, if the block is empty or dense, there is no need to determine the state of the block any more, so there is no need to store more data than necessary, and the memory capacity can be reduced.

According to the third, sixth, and ninth aspects of the present invention, it is possible to perform high-speed contact determination with a movable model in a pseudo three-dimensional game space in which a complex static model is arranged with a small memory capacity. be able to.

According to the fourth, seventh and tenth aspects of the present invention, the position of the contact can be improved by locating the most subdivided block classified as mixed.

According to the fifth and eighth aspects of the present invention,
The classification contents of the readout largest block are temporarily stored in the auxiliary memory, and when the block is later specified, on the condition that the classification contents of the block are stored in the auxiliary memory. By giving a read instruction to the auxiliary memory instead of the recording medium,
Once the read data is temporarily stored in the auxiliary memory, the data of the same block does not need to be read each time, and the data reading time can be shortened accordingly. In particular, in the case where block data is stored in a compressed form on a storage medium, considering that a relatively long time is required for data reading, that is, data decompression (decompression), contact determination or contact position determination is performed. Detection can be processed faster and faster.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an embodiment of a game device to which the present invention is applied.

FIG. 2 shows a pseudo three-dimensional space model (hereinafter, referred to as a map space).

FIG. 3 is an explanatory diagram showing a procedure for creating a block and hit determination data in a map space S.

FIG. 4 shows “empty”, “dense”,
It is the figure which looked at an example of "mixing" from the upper part.

5A and 5B are diagrams illustrating an example of a model of a flying object, wherein FIG. 5A is a plan view and FIG. 5B is a side view.

FIG. 6 is a flowchart illustrating a subroutine for performing contact determination (hit determination) between the flying object and the stationary model by the hit determination processing means.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Main body control part 10 CPU 101 Hit judgment processing means 102 Hit judgment data reading means 103 Data development means 11 Operation part 12 ROM 13 RAM 14 Graphics data generation part 15 Drawing processing part 16 Frame memory 17 Monitor 2 Storage part 21 Program storage part 22 polygon data storage unit 23 texture data storage unit 24 hit determination data storage unit

Claims (10)

(57) [Claims] 1. A method defined by coordinate data of each vertex of a polygon.
3D game space with a static model
Was recalculated lid model, sky, dense pseudo three-dimensional space defined by any of the states, while being spatially blocks into a plurality of sequentially subdivided until each block reaches the unit small spaces plurality will be divided into blocks in the direction, in a certain stage in subdivision direction, with respect to each of a plurality of blocks by one stage to form a block in the subdivision step is subdivided, the block is Depending on the occupied spatial state, it is classified into any of sky, dense, and a mixture of sky and dense, and for the block classified as mixed in this classification, the block classified as mixed is further classified. until the block is the minimum unit small space obtained in step sequentially towards the subdivided direction limit, empty performs subdivision until classified as either dense, classification contents at each subdivision stage pairs How to create spatial information in the pseudo three-dimensional game space so as to store in association with blocks. 2. The data indicating empty, dense, and mixed classification contents stored corresponding to each of the blocks has a predetermined data length, and indicates end if the classification contents are empty or dense. data, how to create spatial information in the pseudo three-dimensional game space according to claim 1, wherein the if mixed data specifying next one step subdivided blocks to be read are those added . 3. When a region in the pseudo three-dimensional space where no static model is present is defined as empty, an existing region is defined as dense, and a region including the boundary surface is defined as mixed, it is possible to move in the pseudo three-dimensional game space . A method for determining contact between a movable model and a stationary model, the pseudo three-dimensional game according to claim 1 or 2.
The classification contents obtained by the method of creating the spatial information in the space are stored in a storage medium for storing the classification contents, and are sequentially segmented from one or a required maximum number of blocks near the position of the movable model in the pseudo three-dimensional space. For each block, read the classification contents in the block at each stage, determine whether there is a mixture in the classification contents in the block, and if there is a classification corresponding to the mixture, determine that there is a contact. A method for determining contact between a pseudo three-dimensional image and a movable model in a pseudo three- dimensional game space . 4. The simulation according to claim 3, wherein the most subdivided block classified as mixed is located.
A method for determining contact between a pseudo three-dimensional image and a movable model in a three-dimensional game space . 5. The pseudo three-dimensional game according to claim 3 or 4.
In the method of determining contact between a pseudo three-dimensional image and a movable model in space , the readout contents of the largest block are temporarily stored in an auxiliary memory, and when the block is specified later, the block is <br/> in pseudo three-dimensional game space classification contents of is characterized in that to perform the read instruction to the auxiliary memory instead of the recording medium on condition that it is stored in the auxiliary memory A method for determining contact between a pseudo three-dimensional image and a movable model. 6. When a region in the pseudo three-dimensional space where no static model is present is defined as empty, an existing region is defined as dense, and a region including the boundary surface is defined as mixed, it is possible to move in the pseudo three-dimensional game space. An apparatus for determining contact between a movable model and a stationary model, wherein the pseudo three-dimensional game according to claim 1 or 2.
A storage medium for storing the contents of classification obtained by the method of creating spatial information in the space; a position detecting means for detecting the position of the movable model in the pseudo three-dimensional space; Reading means for reading, from the storage medium, the classification contents in the blocks at each stage toward the blocks which are sequentially subdivided from the blocks;
Pseudo- equipped with a judging means for judging whether or not there is a mixture in the read contents of the block, and a judging means for judging a contact when it is judged that there is a classification corresponding to the mixture.
An apparatus for determining contact between a pseudo three-dimensional image and a movable model in a three-dimensional game space . 7. A contact between a pseudo three-dimensional image and a movable model in a pseudo three- dimensional game space according to claim 6, further comprising detection means for detecting a most subdivided block classified as mixed. Judgment device. 8. The pseudo three-dimensional game according to claim 6,
In an apparatus for determining the contact between a pseudo three-dimensional image and a movable model in space , an auxiliary memory for temporarily storing the readout contents of the largest block read out, and a classification of the block when the block is specified later. A pseudo three-dimensional game space provided with read control means for instructing the auxiliary memory to read in place of the recording medium on condition that the contents are stored in the auxiliary memory.
A contact determination device for a pseudo three-dimensional image and a movable model. 9. When a region in a pseudo three-dimensional space where no static model exists is defined as empty, an existing region is defined as dense, and a region including a boundary surface is defined as a mixture, the region can move in the pseudo three-dimensional game space. The pseudo three-dimensional game space according to claim 1 or 2, when determining contact between the movable model and the stationary model.
From the storage medium storing the classification contents obtained by the method of creating spatial information in the above, into one or a required maximum number of blocks adjacent to the detection position of the movable model in the pseudo three-dimensional space into blocks that are sequentially subdivided. Pseudo 3 in which the classification contents in the block at each stage are sequentially read, and it is determined whether the classification contents in the block include a mixture.
A readable recording medium storing a program for determining a contact between a pseudo three-dimensional image and a movable model in a three- dimensional game space . 10. The pseudo-code according to claim 9, wherein the most subdivided blocks classified as mixed are located.
A readable recording medium storing a program for determining a contact between a pseudo three-dimensional image and a movable model in a pseudo three- dimensional game space .