JP2005275798A - Program, information storage medium, and image generation system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an image generation system capable of preventing the omission of representation by implementing polygonal scissoring processing with a small processing burden, and an information storage medium thereof. <P>SOLUTION: The image generation system establishes a plurality of regions for position determination by dividing a predetermined region or its surrounding space, decides on which region each apex of the primitive belongs to, and establishes scissoring information for specifying which region for position determination the apex belongs to, as the apex information associated with the apex. A scissoring processing part decides on whether there is an apex outside the predetermined region among the apexes in the unit of smallest unit polygons composing the primitive based on the scissoring information, implements scissoring processing to the smallest unit polygons having apexes outside the predetermined region, and omits scissoring processing to the smallest unit polygons having no apexes outside the predetermined region. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a program, an information storage medium, and an image generation system.

  2. Description of the Related Art Conventionally, an image generation system that generates an image that can be seen from a given viewpoint in an object space that is a virtual three-dimensional space is known, and is popular as being able to experience so-called virtual reality.

  In such an image generation system, it is an important technical problem to generate a more realistic image in order to improve the player's virtual reality.

  In general, when image generation is performed, polygon coordinates existing in a three-dimensional space are perspective-projected into a screen coordinate system and then written into a frame buffer. At this time, in the case of the vertex of a polygon existing at a close distance near the screen edge, the Z value is close to 0, and thus the value after perspective transformation exceeds a predetermined range (drawable range). For this reason, there has been a problem in that an image in which the polygon is not written is generated without being written to the frame buffer. In particular, there is a problem that display omission becomes conspicuous when the polygon is large.

As one method for solving such a problem, there has been a method of dividing a polygon into a plurality of smaller polygons to reduce display omission or make it inconspicuous. However, according to this method, there is a problem in that a vertex is supposed to be in the same position after division, and a gap is generated when the two vertex coordinates are complemented.
JP-A-10-188003

  Therefore, in order to solve the problem, it is possible to cut the area including the vertices that exceed the drawable range, perform the scissoring process to generate the vertex of the polygon to specify the area after cutting, and draw the polygon after the scissoring process However, there is a problem that a processing load is high in a game apparatus that needs to generate an image in real time with limited hardware resources.

  The present invention has been made in view of such a conventional problem, and it is an object of the present invention to provide an image generation system and an information storage medium that can prevent polygonal scissoring processing with a small processing burden and prevent display loss.

(1) The present invention is a program for generating an image of an object composed of polygons,
A vertex data set generation unit that performs coordinate conversion of an object arranged in a three-dimensional space into a screen coordinate system, and generates a vertex data set that is a set of vertex information of primitives constituting the object;
A scissoring processing unit that performs scissoring processing on a polygon including vertices exceeding a predetermined region of the primitive in a three-dimensional coordinate system, and generates a vertex data set including vertices newly generated by scissoring processing;
The computer functions as a drawing processing unit that performs drawing processing in units of primitives based on the vertex data set,
The vertex data set generation unit
A plurality of position determination areas are set by dividing the predetermined area or its surrounding space, and it is determined which of the primitives each vertex belongs to, and the position determination area is specified. Set scissoring information for the vertex information associated with the vertex,
The scissoring processing unit
Based on the scissoring information, it is determined whether there are vertices outside the predetermined area among the vertices in the minimum unit polygon unit constituting the primitive, and scissoring processing is performed on the minimum unit polygon having the vertices outside the predetermined area. It is characterized in that the scissoring process is omitted for the minimum unit polygon having no vertex outside the predetermined area.

  The present invention also relates to an image generation system having the above-described units. The present invention also relates to a computer-readable information storage medium that stores (records) a program that causes a computer to function as each unit.

  The coordinate conversion is, for example, perspective projection conversion.

  Here, the scissoring process is a process of cutting out a polygon including a vertex outside the view volume in a three-dimensional space and generating a new vertex for specifying the remaining polygon.

  Primitives are points, independent lines, continuous line segments that share end points, independent triangles, continuous triangles that share sides, continuous triangles that share vertices, and independent points identified by two vertices that represent diagonals It can be composed of at least one of a rectangular shape (strip) or the like.

  The vertex information is a drawing coordinate value, a vertex color, a texture coordinate value, a fog coefficient, and the like, and may be set in, for example, a vertex information setting register.

  According to the present invention, the scissoring processing unit determines whether or not there is a vertex outside the predetermined area in the minimum unit polygon unit constituting the primitive based on the scissoring information, and the minimum unit including the vertex outside the predetermined area The scissoring process is performed on the polygon, and the scissoring process is omitted for the minimum unit polygon having no vertex outside the predetermined region.

  Since the scissoring information of the present invention has information on which position determination area the vertex belongs to for each vertex, the minimum unit is based on the scissoring information of each vertex constituting the minimum unit polygon. The necessity of scissoring can be determined in units of polygons (for example, triangles).

  Therefore, according to the present invention, it is possible to determine the necessity of scissoring in units of minimum unit polygons, and in the case of minimum unit polygons that do not require scissoring, it is possible to draw by skipping scissoring processing. An efficient scissoring process can be performed with a processing burden.

(2) The program, information storage medium, and image generation system of the present invention are:
The predetermined area is an area formed based on a view volume of a virtual camera, and the plurality of position determination areas are obtained by dividing a space around the view volume using a plane including each surface constituting the view volume. It is characterized by being set.

(3) The program, information storage medium, and image generation system of the present invention are:
The drawing processing unit
Polygons including vertices exceeding a predetermined area are not drawn.

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

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

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

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

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

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

  Part or all of the information stored in the information storage medium 180 is transferred to the storage unit 170 when the system is powered on. Information stored in the information storage medium 180 includes program code, image data, sound data, display object shape data, table data, list data, and data for instructing the processing of the present invention. It includes at least one of information, information for performing processing according to the instruction, and the like.

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

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

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

  The communication unit 196 performs various controls for communicating with the outside (for example, a host device or other image generation system), and functions as hardware such as various processors or a communication ASIC. Or by a program.

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

  The processing unit 100 includes a game processing unit 110, an image processing unit 140, and a sound processing unit 150.

  Here, the game processing unit 110 receives coins (cost), various mode setting processing, game progress processing, selection screen setting processing, object position and rotation angle (rotation angle around X, Y, or Z axis). , Processing to move the object (motion processing), processing to determine the viewpoint position and line-of-sight angle (gaze direction), processing to place objects such as map objects in the object space, hit check processing, game results (results, results) ), Various game processes such as a process for a plurality of players to play in a common game space, a game over process, etc., from the operation data from the operation unit 160 and the portable information storage device 194. This is based on personal data, stored data, game programs, etc.

  The image generation unit 140 performs various types of image processing in accordance with instructions from the game processing unit 110 and the like. The sound generation unit 150 performs various types of sound processing in accordance with instructions from the game processing unit 110 and the like.

  Note that all of the functions of the image generation unit 140 and 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 game processing unit 110 includes a movement / motion calculation unit 114.

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

  More specifically, the movement / motion calculation unit 114 performs processing for obtaining the position and rotation angle of the object every frame (1/60 seconds), for example. For example, the position of the object in the (k-1) frame is PMk-1, the speed is VMk-1, the acceleration is AMk-1, and the time of one frame is Δt. Then, the position PMk and speed VMk of the object in the k frame are obtained, for example, by the following equations (1) and (2).

PMk = PMk-1 + VMk-1 * .DELTA.t (1)
VMk = VMk-1 + AMk-1 * .DELTA.t (2)
The image generation unit 140 includes a geometry processing unit (three-dimensional coordinate calculation unit) 142, a scissoring processing unit 144, and a drawing unit (rendering unit) 146.

  Here, the geometry processing unit 142 performs various types of geometry processing (three-dimensional coordinate calculation) such as coordinate transformation, clipping processing, perspective transformation, or light source calculation. In this embodiment, the object data (object vertex data (vertex position, vertex texture coordinates, brightness data), normal vector, etc.) after geometry processing (after perspective transformation) is stored in the main memory 172 of the storage unit 170. Stored and saved.

  The geometry processing unit 142 functions as a vertex data set generation unit that performs coordinate conversion of an object arranged in a three-dimensional space into a screen coordinate system, and generates a vertex data set that is a set of vertex information of primitives constituting the object. Determining which of the plurality of position determination areas each vertex of the primitive belongs to the predetermined area or a space surrounding the predetermined area, and to which position determination area belongs based on the determination result The scissoring information for specifying is set as vertex information associated with the vertex.

  The scissoring processing unit 144 performs scissoring processing on a polygon including vertices exceeding the predetermined region of the primitive in the three-dimensional coordinate system, and generates a vertex data set including vertices newly generated by the scissoring processing.

  Further, the scissoring processing unit 114 determines whether there are vertices outside the predetermined area among the vertices in the minimum unit polygon unit constituting the primitive based on the scissoring information, and the minimum unit having the vertices outside the predetermined area The scissoring process is performed on the polygon, and the scissoring process is omitted for the minimum unit polygon having no vertex outside the predetermined region.

  The drawing unit 146 receives vertex information of the vertex data set (primitive) after geometry processing (after perspective transformation), performs texture mapping, depth cueing processing, pixel test, anti-aliasing, α blending processing, etc. A process of drawing an object in the frame buffer 174 in units of sets is performed.

  The drawing processing unit does not draw a polygon including a vertex exceeding a predetermined area.

  Note that the image generation system of the present embodiment may be a system dedicated to the single player mode in which only one player can play, or not only the single player mode but also a multiplayer mode in which a plurality of players can play. The system may also be provided.

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

2. Features and Operations of this Embodiment Next, features and operations of this embodiment will be described. In the following description, the case where the polygons constituting the object are polygons will be described as an example.

  FIG. 2 shows an example in which a missing display occurs on the game display screen. A display omission occurs in a part 210 of the road at a close distance from the viewpoint position.

  Such a display omission occurs because the value after perspective transformation exceeds a predetermined range and is not written to the frame buffer like a polygon near the viewpoint.

  Therefore, when an image of an object at a close distance such as a road or the ground in various games is generated, a display omission is likely to occur. Moreover, since the polygons of each road and ground are large, display omissions are easily noticeable.

  3A, 3B, and 3C are diagrams for explaining an example of the primitive of this embodiment.

  The primitive of this embodiment is a processing unit of the processor. For example, FIG. 3A is a triangle composed of independent triangles and is drawn with three pieces of vertex information (vertex data set). .

  Also, for example, FIG. 3B shows a triangle (triangle fan) that shares vertices, with the first triangle being three-point information, and thereafter, every time one piece of vertex information is added.

  Further, for example, FIG. 3C shows a continuous triangle (triangle strip) sharing a side, the first triangle is three-point information, and the subsequent drawing is performed every time one piece of vertex information is added.

  In addition, drawing is performed with one independent point (one vertex information), an independent line segment (two vertex information), a continuous line segment that shares end points (line strip), or two vertex information that represents a diagonal with an independent rectangle. Sprites to be performed can be treated as primitives.

  FIG. 4 is a diagram for explaining the vertex data set according to the present embodiment.

  Reference numeral 310 denotes a vertex constituting the primitive of the present embodiment.

  320 is vertex information stored in association with each vertex. The vertex information 320 is, for example, a drawing coordinate value, a vertex color, a texture coordinate value, a fog coefficient, and the like, and may be set in, for example, a vertex information setting register.

  Specifically, the vertex information includes texture coordinates ST (321, 322), texture coordinate Q value (323), scissoring bit (324), color information RGBA (325, 326, 327, 328) to be mapped to the vertex. , Coordinate value XYZ (329, 330, 331), drawing permission flag (332), and the like.

  The scissoring bit (324) determines whether each vertex of the primitive belongs to the predetermined area or a plurality of position determination areas set by dividing the surrounding space, and based on the determination result, This is scissoring information for specifying whether it belongs to the position determination area, for example, data in the format shown in FIG.

  The drawing permission flag 332 is in a first state (for example, ON) indicating that drawing is permitted when the vertex satisfies a predetermined condition, and drawing is performed when the vertex does not satisfy the predetermined drawing permission condition. Is in a first state (eg, OFF) indicating that permission is not permitted.

  Since the contents of the vertex information differ depending on the type of primitive, an area not used depends on the type of primitive.

  FIG. 5 is a diagram for explaining a plane used for scissoring processing in the present embodiment. In the present embodiment, scissoring processing is performed using the six surfaces 230, 232, 234, 236, 238, and 240 that constitute the view volume 220.

  By cutting on the six surfaces 230, 232, 234, 236, 238, and 240 constituting the view volume, it is possible to efficiently cut off everything except for the display portion so that the cut face is not visible on the display screen.

  Then, new vertices are generated at the cut-off portions, and the polygon including the new vertices is perspective-transformed to perform drawing processing.

  In the present embodiment, the view volume or the surrounding space is divided to set a plurality of position determination areas, and it is determined which of the primitives each vertex belongs to.

  FIG. 6 is a view of the view volume of FIG. 5 as viewed from the A direction (Y-axis direction).

  5 is a plane including 238 in FIG. 5, 252 is a plane including 234 in FIG. 5, 254 is a plane including 240 in FIG. 5, and 256 is a plane including 230 in FIG. In this way, the space around the view volume is divided using the planes 250, 252, 254, and 256 including the surfaces constituting the view volume, and a plurality of position determination areas are set.

  FIG. 7 is a view of the view volume of FIG. 5 as viewed from the B direction (X-axis direction).

  270 is a plane including 230 in FIG. 5, 272 is a plane including 240 in FIG. 5, 274 is a plane including 236 in FIG. 5, and 276 is a plane including 232 in FIG. In this way, the space around the view volume is divided using the planes 270, 272, 274, and 276 including the surfaces constituting the view volume, and a plurality of position determination areas are set.

  When the space around the view volume is divided in this way, 9 × 3 = 27 types of position determination areas including the view volume can be set.

  FIG. 8 is a diagram for explaining the configuration of scissoring bits (scissoring information). The scissoring bit is composed of 6 bits of bit 0 to bit 5, and each bit has information on which side of each surface constituting the view volume the vertex is located.

  Bit 0 is information indicating whether or not the vertex is located to the right of the surface 234 in FIG. 5, and bit 1 is information indicating whether or not the vertex is located to the left of the surface 238 in FIG. Bit 2 is information indicating whether or not the vertex is located below the surface 232 in FIG. 5, and bit 3 is information indicating whether or not the vertex is located on the surface 236 in FIG. Bit 4 is information indicating whether or not the vertex is located behind the surface 240 in FIG. 5, and bit 5 is information indicating whether or not the vertex is located in front of the surface 230 in FIG. 5.

  FIG. 9 is a flowchart showing the processing flow of the present embodiment.

  First, the perspective projection transformation of the vertex is performed (step S10).

  Next, light source calculation is performed (step S20).

  Next, clipping determination with the view volume as shown in FIG. 5 is performed, and scissoring bits as shown in FIG. 8 are held (step S30).

  Next, the result of logical sum operation with the scissoring bits of the past two vertices constituting the primitive is set as j (step S40).

  If j = 0, the polygon is drawn and registered (step S50).

  Then, it is determined whether or not the processing has been completed for all the vertices (step S60), and if not completed, the process returns to step S10. On the other hand, when processing is completed for all vertices, scissoring processing is performed (step S70).

  FIG. 10 is a flowchart for explaining the flow of scissoring processing according to the present embodiment.

  First, scissoring bits at three vertices are set in variables A, B, and C (step S110). Specifically, A = the scissoring bit of the first vertex, B = the scissoring bit of the second vertex, and C = the scissoring bit of the third vertex. In the case of a strip triangle, the first three points and after are slid and processed as A ← B, B ← C, C ← scissoring bit of the next vertex.

  Next, D = Aor B or C (or is a logical OR operation) is obtained (step S120).

  If D = 0, since it can be determined that all three vertices are in the view volume, the subsequent scissoring process is omitted because the drawing has already been registered (step S130).

  Next, E = A and B and C (and is a logical product operation) are obtained (step S140).

  If E is not equal to 0, it can be determined that all three vertices belong to some space on the six sides of the view volume, and the subsequent scissoring process is omitted (step S150).

  Then, scissoring processing between the camera view volume and the planar polygon at the three vertices is performed in the three-dimensional coordinate system (step S160).

  Thereafter, perspective transformation of the vertex is performed (step S170).

  Then, drawing registration of a polygon having a vertex newly generated in the scissoring process (step S160) is performed (step S180).

  Then, the processing of steps S110 to S190 is repeated until the processing of all vertices is completed (step S190).

  As described above, according to the present embodiment, when all the vertices constituting the polygon are in the drawable area, the processing of steps S90 to S110 can be omitted, and thus efficient primitive processing can be performed with a small processing load. It can be performed.

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

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

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

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

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

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

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

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

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

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

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

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

  The communication interface 990 is an interface for transferring data to and from the outside via a network. In this case, as a network connected to the communication interface 990, a communication line (analog telephone line, ISDN), a high-speed serial interface bus, and the like can be considered. By using a communication line, data transfer via the Internet becomes possible. In addition, by using the bus of the high-speed serial interface, other image generation systems, other game systems, home appliances (video decks, video cameras), information processing equipment (personal computers, printers, mice, keyboards), etc. Data transfer between them becomes possible.

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

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

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

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

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

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

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

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

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

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

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

An example of the block diagram of this embodiment is shown. FIG. 2 shows an example in which a missing display occurs on the game display screen. 3A, 3B, and 3C are diagrams for explaining an example of the primitive of this embodiment. It is a figure for demonstrating the vertex data set of this Embodiment. It is a figure for demonstrating the plane used for a scissoring process in this Embodiment. In the present embodiment, the six surfaces 230 and 2 constituting the view volume 220. FIG. 6 is a diagram when the view volume of FIG. 5 is viewed from the A direction (Y-axis direction). FIG. 6 is a view of the view volume of FIG. 5 viewed from the B direction (X-axis direction). It is a figure for demonstrating the structure of a scissoring bit (scissoring information). It is a flowchart figure which shows the flow of the process of this Embodiment. It is a flowchart figure for demonstrating the flow of the scissoring process of this Embodiment. It is a figure which shows an example of the structure of the hardware which can implement | achieve this embodiment. FIGS. 12A, 12 </ b> B, and 12 </ b> C are diagrams illustrating examples of various types of systems to which the present embodiment is applied.

Explanation of symbols

100 processing unit 110 game processing unit 114 movement / motion calculation unit 140 image generation unit 142 geometry processing unit 144 scissoring processing unit 146 drawing unit 150 sound generation unit 160 operation unit 170 storage unit 172 main memory 174 frame buffer 176 texture storage unit 180 information Storage medium 190 Display unit 192 Sound output unit 194 Portable information storage device 196 Communication unit 300 Vertex data set 320 Vertex information 324 Scissoring bit 332 Rendering flag 400 Primitive

Claims (5)

A program for generating an image of an object composed of polygons,
A vertex data set generation unit that performs coordinate conversion of an object arranged in a three-dimensional space into a screen coordinate system, and generates a vertex data set that is a set of vertex information of primitives constituting the object;
A scissoring processing unit that performs scissoring processing on a polygon including vertices exceeding a predetermined region of the primitive in a three-dimensional coordinate system, and generates a vertex data set including vertices newly generated by scissoring processing;
The computer functions as a drawing processing unit that performs drawing processing in units of primitives based on the vertex data set,
The vertex data set generation unit
A plurality of position determination areas are set by dividing the predetermined area or its surrounding space, and it is determined which of the primitives each vertex belongs to, and the position determination area is specified. Set scissoring information for the vertex information associated with the vertex,
The scissoring processing unit
Based on the scissoring information, it is determined whether there are vertices outside the predetermined area among the vertices in the minimum unit polygon unit constituting the primitive, and scissoring processing is performed on the minimum unit polygon having the vertices outside the predetermined area. A program characterized by omitting scissoring processing for a minimum unit polygon having no vertices outside a predetermined area. In claim 1,
The predetermined area is an area formed based on a view volume of a virtual camera, and the plurality of position determination areas are obtained by dividing a space around the view volume using a plane including each surface constituting the view volume. A program characterized by being set. In any one of Claims 1 thru | or 2.
The drawing processing unit
A program that does not draw a polygon that includes vertices that exceed a predetermined area.   A computer-readable information storage medium, wherein the program according to any one of claims 1 to 3 is stored. An image generation system for generating an image of an object composed of polygons,
A vertex data set generation unit that performs coordinate conversion of an object arranged in a three-dimensional space into a screen coordinate system, and generates a vertex data set that is a set of vertex information of primitives constituting the object;
A scissoring processing unit that performs scissoring processing on a polygon including vertices exceeding a predetermined region of the primitive in a three-dimensional coordinate system, and generates a vertex data set including vertices newly generated by scissoring processing;
A rendering processing unit that performs rendering processing in units of primitives based on the vertex data set, and the vertex data set generation unit includes:
A plurality of position determination areas are set by dividing the predetermined area or its surrounding space, and it is determined which of the primitives each vertex belongs to, and the position determination area is specified. Set scissoring information for the vertex information associated with the vertex,
The scissoring processing unit
Based on the scissoring information, it is determined whether there are vertices outside the predetermined area among the vertices in the minimum unit polygon unit constituting the primitive, and scissoring processing is performed on the minimum unit polygon having the vertices outside the predetermined area. An image generating apparatus characterized in that scissoring processing is omitted for a minimum unit polygon having no vertices outside a predetermined area.

Images