JP3280355B2 - Image generation system and information storage medium - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to an image generation system and an information storage medium.

[0002]

2. Description of the Related Art Conventionally, there has been known an image generation system for generating an image which can be viewed from a given viewpoint in an object space which is a virtual three-dimensional space. It is popular as an experience. For example, in the case of an image generation system capable of enjoying a racing game, a player operates a car (object) to drive the vehicle in an object space,
Enjoy 3D games by competing with other players or cars operated by computers.

In such an image generation system, it is an important technical problem to generate a higher quality image in order to improve the virtual reality of the player. Therefore,
It is desired that the image of an object in a distant view can be expressed more naturally and realistically.

[0004] A technique called depth queuing is known as a technique for making an image of a distant object more natural and realistic. In the depth queuing, a process of bringing the color of an object closer to a target color (for example, gray or white) according to the distance from the viewpoint is performed to blur an object in a distant view.

However, for example, when the target color of depth cuing is gray and the farthest view (background) is a blue sky, the target color (gray) of depth cuing and the color of the farthest view (blue) are different colors. Become.
Therefore, even if the color of a distant object is brought closer to the target color by depth queuing, the appearance or disappearance of the object near the clipping position can be seen. As a result, a distant object appears or disappears at the clipping position, causing a problem that the screen flickers.

The following technique can be considered as one technique for solving such a problem. That is, prepare the picture of the farthest view drawn in the same or almost the same color as the target color of the depth cueing, regardless of the game situation,
Always use this farthest view picture.

However, in this method, the picture of the farthest view is fixed regardless of the game situation. Therefore, there is a problem that the obtained game image becomes monotonous, and the virtual reality of the player cannot be increased.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-described problems, and has as its object to solve various problems while solving the problem of a screen flickering due to the occurrence or disappearance of a distant object. An object of the present invention is to provide an image generation system and an information storage medium that can generate a realistic image.

[0009]

In order to solve the above-mentioned problems, the present invention provides an image generation system for generating an image, wherein an object color becomes closer to a target color as the distance from the viewpoint increases. Depth queuing processing means for performing depth queuing processing on
An alpha value processing unit that performs a process of changing the alpha value of the object so that the object becomes more transparent from the viewpoint, and a unit that draws an image viewed from the virtual camera in the object space. Further, an information storage medium according to the present invention is an information storage medium that can be used by a computer, and includes a program for executing the above means. Further, the program according to the present invention is a program usable by a computer (including a program embodied in a carrier wave), and includes a processing routine for executing the above means.

According to the present invention, the color of an object (one or more primitive surfaces) in a distant view from the viewpoint gradually approaches the target color, and the object gradually becomes transparent. Therefore, it is possible to prevent the player from feeling the moment when the distant view object disappears or disappears, and it is possible to eliminate the problem of the screen flicker.

The depth queuing process and the process of changing the α value (transparency, translucency, opacity, etc.) may be performed based on the Z value of the object or the viewpoint (virtual camera, screen, moving object) ) May be performed based on a distance (a straight line distance or the like) from the object. Various well-known techniques can be adopted for the depth queuing process.

Further, the image generation system, the information storage medium and the program according to the present invention are characterized in that the drawing means draws a farthest view including a color different from the target color. By doing so, various farthest views can be drawn, and the variety of generated images can be increased.

Further, in the image generation system, the information storage medium and the program according to the present invention, the depth queuing processing means performs a depth queuing process on the object on condition that the object is within a given range. The α value processing means performs a process of changing an α value of an object on condition that the object is within a given range. By doing so, it is not necessary to perform the processing of changing the depth queuing and the α value for the object outside the given range, so that the processing load can be reduced.

Further, in the image generation system, the information storage medium and the program according to the present invention, the depth queuing means changes the depth cuing value set at the vertex of the object based on the Z value of the vertex of the object. And the α value processing means calculates the Z of the vertex of the object.
The method is characterized in that the α value set at the vertex of the object is changed based on the value. In this way, more accurate depth queuing control and α value control can be realized.

The image generating system, the information storage medium, and the program according to the present invention provide a sorting processing means (or a program for executing the means) for sorting objects whose α values are to be changed so as to be drawn in order from the viewpoint. Programs, processing routines).

According to another aspect of the present invention, there is provided an image generating system for generating an image, wherein α value processing means for changing the α value of the object so that the object becomes more transparent as the distance from the viewpoint increases; Means for drawing an image viewed from the virtual camera in the space. Further, an information storage medium according to the present invention is an information storage medium that can be used by a computer, and includes a program for executing the above means. Further, the program according to the present invention is a program usable by a computer (including a program embodied in a carrier wave), and includes a processing routine for executing the above means.

According to the present invention, an object in a distant view far from the viewpoint gradually becomes transparent. Therefore, it is possible to prevent the player from feeling the moment when the distant view object disappears or disappears, and it is possible to eliminate the problem of the screen flicker.

The present invention is also an image generation system for generating an image, comprising: α value processing means for performing a process of changing an α value of an object according to a distance from a viewpoint;
In the object space, while performing the α blending based on the α value in the drawing order set by the sorting processing means and the drawing order set by the sorting processing means, the objects for which the α values are changed are drawn in order from the viewpoint. Means for drawing an image viewed from the virtual camera. Further, an information storage medium according to the present invention is an information storage medium that can be used by a computer, and includes a program for executing the above means. Further, the program according to the present invention is a program usable by a computer (including a program embodied in a carrier wave), and includes a processing routine for executing the above means.

According to the present invention, objects whose α value is changed are rendered in order from the viewpoint. Accordingly, it is possible to prevent a situation in which α blending is performed in an overlapping portion between objects whose α values are changed, and it is possible to generate a more natural image. Note that it is desirable to draw the farthest scene before drawing the object whose α value is changed. The drawing means is Z
It is desirable to perform hidden surface elimination by the buffer method.

[0020]

Preferred embodiments of the present invention will be described below with reference to the drawings. In the following, the case where the present invention is applied to a racing game will be described as an example, but the present invention is not limited to this and can be applied to various games.

1. Configuration FIG. 1 shows an example of a block diagram of the present embodiment. In the figure, the present embodiment only needs to include at least the processing unit 100 (or may include the processing unit 100 and the storage unit 170, or the processing unit 100 and the storage unit 170 and the information storage medium 180), and other blocks. (For example, the operation unit 16
0, the display unit 190, the sound output unit 192, the portable information storage device 194, and the communication unit 196) can be optional components.

The processing unit 100 performs various processes such as control of the entire system, instruction of instructions to each block in the system, game processing, image processing, sound processing, and the like. Processor (CPU, DSP)
Or an ASIC (gate array or the like) or a given program (game program).

The operation section 160 is used by the player to input operation data, and its function can be realized by hardware such as a lever, a button, and a housing.

The storage unit 170 stores the processing unit 100 and the communication unit 1
A work area such as 96
It can be realized by hardware such as.

An information storage medium (storage medium usable by a computer) 180 stores information such as programs and data.
D, DVD), magneto-optical disk (MO), magnetic disk, hard disk, magnetic tape, or memory (RO
M) and the like. Processing unit 10
0 performs various processes of the present invention (the present embodiment) based on the information stored in the information storage medium 180. That is, the information storage medium 180 stores information (program or data) for executing the means (particularly, the blocks included in the processing unit 100) of the present invention (the present embodiment).

A part or all of the information stored in the information storage medium 180 is transferred to the storage unit 170 when the power to the system is turned on. Information storage medium 1
The information stored in 80 is a program code for performing the processing of the present invention, image data, sound data, shape data of a display object, table data, list data, information for instructing the processing of the present invention, and instructions for the processing. The information includes at least one of information for performing processing according to.

The display section 190 outputs an image generated according to the present embodiment.
LCD or HMD (Head Mount Display)
It can be realized by hardware such as.

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

The portable information storage device 194 stores personal data and save data of a player, and the portable information storage device 194 may be a memory card, a portable game device, or the like. .

The communication unit 196 performs various controls for communicating with the outside (for example, a host device or another image generation system), and has a function of various processors or an ASIC for communication. Hardware and programs.

A program or data for executing the means of the present invention (this embodiment) is 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. It may be. Use of the information storage medium of such a host device (server) is also included in the scope of the present invention.

The processing section 100 includes a game processing section 110, an image generation section 130, and a sound generation section 150.

Here, the game processing unit 110 receives coins (price), sets various modes, progresses the game, sets a selection screen, and sets the position and rotation angle of an object (one or more primitive planes). Processing for calculating (the rotation angle around the X, Y or Z axis), processing for moving the object (motion processing), processing for obtaining the position of the viewpoint (the position of the virtual camera) and the line of sight (the rotation angle of the virtual camera), the map object Such as processing for arranging objects in the object space, hit check processing, processing for calculating game results (results, results), processing for playing by a plurality of players in a common game space, or game over processing. The game processing is performed by operating data from the operation unit 160 or the portable information storage device 194.
Based on personal data, stored data, and game programs.

The game processing section 110 is a movement / motion calculation section 1
14 inclusive.

Here, the movement / motion calculation section 114 calculates movement information (position data, rotation angle data) and movement information (position data, rotation angle data of each part of the object) of an object such as a car. For example,
Based on operation data, a game program, and the like input by the player via the operation unit 160, a process of moving or moving an object is performed.

More specifically, the movement / motion calculation unit 114
Performs a process of obtaining the position and rotation angle of the object, for example, for each frame (1/60 second). For example, (k-
1) The position of the object in the frame is PMk-1, the speed is VMk-1, the acceleration is AMk-1, and the time of one frame is Δt.
And Then, the position PM of the object at the k frame
k and the speed VMk are obtained, for example, as in the following equations (1) and (2).

PMk = PMk−1 + VMk−1 × Δt (1) VMk = VMk−1 + AMk−1 × Δt (2) The image generation unit 130 performs various image processing according to an instruction from the game processing unit 110 and the like. Then, for example, an image viewed from a virtual camera (viewpoint) in the object space is generated and output to the display unit 190. Also, the sound generation unit 150
Performs various kinds of sound processing in accordance with instructions from the game processing unit 110, generates sounds such as BGM, sound effects, and sounds, and outputs the sounds to the sound output unit 192.

The game processing section 110, the image generation section 1
30, all of the functions of the sound generation unit 150 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 image generation unit 130 includes the geometry processing unit 1
32 (three-dimensional coordinate calculation unit), depth queuing processing unit 134, α value processing unit 136, sorting processing unit 13
8, including the drawing unit 140 (rendering unit).

Here, the geometry processing unit 132 performs various types of geometry processing (three-dimensional coordinate calculation) such as coordinate conversion, clipping processing, perspective conversion, and light source calculation.
Then, object data (shape data such as vertex coordinates of the object, etc.) after the geometry processing (after the perspective transformation)
Alternatively, vertex texture coordinates, luminance data, and the like) are stored in the main memory 172 of the storage unit 170.

The depth queuing unit 134 performs depth queuing processing on the object (one or more primitive surfaces) so that the color of the object (one or more primitive surfaces) approaches the target color as the distance from the viewpoint increases. Thus, for example, when the target color is gray, the color of the object approaches gray in a distant view, regardless of the original color of the object. In addition, the depth queuing process
It is controlled using a depth queuing value which is a parameter for determining the strength of the depth queuing effect.

The α value processing section 136 changes the α value (transparency, translucency, opacity) of the object so that the object becomes more transparent as the distance from the viewpoint increases. As a result, the object that was opaque in the near view gradually becomes transparent in the distant view. As a result, it is possible to solve the problem that the screen flickers due to the occurrence or disappearance of a distant object at the clipping position.

The sorting processing unit 138 performs sorting processing so that objects whose α value is changed (objects within the depth queuing range) are drawn in order from the viewpoint.

The drawing unit 140 performs a process of drawing an image viewed from the virtual camera in the object space based on object data, texture, and the like. In this case, the drawing unit 140 draws the objects in the drawing order set by the sorting processing unit 138.

The drawing unit 140 includes the α blending unit 14
2 (semi-transparent processing unit) and a hidden surface elimination unit 144.

Here, the α blending section 142 performs, for example, α blending processing (translucent processing) as shown in the following equation based on the α value of the object.

R _Q = (1−α) × R ₁ + α × R ₂ (3) G _Q = (1−α) × G ₁ + α × G ₂ (4) B _Q = (1−α) × B ₁ + Α × B ₂ (5) Here, R ₁ , G ₁ , and B ₁ are the R, G, and B components of the color (luminance) of the original image already drawn in the frame buffer 174, and R ₂ , G ₂ and B ₂ are R, G, and B components of the color of the drawn image to be overwritten on the original image.

The hidden surface removing unit 144 performs hidden surface removal according to the algorithm of the Z buffer method using the Z buffer 178 storing depth values.

The image generation system according to the present embodiment
A system dedicated to the single player mode in which only one player can play, or a system including not only such a single player mode but also a multiplayer mode in which a plurality of players can play, may be used.

When a plurality of players play,
The game image and the game sound to be provided to the plurality of players may be generated using one terminal, or may be generated using a plurality of terminals connected by a network (transmission line, communication line) or the like. Is also good.

2. Features of this embodiment In this embodiment, as shown in FIG.
The depth queuing process is performed so that the color of the object OB (one or a plurality of polygons) becomes closer to the target color as the distance from the screen or the moving object operated by the player increases. Thus, when the object OB is close to the viewpoint, the color remains the original color, but when the object OB is far from the viewpoint, the color approaches the target color.

In this embodiment, as shown in FIG.
A process of changing the α value is also performed so that the object OB becomes more transparent as the distance from the viewpoint increases. As a result, the object OB remains opaque when it is near the viewpoint, but gradually becomes transparent when it is far from the viewpoint.

By doing so, it is possible to prevent the player from feeling the moment when an object occurs or disappears near the clipping position (the rear clipping plane of the viewing volume), and the screen flickers. Problem can be solved.

FIGS. 3A and 3B show examples of game images generated according to the present embodiment.

In FIG. 3A, the farthest view is a blue sky, and the color of the farthest view is blue. In this case, if the color of the building 20 in the distant view is brought close to the target color, for example, gray by depth cuing, the building 20 is not obtained.
Will remain visible in the blue sky, which is the farthest view. Therefore, the building 20 appears to suddenly appear or disappear, causing a problem that the screen flickers near B1 in FIG. 3A.

In the present embodiment, in addition to the depth queuing for making the color of the building 20 close to the target color, a process of changing the α value so that the building 20 in the distant view becomes transparent is performed. Therefore, the gray outline of the building 20 does not remain in the blue sky of the farthest view, and the problem of the screen flicker can be solved.

For example, as a technique different from the present embodiment, a technique using only the farthest view drawn in the same color as the target color of the depth cuing can be considered regardless of the game situation. For example, in FIG. 3A, the target color of the depth queuing is set to blue, and the farthest view is fixed to the blue sky. In this way, the blue outline of the building 20 in the distant view becomes inconspicuous, and the problem of screen flicker can be solved to some extent.

However, in this method, the distant view is always blue sky, no matter where the car runs on the course, and the generated game image becomes monotonous.

On the other hand, according to the present embodiment, the problem of the flickering of the screen does not occur even if the farthest view drawn in a color different from the target color is used. Thus, for example, FIG.
As shown in (A) and (B), various pictures such as a blue sky and a mountain can be used as the farthest view. As a result, the degree of variety and the degree of realism of the generated game image can be significantly increased.

That is, it is assumed that the target color of the depth queuing is, for example, gray. In this case, according to the present embodiment, even if the farthest view is a blue sky as shown in FIG. 3A, or if the farthest view is a mountain as shown in FIG.
Since the building 20 becomes transparent due to the change in the α value, the building 20
Will be invisible after all. Therefore, no matter what color of the farthest view is used, the building 20 in the faraway view looks like it has blended into the farthest view, and the flickering of the screen can be prevented.

In this embodiment, as shown in FIG. 2, depth queuing and α value processing are performed only on objects within the depth queuing range (within a given range). That is, on condition that the object is within the depth queuing range, the depth queuing value of the object is changed and the α value of the object is changed. By doing so, depth queuing and α value processing are not performed on an object outside the depth queuing range, so that the processing load can be reduced. For objects outside the depth queuing range, no problem such as flickering of the screen occurs without performing the depth queuing or the α value processing, so that the image quality does not deteriorate.

Now, depth queuing and α value processing for an object are specifically realized as follows.

For example, in FIG.
Vertex VE of (polygon PL1)_KHas vertex coordinates X_K, Y
_K, Z_K, Color (luminance) information R_K, G_K, B_K, Texture seat
Mark U _K, V_K, Depth queuing value DQ_K, Α value α_KSuch
Is set. Similarly, the object OB2 (polygo
VE2 of the vertex PL2)_LHas vertex coordinates X_L, Y_L, Z_L,
Color information R_L, G_L, B_L, Texture coordinates U_L, V_L, Dep
Skewing value DQ_L, Α value α_LEtc. are set
You. In the present embodiment, information given to each of these vertices
Is used to determine the information of each pixel by interpolation.
I have.

In this embodiment, the vertex of the object is set based on the Z value of the vertex of the object (the value of the Z coordinate itself of the vertex or a value obtained from the Z coordinate using a given calculation formula). DQ value (depth queuing value) to be changed. Also, the Z of the vertex of the object
The α value set at the vertex of the object is changed based on the value. For example, consider the case where the Z value increases as the depth of the screen increases, the depth queuing effect increases as the DQ value increases, and the object becomes more transparent as the α value decreases. In this case, as the Z value increases, the DQ value is increased so as to be closer to the target color, and the α value is decreased so as to be more transparent. Thus, DQ _L vertex VE _L objects OB2 in Figure 4 is larger than DQ _K vertex VE _K objects OB1, the vertex V
Α _L of E _L is smaller than α _{K of} vertex VE _K. Therefore, the object OB2 becomes closer to the target color and more transparent than the object OB1.

As described above, the D value of the vertex is determined based on the Z value of the vertex.
By changing the Q value and the α value, the DQ value and the α value become different even within the same object (polygon), and more accurate depth queuing control and α value control can be realized.

Now, in the image generation system as in the present embodiment, it is necessary to delete a hidden portion which cannot be seen from the viewpoint and to erase a hidden surface for displaying only a portion which can be seen from the viewpoint. Representative examples of the hidden surface elimination include a so-called depth sorting method and a so-called Z-buffer method.

In the depth sort method (Z sort method), objects are sorted according to the distance from the viewpoint,
Drawing is performed in order from the object far from the viewpoint. On the other hand, Z
In the buffer method, a Z buffer for storing depth values for all pixels (dots) on the screen is prepared, and this Z buffer is prepared.
Performs hidden surface removal using a buffer.

In the Z-buffer method, the context is determined for each pixel based on the depth value stored in the Z-buffer. Therefore, when the hidden surface is erased by the Z-buffer method, there is no need to consider the drawing order of the objects at all, and the objects can be drawn in an arbitrary drawing order.

However, in the case of performing α blending using the α value, it is necessary to devise the drawing order of objects even when performing hidden surface elimination by the Z buffer method.

For example, as shown in FIG. 5 (A), an object OB1 at the back and an object OB2 at the front as viewed from the viewpoint are converted into α based on the α value set in OB2.
Consider the case of blending. In this case, it is necessary to draw the objects in the frame buffer in the order of drawing OB1 in the frame buffer first, and then overwriting OB2. By doing so, FIG.
As shown in the figure, in the part shown in C1, the object OB1
And the color information of OB2 is appropriately α-blended, and the image of OB1 at the back can be seen through.

On the other hand, if, for example, drawing is performed in the order of OB2 and OB1 in reverse to the drawing order of FIG.
An image as shown in (C) is generated. That is, OB
When drawing in the order of 2, OB1, α blending with OB1 based on the α value set in OB2 is not performed. Therefore, in the portion indicated by C2 in FIG. 5C, the image of OB1 at the back is completely hidden by OB2 at the front. That is, OB2 is not translucent, and normal hidden surface erasure is performed.

As described above, in the case of performing α blending using the α value, it is necessary to draw objects in order from the deepest object as viewed from the viewpoint.

However, in the method shown in FIG. 2 in which α blending is performed for the purpose of making a distant object transparent, if the objects for which α values are set are drawn in order from the viewpoint as viewed from the viewpoint, the following problems occur. It has been found.

For example, in FIG. 6A, OB1 to OB
Reference numeral 4 denotes an object whose α value is changed by the method shown in FIG. 2, where OB1 is at the near side and OB4 is at the back as viewed from the viewpoint. In this case, similarly to FIG. 5A, OB4, OB
When drawing objects in the order of 3, OB2, OB1,
In the portions indicated by D1, D2, and D3, the object at the back becomes visible. For example, D1
Now, the front object OB1 and the back object O
The image of B2 is α-blended, and the image of OB2 at the back is seen through. Similarly, at D2 and D3, the images of OB3 and OB4 respectively show through. Therefore, the generated image becomes unnatural.

That is, in FIG. 2, the purpose of changing the α value so that the object becomes more transparent as it is farther from the viewpoint is to allow the distant object to blend into the farthest scene naturally, and to perform α blending between the objects. Doing that is not its purpose. However, when the objects whose α values are changed overlap each other, FIG.
As shown in D1, D2, and D3, the image of the back object is seen through, and the real feeling of the image is impaired.

Therefore, in the present embodiment, objects whose α values are changed by the method of FIG. 2 (objects in the depth queuing range) are sorted so as to be drawn in order from the viewpoint. That is, as shown in FIG. 6B, the objects OB1 to OB changing the α value
For B4, drawing is performed in the order of OB1, OB2, OB3, and OB4. By doing so, D4, D
5, in the portion indicated by D6, the α blending with the object in front is not performed. Therefore, the object in the foreground is overwritten according to hidden surface elimination such as the Z-buffer method (FIG. 5).
(C)), it is possible to prevent a situation in which the back object is seen through. That is, in D4, the image of OB2 is hidden by OB1 in the foreground, and in D5, OB3 is hidden by OB2.
Is hidden, and in D6, the image of OB4 is hidden by OB3. Thus, unlike FIG. 6A, a more natural image can be generated.

Even when the objects OB1 to OB4 are drawn in the drawing order as shown in FIG. 6B, the objects OB1 to OB4 are drawn by drawing the farthest view first.
Α blending between B4 and the farthest view is performed. Therefore, the distant view object naturally blends into the farthest view, making it possible to solve the problem of screen flicker.

3. Next, a detailed example of the process according to the present embodiment will be described with reference to the flowchart in FIG.

First, the farthest view is drawn in the frame buffer (step S1). For example, in FIG. 3A, the farthest view of a blue sky picture is drawn, and in FIG. 3B, the farthest view of a mountain picture is drawn. As described above, in the present embodiment, the farthest view drawn in a color different from the target color of the depth queuing can be drawn. Therefore, the degree of variety of the generated image can be increased. If the farthest views are drawn first, even when objects whose α values are changed are drawn in the drawing order as shown in FIG. 6B, α blending between these objects and the farthest views is performed. Become like

Next, polygons (objects in a broad sense)
(Step S2). That is, for example, coordinate transformation from the local coordinate system to the world coordinate system, coordinate transformation from the world coordinate system to the viewpoint coordinate system, clipping processing, and perspective transformation to the screen coordinate system are performed.

Next, it is determined whether the Z value is within the depth queuing range (see FIG. 2) (step S).
3). If the Z value is within the depth queuing range, as described with reference to FIG.
Based on the value, the DQ value (depth queuing value) of the vertex is calculated (step S4). That is, the DQ value of the vertex is changed such that the farther from the viewpoint, the closer to the target color. Also, based on the Z values of the vertices of the polygon,
The α value of the vertex is calculated (step S5). That is, the α value of the vertex is changed such that the farther away from the viewpoint, the more transparent.

On the other hand, when the Z value is outside the depth queuing range, the processing of steps S4 and S5 is omitted.
Thereby, the processing load can be reduced.

Next, the calculation results (results of geometry processing, DQ value calculation, α value calculation, etc.) are stored in the main memory (step S6).

Next, it is determined whether or not the processing has been completed for all polygons (step S7). If not, the flow returns to step S2. On the other hand, if completed, based on the calculation result stored in the main memory,
The polygons within the depth queuing range are drawn in order from the polygon closest to the viewpoint according to the Z value (step S).
8). By drawing in such an order, it is possible to prevent a situation in which an object at the back is seen through at a portion where objects overlap as described with reference to FIG.

Finally, based on the calculation result stored in the main memory, a polygon outside the depth queuing range is drawn (step S9). Thus, drawing for one frame is completed.

[0086] 4. Hardware Configuration Next, an example of a hardware configuration that can realize the present embodiment will be described with reference to FIG.

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

The coprocessor 902 assists the processing of the main processor 900, has a multiply-accumulate unit and a divider capable of high-speed parallel operation, and executes a matrix operation (vector operation) at high speed. For example, when a physical simulation for moving or moving an object requires processing such as matrix operation, a program operating on the main processor 900 instructs the coprocessor 902 to perform the processing (request ).

The geometry processor 904 performs geometry processing such as coordinate transformation, perspective transformation, light source calculation, and curved surface generation. The geometry processor 904 includes a multiply-accumulate unit and a divider capable of high-speed parallel operation, and performs a matrix operation (vector operation). Calculation) at high speed. For example, when performing processing such as coordinate transformation, perspective transformation, and light source calculation, 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 performs a process for accelerating the decoding process of the main processor 900. As a result, a moving image compressed by the MPEG method or the like can be displayed on an opening screen, an intermission screen, an ending screen, a game screen, or the like. The image data and sound data to be decoded are stored in the ROM 950,
It is stored on a CD 982 or transferred from outside via a communication interface 990.

The drawing processor 910 executes a high-speed drawing (rendering) process of an object composed of primitive surfaces such as polygons and curved surfaces. When drawing an object, the main processor 900
Uses the function of the DMA controller 970 to pass object data to the drawing processor 910,
If necessary, the texture is transferred to the texture storage unit 924. Then, the drawing processor 910 draws 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 the texture. The drawing processor 910 can also perform α blending (translucent processing), depth queuing, mip mapping, fog processing, trilinear filtering, anti-aliasing, shading processing, and the like. Then, when an image for one frame is written to the frame buffer 922, the image is displayed on the display 912.

The sound processor 930 incorporates 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 and personal data from the memory card 944 are transferred via the serial interface 940.

The ROM 950 stores a system program and the like. In the case of the arcade game system, the ROM 950 functions as an information storage medium,
Various programs are stored in 950. Note that 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 is provided between the processor and the memory (RAM, VRAM, ROM, etc.).
A transfer is controlled.

The CD drive 980 stores a CD 982 in which programs, image data, sound data, and the like are stored.
(Information storage medium) to enable 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, a network connected to the communication interface 990 may be a communication line (analog telephone line, ISDN), a high-speed serial bus, or the like. Then, data can be transferred via the Internet by using a communication line. Further, by using the high-speed serial bus, data transfer between another image generation system and another game system becomes possible.

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

When each unit of the present invention is executed by both hardware and a program, the information storage medium stores a program for executing each unit of the present invention by using hardware. Will be. More specifically, the program instructs the processors 902, 904, 906, 910, 930, etc., which are hardware, to perform processing, and passes data if necessary. Then, each processor 902, 904, 906, 910,
930, etc., based on the instruction and the passed data,
Each means of the present invention will be executed.

FIG. 9A 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 watching the game image projected on the display 1100. Various processors, various memories, and the like are mounted on a built-in system board (circuit board) 1106. The information (program or data) for executing each means of the present invention is stored in the system board 1.
It is stored in a memory 1108 which is an information storage medium on 106. Hereinafter, this information is referred to as storage information.

FIG. 9B 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 watching the game image projected on the display 1200. In this case, the storage information is stored in a CD 1206 or a memory card 1208, 1209, which is an information storage medium detachable from the main system.

FIG. 9C shows a host device 1300, a host device 1300 and a network 1302 (LAN
Terminal 1304 connected via a small network such as the Internet or a wide area network such as the Internet.
An example in which the present embodiment is applied to a system including -1 to 1304-n will be described. In this case, the storage 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. When the terminals 1304-1 to 1304-n are capable of generating a game image and a game sound in a stand-alone manner, a game program and the like for generating the game image and the game sound are transmitted from the host device 1300 to the terminal 13.
04-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, and sends them to the terminals 1304-1 to 1304-1.
The data is transmitted to the terminal 304-n and output at the terminal.

In the case of the configuration shown in FIG. 9C, each means of the present invention may be executed by distributing between a host device (server) and a terminal. Further, the storage information for executing each means of the present invention may be stored separately in an information storage medium of a host device (server) and an information storage medium of a terminal.

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

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

For example, in the invention according to the dependent claims of the present invention, a configuration in which some of the constituent elements of the dependent claims are omitted may be adopted. In addition, a main part of the invention according to one independent claim of the present invention may be made dependent on another independent claim.

It is desirable that the depth queuing and the process of changing the α value of the object are the processes described with reference to FIG. 4 and the like. However, the present invention is not limited to this, and various modifications can be made.

In the present invention (especially in the invention in which objects whose α values are changed are drawn in order from the viewpoint),
Omit the depth queuing process, and
Only the process of changing the value may be performed.

The present invention also includes various games other than racing games (fighting games, shooting games, robot battle games, sports games, competition games, role playing games, music playing games, dance games, etc.).
Applicable to

The present invention is applied to various image generation systems such as a business game system, a home game system, a large attraction system in which many players participate, a simulator, a multimedia terminal, and a system board for generating a game image. it can.

[Brief description of the drawings]

FIG. 1 is an example of a block diagram of an image generation system according to an embodiment.

FIG. 2 is a diagram for explaining a method of making a color of an object far from the viewpoint close to a target color and making an object far from the viewpoint transparent.

FIGS. 3A and 3B are examples of game images generated according to the present embodiment. FIG.

FIG. 4 is a diagram illustrating a method of changing a DQ value and an α value of a vertex of an object based on a Z value of the vertex of the object.

FIGS. 5A, 5B, and 5C are diagrams for describing the drawing order of objects in α blending.

FIGS. 6A and 6B are diagrams for explaining a method of drawing objects whose α values are changed in order from the viewpoint closest to the viewpoint;

FIG. 7 is a flowchart illustrating a detailed processing example of the present embodiment.

FIG. 8 is a diagram illustrating an example of a hardware configuration capable of realizing the present embodiment.

FIGS. 9A, 9B, and 9C are diagrams showing examples of various types of systems to which the present embodiment is applied; FIGS.

[Explanation of symbols]

 OB, OB1 to OB4 Object PL1, PL2 Polygon 20 Building (distant view object) 100 Processing unit 110 Game processing unit 114 Movement / motion operation unit 130 Image generation unit 132 Geometry processing unit 134 Depth queuing processing unit 136 α value processing unit 138 Sorting processing unit 140 Drawing unit 142 α blending unit 144 Hidden surface removing unit 150 Sound generation unit 160 Operation unit 170 Storage unit 172 Main memory 174 Frame buffer 178 Z buffer 180 Information storage medium 190 Display unit 192 Sound output unit 194 Portable information storage device 196 Communication Department

──────────────────────────────────────────────────続 き Continuation of the front page (58) Field surveyed (Int. Cl. ⁷ , DB name) G06T 15/00 100 A63F 13/00 JICST file (JOIS)

Claims (6)

(57) [Claims] 1. An image generation system for generating an image, comprising: a depth queuing processing means for performing a depth queuing process on an object so that the color of the object approaches a target color as the distance from the viewpoint increases. An α value processing means for performing a process of changing the α value of the object so that the object becomes more transparent as the distance increases, and an object which is made semi-transparent by changing the α value, in order from the viewpoint closer to the viewpoint The depth cueing , comprising: sorting processing means for sorting so as to be drawn; α blending means for performing α blending processing based on the α value of the object; and means for drawing an image visible from a virtual camera in an object space. processing means is, this the object is in the depth cueing range The
Depth queuing processing for the object in the condition
And the α-value processing means determines that the object is within the depth queuing range.
The condition is changed to change the α value of the object, and the sorting processing means performs processing within the depth queuing range.
As well as sorting as drawn sequentially close the semi-transparent object from a certain viewpoint, the semitransparent object
By removing hidden surfaces by Z-buffer method ,
The semi-transparent object in the Yuingu range, characterized in that as α blending processing by the α blending unit with the semi-transparent of <br/> object in front within depth cueing range is not performed Image generation system. 2. The image generation system according to claim 1, wherein the drawing unit draws a farthest view including a color different from the target color. 3. The α-value processing unit according to claim 1, wherein the depth queuing unit changes a depth queuing value set at the vertex of the object based on a Z value of the vertex of the object. Changes an α value set for a vertex of an object based on a Z value of the vertex of the object. 4. An information storage medium usable by a computer, comprising: depth queuing processing means for performing depth queuing processing on an object so that the color of the object approaches a target color as the distance from the viewpoint increases; Α value processing means for performing a process of changing the α value of the object so that the object becomes more transparent, and rendering the object which is made translucent by changing the α value in order from the viewpoint closer to the viewpoint. A processing unit for performing sorting so as to be performed, an α blending unit for performing an α blending process based on an α value of an object, and a program for causing a computer to function as a unit for drawing an image viewed from a virtual camera in an object space. wherein the depth cueing processing means, Oh That the project is within the depth cueing range
Depth queuing processing for the object in the condition
And the α-value processing means determines that the object is within the depth queuing range.
On condition, performs a process of changing the α value of the object, the sorting processing means in depth cueing range
As well as sorting as drawn sequentially close the semi-transparent object from a certain viewpoint, the semitransparent object
By removing hidden surfaces by Z-buffer method ,
The semi-transparent object in the Yuingu range, characterized in that as α blending processing by the α blending unit with the semi-transparent of <br/> object in front within depth cueing range is not performed Information storage medium. 5. The information storage medium according to claim 4, wherein the drawing means draws a farthest view including a color different from the target color. 6. The α-value processing means according to claim 4, wherein the depth queuing processing means changes a depth queuing value set at a vertex of the object based on a Z value of the vertex of the object. An information storage medium, wherein an α value set at a vertex of an object is changed based on a Z value of the vertex of the object.