JPH08180207A - Stereoscopic picture processor - Google Patents

Abstract

PURPOSE: To reduce the quantity of operation and to process a simple texture mapping in real time. CONSTITUTION: This stereoscopic picture processor is provided with a geometric transformer 2 for calculating a transformation coefficient for transforming three-dimensional polygon coordinates into a two-dimensional mapping pattern and transforming each end point information of a polygon into coordinates, a polygon parameter memory 40 for storing the visual field coordinate values of respective end points of a polygon, the transformation coefficient and the size ratio of the polygon to the mapping pattern, a screen memory 5 for storing the end point information of a screen, the depth information of the polygon, and the address values of the memory 4, an outline processor 20 for calculating and interpolating a data value stored in the memory 5 in each scanning line, and an internal processor 30 for calculating the X address value of a polygon existing in the farmost position and the address value of the polygon in the memory 40 and accessing a mapping pattern memory 7 based upon the read information.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a stereoscopic image processing apparatus for projecting and displaying a three-dimensional polyhedron object on a two-dimensional screen, and in particular, it provides pixel information of a desired area of a texture plane to a desired area of a display plane. The present invention relates to a mapping processing device that projects on a graphic data of a region.

[0002]

2. Description of the Related Art Two-dimensional (flat) of a CRT display or the like by subjecting a three-dimensional solid figure to perspective conversion processing, perspective processing, etc.
In the case of compositing and displaying on the screen, it is necessary for an object existing in the front to perform a process of hiding a part or all of the objects located behind it, that is, a hidden surface erasing process. As a method of hidden surface removal processing, Z sort method (painting over method), Z
A buffer method, a scan line method, etc. are known.

The Z-sort method has an advantage that the processing can be performed at a very high speed, but has a drawback that a model cannot be drawn correctly when polygons intersect each other.

The Z-buffer method is an algorithm which eliminates the above-mentioned drawbacks of the Z-sort method by performing front-back determination in units of pixels inside the polygon processing. In the Z buffer method, the color data of the polygon to be displayed in each pixel and the depth of the surface, that is, the Z value (distance from the starting point) of the object is stored in pixel units, and is stored each time a new polygon is input. The current Z value and the Z value of the new polygon are compared, the Z value is updated only when the new Z value is smaller, and the color data of the new polygon is registered at the same time. This allows distant objects to be overwritten by nearby objects, resulting in an image with hidden surfaces removed.

This Z-buffer method requires a Z-buffer memory for storing the Z-value of an object for each pixel, and has a problem that a large image memory having a size corresponding to the number of pixels is required as a whole.

On the other hand, in the scan line method, when color data of each pixel is displayed for each raster scan like CRT, the adjacent pixel, that is, the pixel of the next scan line, has a very strong correlation with the current pixel. This method is suitable for a device that performs sequential processing by paying attention to the fact that it has, but has a drawback that it requires many calculations and the control logic becomes complicated.

As an intermediate hidden surface processing of the above two hidden surface removal processing methods, the correlation between scan lines is used to
An apparatus using the Z buffer method in the line is disclosed in, for example, Japanese Patent Laid-Open No. 62-100878. This includes "a depth register that holds the depth distance (Z value), a brightness register that holds the brightness (color / luminance) data, inside / outside determination within the range of the plane segment, displacement addition of the depth distance, and depth data One adder for performing divisional comparison, an input / output means for outputting the information about the input plane segment token through a one-stage pipeline register, and a luminance data bus for outputting the contents of the luminance register to the outside. Hidden line processing device provided with ". According to this device, hidden surface processing can be performed with a small amount of hardware.

In the above-mentioned hidden surface processing apparatus, since only the brightness data is registered and the brightness data is displayed, the filling processing such as shading can be performed, but the pattern ( It was not possible to perform the mapping process to paste the texture). However, in computer graphics, it is desired to reproduce a more realistic image, and a method of reproducing an image by mapping a texture such as a real image of a target object on a polygon is adopted.

An image processing apparatus has been proposed which performs a so-called mapping process in which a pattern (texture) is attached to each displayed polygon (see Japanese Patent Application No. 4-37311).

According to this image processing apparatus, the pattern is changed inside the polygon in response to the change in the outer shape of the polygon,
Patterns can be added to polygons.

However, in the image processing apparatus capable of the above-described mapping processing, the mapping to the polygon can be easily performed, but in this apparatus, the Z sort method is used as the hidden surface removal method of the polygon. However, there is a problem that the model cannot be drawn correctly when the polygons intersect.

As a method for solving this problem, an image processing apparatus for performing mapping processing using the Z buffer method has been proposed (see Japanese Patent Application No. 4-37311).

[0013]

However, in the above-mentioned apparatus, since the mapping calculation is divided into the vertical direction and the horizontal direction in order to reduce the amount of hardware, the polygon edge memory for storing the intermediate parameter is stored. There is a problem that the capacity is increased and the processing efficiency decreases due to the vertical mapping calculation before the hidden surface processing, and the drawing speed decreases accordingly.

An object of the present invention is to provide a stereoscopic image processing apparatus capable of processing a simple perspective texture mapping at low cost with a small amount of calculation in real time.

[0015]

According to the present invention, there is provided a means for calculating a conversion coefficient for performing a mapping conversion from a three-dimensional polygon coordinate to a two-dimensional mapping pattern, and a mapping pattern memory for storing end point information forming a polygon and a texture image. Storage means for storing end point information and depth information of the polygon, conversion means for coordinate conversion of each end point information from the storage means, field coordinate values of the end points of the polygon, the conversion coefficient, the size of the polygon and the mapping pattern. Parameter storage means for storing the ratio of the height for each polygon, screen storage means for storing the screen end point information from the conversion means, the depth information of the polygon and the address value of the polygon parameter storage means, and the conversion means from the conversion means. Address information of polygon outline based on screen end point information And the depth information of the polygon and the contour processing means for converting the address value of the polygon parameter storage means into the contour portion information of the polygon for each scan line, and the information between the two opposite sides calculated by the contour processing means. A means for calculating the displacement of the X address and the displacement of the depth information, a means for determining whether or not the pixel position corresponding to each pixel of the scan line is within the range of the polygon, and the means for foremost exist. A means for comparing the depth information of a pixel with the depth information of the polygon at that pixel position, and a means for constantly rewriting the depth information of the comparison target to the depth information of the polygon that is present in the foreground, and the displacement of the depth information in the depth information of the polygon. Is added to calculate the depth information of the adjacent pixel position, and Means for calculating at least one X address between two opposite sides of the polygon and the address value of the polygon parameter storage means, and the polygon parameter storage means accessed and read by the calculated address value of the polygon parameter storage means. It comprises means for calculating an address value of the mapping pattern memory based on information, and means for accessing the mapping pattern memory based on the calculated mapping pattern address and transferring image data to the display means.

The means for calculating the conversion coefficient may be configured to calculate the conversion coefficient by subjecting the conversion coefficient to object rotation processing and visual field conversion rotation processing.

Further, it is preferable to use the same conversion coefficient for polygons that perform the same rotational movement in the same direction.

[0018]

According to the present invention, conversion coefficients (UX, U) for converting three-dimensional polygon coordinates into a two-dimensional mapping pattern are provided.
Y, UZ), (VX, VY, VZ), and after performing hidden surface processing by the Z buffer method, U is calculated using this conversion coefficient.
-V mapping and projective mapping are performed to obtain the address of the mapping pattern memory. That is,
ROM of the coordinates of the polygon on the object coordinates and the above conversion coefficients (UX, UY, UZ), (VX, VY, VZ)
Stored in a storage means such as, for example, rotation calculation of an object, rotation calculation by visual field conversion, etc., each time the direction of a polygon changes, conversion coefficients (UX, UY, UZ), (VX, V
Y, VZ) is also subjected to the same rotation calculation as the polygon end points, and conversion coefficients (UX, UY, UZ), (VX, UZ) from the three-dimensional polygon on the visual field coordinates to the two-dimensional mapping pattern are obtained.
VY, VZ) is obtained and the mapping operation is performed at the point where the hidden surface processing is completed, so that the mapping can be performed at high speed with a small amount of hardware.

Further, conversion coefficients (UX, UY, UZ),
(VX, VY, VZ) does not have for each polygon, but can be combined as long as they have the same direction and the same rotational motion, and the capacity of the ROM or the like can be reduced.

Further, since the mapping memory addresses (MX, MY) are not assigned to the polygon end points, the conversion coefficient (UX, U) to which the polygon belongs when performing a special effect such as changing the mapping pattern of the polygon surface.
By changing (Y, UZ) and (VX, VY, VZ), many polygons can be processed with less processing.

[0021]

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

FIG. 1 is a block diagram showing the overall structure of a pseudo three-dimensional image processing apparatus using the present invention. This apparatus is suitable for use in, for example, a game machine such as a racing game or an airplane control simulation. An example is shown. The overall configuration of the present invention will be described with reference to FIG.

The structure of the image information supply device 10 will be described. This device includes a world memory 1, a geometric conversion device 2, an operation unit 3, and a CPU 4. In this world memory 1, all objects are represented as a collection of a plurality of polygons, and the end points of the polygons are represented by X, Y, and
It is stored as the Z coordinate. Further, in this world memory 1, the X of the polygon end point on the coordinates of the object,
The end point information data of the mapping pattern memory 7 storing the texture image is stored corresponding to the Y and Z coordinates and the polygon. The operation unit 3 includes a handle,
It is composed of an accelerator, a brake, etc., and the operation contents thereof are converted into an electric signal and output to the CPU 4.

The CPU 4 calculates the situation data according to this situation according to the electric signal converted based on the contents of the operation unit 3 constituted by the handle access or the like, and gives the data to the geometrical transformation device 2.

The geometrical transformation device 2 reads the data of the end point information of each polygon from the world memory 1 according to the instruction from the CPU 4, executes the matrix calculation necessary for the movement of the object and the rotation of the visual field, and screens the end points of the world coordinates. Geometric transformation such as projection transformation is performed on the coordinates, and the two-dimensional X, Y screen data is given to the screen memory 5.

Further, the geometrical transformation device 2 determines the field-transformed representative value of the polygon, that is, the depth distance data (Z value) which is the distance from the starting point of the polygon, and gives the data to the screen memory 5. . As shown in FIG. 34, the screen memory 5 stores X, Y screen coordinate values and Z values for the end points of each polygon.

The geometrical transformation device 2 according to the present invention further includes a mapping pattern from the three-dimensional coordinates of the polygon.
Conversion coefficients (UX, UY, UZ), (VX, V) for conversion to dimensional coordinates by UV mapping, projective mapping, etc.
(Y, VZ) in the conversion table area of the polygon parameter memory 40, and at the same time, the ratio of the size of the polygon and the mapping pattern EX0, EY0, EZ0 of the polygon end point and the visual field coordinates of the polygon end point serving as the reference of the mapping pattern. (Scale) and the table address storing the conversion coefficient to which the polygon belongs are written in the polygon parameter area of the polygon parameter memory 40.

As described above, the polygon parameter memory 40 stores, as shown in FIG. 36, the E of the visual field coordinates of the polygon end points which serve as a reference for the mapping pattern of each polygon.
X0, EY0, EZ0, the size ratio (Scale) between the polygon and the mapping pattern, the polygon parameter area that stores the conversion table address to which the polygon belongs, and the three-dimensional coordinates of the polygon are converted into the two-dimensional coordinates of the mapping pattern. Coefficient (UX, UY, UZ),
And a conversion table area for storing (VX, VY, VZ).

The geometric transformation device 2 according to the present invention transforms a transformation vector for matrix calculation and mapping in the geometric transformation process and a transformation vector on object coordinates into a transformation vector on visual field coordinates. FIG. 2 is a block diagram showing an example of the matrix operation processing device.

As described above, the present invention is shown in FIG.
As shown in (b) of the figure, the transformation coefficients (UX, UY, UZ), (in order to perform planar mapping by UV mapping and projective mapping from the three-dimensional polygon coordinates as shown in FIG. VX, VY, V
Z) is obtained, and the mapping pattern memory address is obtained by the polygon outer shape processing device 20 and the polygon inner processing device 30 described later.

Therefore, the coordinates of the polygon on the object coordinates and the conversion coefficients (UX, UY, UZ), (VX,
VY, VZ) is stored in a ROM or the like, and the geometric conversion circuit 2 stores the conversion coefficient in the polygon parameter memory 40. Then, the geometric conversion circuit 2 changes the conversion coefficient (UX, UY, UZ) each time the direction of the polygon changes, such as a rotation calculation by the view conversion of the rotation calculation of the object.
For (VX, VY, VZ), the rotation calculation similar to the polygon end point is performed. Then, conversion coefficients (UX, UY,
UZ), (VX, VY, VZ) are obtained, and mapping calculation is performed at the point where the hidden surface processing is completed.

Further, as shown in FIG. 5, for a plurality of objects on the UV coordinate, for example, when each object is composed of polygons of (1), (2) and (3), conversion coefficients (UX, UY , UZ), (VX, VY, VZ) are
The following is for each polygon.

[0033]

## EQU1 ## (for polygon 1) UX, UY, UZ = 1,0,0 VX, VY, VZ = 0,0,1 (for polygon 2) UX, UY, UZ = 1,0,0 VX , VY, VZ = 0,1,0 (for polygon 3) UX, UY, UZ = 0,1,0 VX, VY, VZ = 0,0,1

Therefore, the conversion coefficients (UX, UY, UZ),
It is not necessary to have (VX, VY, VZ) for each polygon, but (VX, VY, VZ) can be put together if they have the same direction and only the same rotational movement. Further, since the mapping memory addresses MX and MY are not assigned to the polygon end points, when performing a special effect such as changing the mapping pattern of the polygon surface, the conversion coefficients (UX, UY, UZ), (VX, By changing VY, VZ), many polygons can be processed with less processing.

On the other hand, the matrix calculation device shown in FIG. 2 performs the matrix calculation in the geometric conversion device 2 and the matrix calculation for converting the conversion vector for mapping and the conversion vector on the object coordinates into the conversion vector on the visual field coordinates. As shown in the figure, in this device, a program of the CPU 4 and polygon end point coordinate data converted by the matrix calculation processing device 102 are stored in the memory 101, and the CPU 4 controls the matrix calculation processing operation by this program.

The matrix operation device 102 is an interface (I / F) 1 for exchanging data from the memory 101.
03, and a matrix operation device 103 that performs the operations shown in the following formulas 2 and 3.

As shown in FIG. 3, the interface 103 is provided with a data input / output device 103a and an address arithmetic processing device 103b, and the CPU 4 can specify the start address and end address of data, and the start address and end address of the sending side. Then, the address is sent to the memory 101, the data from the memory 101 is received by the data input / output device 103, and the contents of the memory 101 are written.

[0038]

[Equation 2]

[0039]

## EQU3 ## x '= ax + dy + gz + Tx y' = bx + ey + hz + Ty z '= cx + fy + iz + Tz

As shown in FIG. 6, the geometric conversion circuit 2 controls the geometric conversion circuit 2 so that the geometric conversion circuit 2 first performs a normal geometric conversion process and then the mapping conversion process.

In the mapping conversion process, as shown in FIG. 7, the x, y, z rotation of the object is converted into a conversion vector V.
X, VY, VZ, followed by x, y, z rotation of the field of view for the transform vectors VX, VY, VZ.

Next, FIG. 8 shows an operation example of the matrix operation device 104 in the geometric conversion circuit 2. FIG. 8 shows an example of calculation of object rotation, which includes conversion vectors (VX, VY,
For VZ), matrix operations of Y rotation, X rotation, and Z rotation are performed. An example of this calculation is summarized in FIG. In this way, the matrix calculation device 104 calculates the object rotation.

FIG. 10 shows an example of calculation of the field of view rotation, and matrix calculation of Y rotation, X rotation, and Z rotation is performed on the conversion vector (VX, VY, VZ). A summary of this calculation example is shown in FIG. In this way, the matrix calculation device 104 calculates the field of view rotation.

The thus geometrically transformed data is stored in the screen memory 5 and the polygon parameter memory 40, respectively.

Next, the polygon contour processing apparatus 2 of the present invention.
0 is a polygon extraction device 21 and a parameter calculation device 2
2. The vertical interpolation calculation device 23. The polygon extracting device 21 determines, based on the XY address of the polygon end point read from the screen memory 5, to which direction the vector of each side forming the polygon belongs, as shown in FIG. Accordingly, as shown in FIG. 39, it is determined whether the endpoints forming the sides of the polygon belong to the right side or the left side. Then, the polygon extracting device 2
At 1, the end points of each side forming the polygon, that is, the X start point address (XS), the end point address (XE), the Y start point address (YS), and the right side address (YE) are loaded from the screen memory 5 and the polygon Of the depth distance data (Z value) of the
Give each data to.

The parameter arithmetic unit 22 of the parameters of the polygon outline shape processing unit 20 calculates the parameters necessary for obtaining the outline end point information of the polygon by digital differential analysis (DDA), and the parameters are calculated by the vertical interpolation arithmetic unit. Give to 23. The vertical interpolation calculation device 23 calculates by interpolating the outer edge point information and the Z value of each of the left side and the right side where the polygon intersects each scan line. Each calculated data is given to the polygon edge memory 6. Details of the polygon outer shape processing device 20 will be described later.

Then, in the polygon edge memory 6, as shown in FIG. 35, each data given from the polygon outer shape processing device 20, that is, the X value of the left side of the polygon for each scan line, the polygon parameter memory address,
The Z value, the X value on the right side, and the Z value are stored for the resolution in the vertical direction (Y address direction) of the screen.

Further, the polygon edge memory 6 has
Number of polygons stored in one Y address (CN
T) is written. That is, 1 for each Y address
Each time the number of polygons is stored, the number of polygons is counted up, and this count number (CNT) is written in the polygon edge memory 6.

Each data stored in the polygon edge memory 6 is given to the polygon internal processing device 30. The internal polygon processing device 30 includes a parameter calculation device 31,
It is composed of a horizontal interpolation calculation device 33 and a hidden surface processing device 34.

The parameter calculation unit 31 receives the values (XL, XR) of the left side X and the right side X of the polygon and the Z values (ZL, ZR) of the left side and the right side of the polygon from the polygon edge memory 6 for each scan line, and performs horizontal interpolation. The parameters necessary for the calculation are calculated, and the parameters are transferred to the hidden surface processing device 34.

The hidden surface processing device 34 in this embodiment is Z
The hidden surface processing using the buffer method is performed. The parameters are received from the parameter calculation device 31 for each scan line, and the hidden surface processing is sequentially performed for each dot (pixel) on the pipeline. When all the data of one scan line are processed, the polygon parameter memory address of each dot is sequentially calculated by the horizontal interpolation calculation device 33.
The hidden surface is processed by transferring to. That is, at each dot, the Z value of the stored polygon in the foreground is compared with the Z value of the polygon to be processed, and if the Z value of the polygon to be processed is small, the parameter address of that polygon is set horizontally. The Z value is transferred to the interpolation calculation device 33, and the Z value is stored as the Z value to be compared. When the Z value of the polygon to be processed is large, the Z value and the parameter address are not rewritten, and the previously stored polygon parameter address value is transferred to the horizontal interpolation calculation device 33.

The horizontal interpolation calculation device 33 is the hidden surface processing device 3.
The polygon parameter memory 40 is accessed in accordance with the polygon parameter address received from No. 4, the parameter is read, mapping operation is performed based on this parameter, and the mapping pattern memory address (MX, M
Y) is calculated. At the calculated mapping pattern memory address (MX, MY), for example, the mapping pattern memory 7 in which data as shown in FIG. 37 is stored.
By accessing R, G, B of each dot based on the data stored in the mapping pattern memory 7.
Alternatively, the luminance (LUT) values are sequentially read and written in the frame memory 8. Details of the internal polygon processing device 30 will be described later.

The R, G, B or LUT values of the dots given from the polygon internal processing unit 30 to the frame memory 8 are transferred to the CRT 9 and displayed as an image.

Next, the polygon contour processing apparatus 2 of the present invention
0, FIG. 12 to FIG.
This will be described with reference to FIG.

In this embodiment, the polygon is a screen end point coordinate (X, Y) and a polygon end point field of view coordinate (E
(X, EY, EZ) and the depth distance (Z value), the hidden surface processing by the Z buffer method is performed, and, for example, the texture shown in FIG. Map to.

First, the polygon outline processing performed by the polygon outline processing device 20 will be described with reference to FIGS.

For this outer shape processing, the polygon extraction device 21 determines in which direction the vector of each side forming the polygon is based on the XY address of the polygon end point read from the screen memory 5 as shown in FIG. Whether it belongs or not is determined, and depending on the direction of the vector, as shown in FIG. 39, it is determined whether the endpoints forming the sides of the polygon belong to the right side or the left side.

The screen memory 5 stores the screen end point coordinates (X, Y) and the Z value of the polygon. The polygon extracting device 21 of the polygon outline processing device 20 accesses the screen memory 5, reads the screen end point coordinates (X, Y) and the Z value of each polygon from the screen memory 5, and digitally analyzes the outline of the polygon (DD).
A parameter calculation device 22 for determining the right side or the left side of the polygon and calculating the parameter for the calculation in A).
The data corresponding to each side is given to. That is,
In the X parameter calculation device 22a, the screen coordinates are
The screen coordinates (X, Y) and the Z value (ZS, ZE) of the start point and the end point of each side are given to the Z parameter calculation device 22b.

In the X parameter calculation device 22a of the polygon outline shape processing device 20, the starting point (YS) of the Y address of each side of the screen coordinates given by the polygon extraction device 21.
And a distance (DY) in the Y direction from the end point address (YE). That is, the calculation of DY = YE-YS is performed. Subsequently, DX = X in order to calculate the distance (DX) from the X end point (XE) to the X start point (XS) of each side of the screen coordinates.
E-XS calculation is performed. Using these DY and DX, DX / DY is calculated as a parameter for digital differential analysis (DDA) of the outer shape of the polygon, and the fine difference value (DD
X) is calculated. This DDX is transferred to the X-value vertical interpolation device 23a. Then, the X-value vertical interpolation device 23a performs interpolation calculation, and the interpolated data is stored in the polygon edge memory 6 via the polygon edge memory controller 24.

That is, as shown in equation (1) below,
The X-value parameter calculation device 22a calculates the fine difference value, and as shown in the following equation (2), the X-value vertical interpolation calculation device 23a performs interpolation calculation to determine the address from the start point to the end point of each side. calculate. The initial value of X in the equation (2) is the starting point data (XS).

[0061]

(4) DDX = (XE−XS) / DY (1) X = X + DDX (2)

Further, the start point address (ZS) and end point address (ZE) of the Z value read from the screen memory 5
The data for the polygon is calculated from the address data of the above by the digital differential analysis (DDA) in the Z value parameter computing device 22b and the Z value vertical interpolation device 23b based on the following equations (3) and (4). Stored in the edge memory 6. That is, the fine difference value is calculated as shown in Expression (3), and the interpolation calculation is performed as shown in Expression (4) to calculate the data from the end point to the start point of each side. The initial value in the equation (4) is the starting point data (XS).
The calculation of equation (4) is repeated from 0 to DY.

[0063]

## EQU5 ## DDZ = (ZE-ZS) / DY (3) Z = Z + DDZ (4)

In this example: In synchronization with the scan line, the outline of the polygon, the outline address information of the mapping pattern modified based on the outline of the polygon, and the outline address information of the Z value are stored in the polygon edge memory 6 for each Y address.

Each of the above-mentioned devices is controlled by a controller 25, which controls the parameter calculation device 22 and the vertical interpolation calculation device 23 in order to interpolate between the end points by DDA according to the flow chart shown in FIG.

Next, a concrete configuration example of the polygon outer shape processing device 20 is shown in FIGS. FIG. 13 is a circuit diagram showing a specific configuration of the X parameter calculation device 22a.

The X value parameter computing device 22 shown in FIG.
“A” is for calculating an X value parameter used for vertical interpolation calculation.

The start point (YS) read from the screen memory 5 is stored in the register 201, and the Y end point (YE) read from the screen memory 5 is stored in the register 202. From these registers 201 and 202, YS and YE are stored. Is input to the subtractor 205.

The subtracter 205 subtracts YS from YE, and this value (DY) is temporarily stored in the register 207.

The X start point (XS) read from the screen memory 5 is stored in the register 203, and the X end point (XE) read from the screen memory 5 is stored in the register 204.
And XS and XE are applied to the subtracter 206 from the registers 203 and 204.

The subtractor 206 subtracts XS from XE, and the register 208 temporarily stores this value (DX).

From the registers 207, 208 to the divider 209
In addition, the DX processed by the subtractor 206 and the subtractor 205
The subtracted DY is given, and the value of DX is divided by DY. Fine difference value DD calculated by the divider 209
The X is temporarily stored in the register 210 and then transferred to the X vertical interpolator 23a.

FIG. 14 is a circuit diagram showing a specific structure of the Z parameter calculation device 22b. The Z parameter calculation device 22b shown in FIG. 14 is for calculating Z parameters used for vertical interpolation calculation.

The Y start point (YS) read from the screen memory 5 is stored in the register 235, and the Y end point (YE) read from the screen memory 5 is stored in the register 236. From these registers 235, 236, YS, YE is input to the subtractor 239.

The subtracter 239 subtracts YS from YE, and this value (DY) is temporarily stored in the register 241.

The Z start point (ZS) read from the screen memory 5 is stored in the register 237, and the Z end point (ZE) read from the screen memory 5 is stored in the register 238.
And XS and ZE are applied to the subtractor 240 from both the registers 237 and 238.

The subtractor 240 subtracts ZS from ZE, and this value (DZ) is temporarily stored in the register 242.

From the registers 241, 242 to the divider 243
Is given to DZ subjected to the subtraction processing by the subtractor and DY subjected to the subtraction processing at the subtractor 239, and the value of DZ is divided by DY. The fine difference value DDZ calculated by the divider 243 is temporarily stored in the register 244 and then transferred to the Z vertical interpolation device 23b.

Next, the configuration of the X-value vertical interpolation calculation device 23a will be described with reference to FIG.

The screen coordinate XS transferred from the X value parameter calculation unit 22a is stored in the register 247 via the multiplexer 245.

The multiplexer 245 transfers the value of the X parameter calculation unit 22a to the register 247 only when receiving the start signal, and otherwise, the adder 24
8 is controlled to be transferred to the register 247.

The register 246 temporarily stores the value of the parameter DDX transferred from the X value parameter arithmetic unit 22a.

Upon receiving the start signal, the value of the register 246 is transferred to the adder 248. X and DDX are added by the adder 248, and the addition result (X) is given to the register 249 and stored in the polygon edge memory 6 via the polygon edge memory controller 24.

The structure of the Z-value vertical interpolation device 23b will be described with reference to FIG.

The ZS transferred from the Z value parameter computing unit 22b is transferred to the register 26 via the multiplexer 260.
Stored in 2.

The multiplexer 260 transfers the value of the Z value parameter computing device 22b to the register 262 only when receiving the start signal, and otherwise, the adder 26
3 output is controlled to be transferred to the register 262.

The register 261 temporarily stores the value of the parameter DDZ transferred from the Z value parameter calculation device 22b.

Upon receiving the start signal, the value of the register 262 is transferred to the adder 263. The adder 263 adds Z and DDZ, and the addition result (Z value) is given to the register 264 and stored in the polygon edge memory 6 via the polygon edge memory controller 24.

FIG. 1 shows the internal polygon processing device 30.
7 to 29 will be described. As described above, the polygon internal processing device 30 is composed of the parameter calculation device 31, the horizontal interpolation calculation device 33, and the hidden surface processing device 34. First, the parameter calculation device 33 will be described with reference to FIGS.

The parameter calculation unit 31 reads the XY address between the two sides corresponding to each scan line, that is, the left side and the right side from the polygon edge memory 6, and based on the read address information, (5) of the following formula 6
The address of each pixel dot inside the polygon is calculated as the hidden surface parameter address according to the equations (6).

That is, in this embodiment, in synchronization with the scan line scanning signal, the polygon edge memory controller 31a synchronizes with the scan line scanning signal, and the X left side (XL) of two points indicating the outer shape of the polygon corresponding to the Y address as its vertical position.
And X right side (XR), Z value (ZL, ZR) and polygon parameter memory address are read from the polygon edge memory 6.

From the left and right side addresses of the X address read from the polygon edge memory 6, the distance (DXY) in the X direction is calculated as shown in equation (5).

Using this DXY, the hidden surface processing parameter arithmetic unit 31b calculates the parameters used for the digital differential analysis (DDA) of the Z value read from the polygon edge memory 6 based on the equation (6).

[0094]

(6) DXY = XR-XL (5) DZ = (ZR-ZL) (6)

Then, as shown in FIG. 17, the polygon edge memory controller 31a causes the polygon edge memory 6 to read the left side of each Y address (scan line),
The scan line address (XL, XR) and Z value (ZL, ZR) on the right side are read out, and the data are transferred to the hidden surface processing parameter arithmetic unit 31b.

FIG. 18 is a circuit diagram showing a specific configuration of the hidden surface processing parameter calculation device 31b.

Polygon edge memory controller 31a
As a result, the scan line address (XL) on the left side of each Y address (scan line) is given to the register 320, and the scan line address (XR) on the right side is given to the register 321, and from these registers 320, 321 XL, XR
Is input to the subtractor 324.

The subtractor 324 subtracts XL from XR, and this value (DXY) is temporarily stored in the register 326.

Further, the left side (ZL) of the Z value is registered in the registers 322 and Z by the polygon edge memory controller 31a.
The right-hand side (ZR) of the value is given to the register 323, respectively, and the subtracter 325 is used from these registers 322 and 323.
Are given ZL and ZR.

The subtractor 325 subtracts ZL from ZR, and this value (DZ) is temporarily stored in the register 327.

From the registers 326 and 327 to the divider 324
The subtraction processed DXY and the subtractor 325 subtracted DZ are given, and the value of DZ is divided by DXY. The fine difference value DDZ calculated by the divider 328 is stored in the register 3
After being temporarily stored in 29, it is transferred to the hidden surface processing device 34 via the hidden surface processing device interface (I / F) 31e. The above circuits are controlled by the controller 40,
It operates according to the flowchart of FIG.

FIG. 19 shows a block diagram of the hidden surface processing apparatus. The hidden surface processing device 34 performs hidden surface processing using the Z buffer method, receives parameters from the parameter calculation device 31 for each scan line, and sequentially receives the parameters for each dot (pixel) on the pipeline. The hidden surface processing is performed, and when all the data of one scan line is processed, the hidden surface processing is performed by sequentially transferring the parameter memory address of each dot to the horizontal interpolation calculation device 33. That is, at each dot, the Z value of the stored polygon in the forefront is compared with the Z value of the polygon to be processed, and if the Z value of the polygon to be processed is small, the polygon parameter memory address of that polygon is set. Is transferred to the horizontal interpolation calculation device 33 and the Z value is stored as the Z value to be compared. When the Z value of the polygon to be processed is large, the Z value and the parameter address are not rewritten, but the polygon parameter address value that has been stored previously is transferred to the horizontal interpolation calculation device 33.

The X value (XL) on the left side, the Z value (ZL) on the left side, the difference between the X values on the left side and the right side (DXY), the slight difference between Z values (DDZ), and the polygon parameter memory address are sent from the parameter arithmetic unit 31. It is given to the parameter calculation device I / F 34b of the hidden surface processing device 34, and each data is transferred from the parameter calculation device I / F 34b to the scan line hidden surface processing device 34a.

The scan line hidden surface processing device 34a uses the Z
The hidden surface processing based on the buffer method is performed. In order to perform the hidden surface processing for each dot of the scan line, the hidden surface processing is performed for each dot of the scan line as shown in the block diagram of FIG. Then, the number (n + 1) of horizontal dot hidden surface processing devices 34-0 to 34-34 corresponding to the horizontal resolution.
-N is provided.

Then, the data received from the parameter calculation unit 31 is sequentially subjected to pipeline processing from the 0 address of the pipeline in which the horizontal dot hidden surface processing units 34-0 to 34-n for each dot level of the scan line are connected. Performs high-speed hidden surface processing. The horizontal dot hidden surface processing devices 34-0 to 34-n correspond to each dot of the scan line and perform the hidden surface processing of the dot by the Z buffer method.

FIG. 21 shows an embodiment of a horizontal dot hidden surface processing device. Depth distance data (Z) corresponding to each dot on the scan line transferred from the parameter calculation device 31.
The value) is stored in the depth register 341 via the parameter arithmetic unit I / F 34b. Parameter calculation device I /
The address of the polygon parameter memory 40 corresponding to each dot on the scan line transferred from F34b is stored in the parameter address register 342.

One of the inputs of the comparator 344 is the value of the state of the A bus, that is, the Z value of the polygon given through the parameter arithmetic unit I / F 34b, and the other input is
Depth register 341 via multiplexer 343
Either the previous Z value stored in or the X value corresponding to the dot, that is, the X address value is given. In this multiplexer 343, the comparator 344 uses the Z of another polygon.
When the value is compared with the value, the value of the depth register 341 is sent to the comparator 344, and when it is checked whether another polygon hits this dot, the X address value is sent to the comparator 344. Then, the comparator 344 determines whether or not the polygon flowing through the pipeline hits that dot, and if so, the Z value of that polygon is the Z value of the polygon stored in the parameter address register 342.
With respect to the value, it is determined which one is closer, that is, which Z value is smaller, and the controller 352 is notified of the result.

The adder 346 calculates the Z value and the difference D between the Z values.
By adding DZ, digital differential analysis (DD
A) is performed to obtain the Z value of the next dot, or the difference between the X values of the left side and the right side, and 1 is subtracted from DXY to obtain the right side value of X of the polygon. Therefore, the adder 34
DDZ and DXY are given to one of 6 from the B bus,
To the other side, the value of Z or "-1" of the state of the A bus is given from the multiplexer 345. Multiplexer 345
Sends the value Z of state 2 of the A bus to the adder 346 when the adder 346 calculates the Z value, and sends the value "-1" to the adder 346 when the DXY operation is performed.

The adder 346 of the multiplexer 348 is D
When the XY operation is performed, the output of the adder 346 is sent to the B bus pipeline register 350, and at other times, the value of the B bus is sent to the B bus pipeline register 350.

The adder 346 of the multiplexer 347 is Z
When the value is updated, the output of the adder 346 is sent to the A bus pipeline register 349, and at other times, the value of the A bus is sent to the A bus pipeline register 349. This A
The value of the bus pipeline register 349 is transferred to the horizontal dot hidden surface processing device 34 at the next stage.

The value of the bus of the B bus pipeline register 350 is transferred to the horizontal dot hidden surface processing unit 34 at the next stage. The value of the C bus pipeline register 351 is transferred to the horizontal dot hidden surface processing device 34 at the next stage. The controller 352 is driven by an active signal received from the E bus, and if it is active, operates the horizontal dot hidden surface processing device according to the flow shown in FIG. 32, and if it is not active, does not drive the E bus pipeline flip-flop. The E bus signal indicating whether or not the controller 352 is active is stored in 353, and the E bus signal is transferred to the next horizontal dot hidden surface processing device 34.

FIG. 22 shows the data flow of each bus. The operation of the hidden surface processing apparatus will be described with reference to FIGS. 21 and 22.

First, as the right end point information of the scan line, the difference DXY between the right side and the left side is given from the B bus instead of the coordinate value. That is, the coordinates (XL, ZL) on the left side, DXY, and the fine difference value DDZ of the Z coordinate per unit dot are A bus and B bus from the left side of the horizontal dot hidden surface processing device 34 having the array structure shown in FIG. It is input separately. The control information (E bus signal stored in the flip-flop 353) includes information indicating that the dot is within the range. As shown in FIG. 22, the data of each bus is given in a time division manner.

The operation of each horizontal dot hidden surface processing device 34 will be described with reference to FIGS. 11 and 12. In the first timing state, XL is given to the A bus, DXY is given to the B bus, Z value is given to the A bus and DDZ is given to the B bus at the second timing, and both timings of state 1 and state 2 are given to the C bus. Gives the parameter address. When the comparator 344 is negative, this dot has entered the polygon existing range at this pixel position, and the multiplexer 345 gives the data “−1” to the adder 346. DXY is given to the other side of the adder 346 from the B bus. When the dot is within the polygon existing range, the multiplexer 347 outputs the output of the adder 346 to the register 349.

In the second state, if the dot is within the existing range, Z of A bus and DDZ of B bus are added and the output of adder 346 is output to B bus. For example, the data is output to the B bus without being updated. When the result of comparing the data ZA stored in the A data Z depth register 341 on the A bus with the comparator 344 in the state where the dots are within the existing range is Z <ZA,
The data in the depth register 341 is rewritten, and the parameter address register 342 stores the Z and C bus polygon parameter memory addresses, respectively.

A horizontal dot hidden surface processing device 34 shown in FIG.
At −0, 1 is subtracted and 0 is obtained, so that the Z value is not updated and compared with ZA. In the horizontal dot hidden surface processing device 34-1, 1 is further subtracted and becomes negative.
Y is output to the A bus, and the subsequent horizontal dot hidden surface processing device performs subtraction on DXY. The horizontal dot hidden surface processing device 34-1 further sets the flip-flop 353 to 1 and updates the Z value and compares it with ZA. In the hidden surface processing device in the latter stage, DXY is sequentially subtracted by 1, and the process is continued until the result becomes negative. When it becomes negative, flip-flop 35
3 is returned to 0, the remaining hidden surface processing device updates Z value, Z
No comparison with A is made.

FIG. 23 shows a scan line hidden surface processing device 34.
The time chart of the pipeline of a is shown. P1-1 is polygon state 1 of polygon 1, P1-2 is state 2 of polygon 1, and P2-1 is state 1 of polygon 2. The dot address value on the horizontal line received from the horizontal interpolation calculation device 33 is used as the scan line hidden surface processing device 34a.
The horizontal dot hidden surface processing device 34 corresponding to the next dot receives the value of the parameter address register 342 via the D bus, and sends the polygon parameter memory address to the horizontal interpolation calculation device 33. Each of these devices is controlled by the controller 41.

Next, referring to FIG. 24, the horizontal interpolation computing device 3
3 will be explained. The hidden surface processing device 34 gives the address of the polygon parameter memory 40 for each dot to the parameter input device 33a. According to the input polygon parameter memory address, the parameter input device 33a reads the parameter stored at that address from the polygon parameter memory 40, and the mapping operation device 33b.
Transfer to.

The mapping arithmetic unit 33b has X, Y, Z of visual field coordinates for each polygon end point transferred from the polygon parameter memory 40 via the parameter input unit 33a.
The value, the mapping pattern memory addresses MX and MY, and the flag indicating the mapping direction are received, the mapping pattern memory address (MX, MY) of the dot of the X address of the scan line currently being processed is obtained, and transferred to the frame memory controller 33c. To do.

The frame memory controller 33c accesses the mapping pattern memory 7 by the mapping pattern memory address (MX, MY) obtained by the mapping arithmetic unit 33b, and the R of the dot of the X address of the scan line currently being processed is read. , G, B or LUT value is obtained and written in the frame memory 8. Each of these devices is controlled by the controller 42, and this controller 42 operates according to the flowchart shown in FIG.

FIG. 25 is a block diagram showing a concrete example of the mapping arithmetic unit 33b. This mapping calculation device 33b is used for the visual field coordinate X, Y, Z value generation device 331.
And a mapping arithmetic unit 332. View coordinate X,
The Y, Z value generation device 331 receives the Z value converted from the hidden surface processing device 34 into the normalized coordinates, and the Z value
The value is converted into the Z value of the visual field coordinate, the X value and the Y value of the visual field coordinate are obtained from the screen X and Y values and the screen distance, and transferred to the mapping calculation device 332.

The mapping arithmetic unit 332 receives the visual field coordinates X, Y and Z values from the visual field coordinate X, Y and Z value generating unit 331 and each polygon read from the polygon parameter memory 40 via the parameter input unit 33a. From the EX, EY, and EZ of the visual field coordinates of the polygon end points that are the reference to the mapping pattern of the polygon, the size ratio (Scale) of the size of the polygon and the mapping pattern, the conversion table address to which the polygon belongs, and the three-dimensional coordinate of the polygon. Coefficient U for converting the mapping pattern into two-dimensional coordinates
X, UY, UZ, VX, VY, VZ are received, mapping calculation is performed, and mapping pattern memory addresses MX, MY of each dot are determined by the frame memory controller 33.
Transfer to c.

FIG. 26 is a block diagram of the visual field coordinate X, Y, Z value generating device. Visual field coordinate X, Y, Z value generation device 33
1 is a visual field coordinate standard value generating device 331a and visual field coordinates X and Y
And a value generation device 331b. The visual field coordinate Z value generation device 331a outputs the normalized Z value by the conversion calculation of the following Equation 8. As the Z value normalization process, the one shown in the following formula 7 is known.

[0124]

## EQU00007 ## A = CZMAX / (VLEN * (CZMAX-CZMIN)) B = CZMAX * CZMIN / (VLEN * (CZMAX-CZMIN)) Z = (A * WZ-B) * VLEN / EZ where CZMAX is The maximum Z value, CZMIN is the minimum Z value, and VLEN is the distance from the screen.

By this processing, the visual field coordinate value ZE is converted into the normalized coordinate value IZ. Therefore, the visual field coordinate Z value generation device 331a performs the inverse transformation of the above equation 7 from the SZ value interpolated by the hidden surface processing device 34, and obtains the Z value of the visual field coordinate according to the following equation 8.

[0126]

## EQU00008 ## A2 = (CZMAX / (VLEN * (CZMAX-CZMIN)) * VLEN B2 = CZMAX * CEMIN / (VLEN * (CZMAX-CZMIN)) * (-VLEN) EZ = B2 / (IZ-A2)

The visual field coordinate Z value device 331a performs a calculation process so as to obtain the Z value of the visual field coordinates by the calculation of the above-mentioned expression 8.

FIG. 27 shows a visual field coordinate Z value generator 331a.
It is a block diagram showing a specific example of. The Z value of the normalized coordinates sent from the hidden surface processing device 34 is stored in the register 3
51 is stored in the register 51 and is stored in the register 352. The respective data is given to the subtractor 353 from both the registers 351 and 352, and 1Z
-A2 is calculated. The parameter of B2 is stored in the register 354, and this value is given to one of the dividers 355.

Field-of-view coordinate X, Y, Z value generator 331b
Is for calculating the projected X and Y values by the conversion operation of the following mathematical formula 10. As the projection process, the one shown in the following formula 9 is known.

[0130]

SX = EX * VLEN / EZ + CX where CX is the X value at the center of the screen.

Here, the above equation 9 is inversely converted, and X and Y are calculated based on the following equation 10.

[0132]

EX = (SX−CX) * EZ * (1 / VLEN)

FIG. 28 shows a visual field coordinate X, Y value generating device 33.
It is a block diagram which shows the specific Example of 1b.

The CX and CY parameters in the above equation are stored in the register 361, and the CX and CY parameters from this register 361 are stored in the register 361.
The CY parameter is given to the subtractor 363. The X value and the Y value of the screen coordinate are counted by the counter 362. The counter 362 counts up in synchronization with the entire system. The X value and the Y value of the screen coordinates are given from the counter 362 to the subtractor 363, and the subtractor 363 calculates SX-CX and SY-CY. The subtraction result from the subtractor 363 is given to the multiplier 364. EZ is given to the multiplier 364 from the visual field coordinate Z value generation device 331 a, and (SX−CX) × E
The calculation of Z, (SY-CY) * EZ is performed. On the other hand, the register 365 stores the 1 / VLEN parameter of the above equation, and 1 / VLEN is applied to the multiplier 366 from this register. This multiplier 366 has a multiplier 3
The multiplication result from 64 is given, and the visual field coordinates EX and EY are given from the multiplier 366 to the register 367.

FIG. 29 is a block diagram showing a concrete example of the mapping arithmetic unit 332.

The register 371 stores the visual field coordinates EX0 of the reference polygon end point read from the polygon parameter area of the polygon parameter memory 40,
The register 372 has a visual field coordinate X, Y, Z value generation device 33.
The visual field coordinate X value (EX) received from 1 is stored.
EX0 stored in the register 371 is given to one input of the subtractor 373. The EX stored in the register 372 is applied to the other input of the subtractor 373. The subtractor 373 calculates EX-EX0 to obtain the X value on the relative visual field coordinates on the polygon of the dot currently being processed, and the calculation result is given to one input of the multiplier 375. .

The register 374 stores the conversion coefficients UX and VX that change from the three-dimensional coordinates of the polygon read from the conversion table area of the polygon parameter memory 40 to the two-dimensional coordinates of the mapping pattern, (EX-EX
0) is multiplied by the conversion coefficient, and the multiplication result is added by the adder 38.
6 given.

The register 376 stores the visual field coordinates EY0 of the reference polygon end points read from the polygon parameter area of the polygon parameter memory 40, and the register 377 stores the visual field coordinate X, Y, Z value generating device. The visual field coordinate Y value (EY) received from 331 is stored. EY0 stored in the register 376 is the subtractor 37
8 is applied to one input. The EY stored in the register 377 is applied to the other input of the subtractor 378.
The subtractor 378 performs an EY-EY0 operation to obtain a relative Y value on the visual field coordinates on the polygon of the dot currently being processed, and the operation result is given to one input of the multiplier 380. .

The register 379 stores the conversion coefficients UY and VY that change from the three-dimensional coordinates of the polygon read from the conversion table area of the polygon parameter memory 40 to the two-dimensional coordinates of the mapping pattern, (EY-EY).
0) is multiplied by the conversion coefficient, and the multiplication result is added by the adder 38.
6 given.

Further, the register 381 stores the visual field coordinates EZ0 of the reference polygon end point read from the polygon parameter area of the polygon parameter memory 40, and the register 382 stores the visual field coordinate X, Y, Z value generating device. The visual field coordinate Z value (EZ) received from 331 is stored. EZ0 stored in the register 381 is the subtractor 38
3 is applied to one input. EZ stored in the register 382 is applied to the other input of the subtractor 383.
The subtractor 383 performs an EZ-EZ0 operation to obtain the Z value on the relative visual field coordinates on the polygon of the dot currently being processed, and the operation result is given to one input of the multiplier 385. .

The register 384 stores the conversion coefficients UZ and VZ that change from the three-dimensional coordinates of the polygon read from the conversion table area of the polygon parameter memory 40 to the two-dimensional mapping pattern coordinates, (EZ-EZ).
0) is multiplied by the conversion coefficient, and the multiplication result is added by the adder 38.
6 given.

The adder 386 adds the calculation results obtained by multiplying the X value, Y value, and Z value of the relative visual field coordinates of the dot currently being processed by the conversion coefficient, and the mapping pattern two-dimensional coordinates (U, V). Is calculated and the result is registered in the register 387.
To be stored.

U and V stored in the register 387 are applied to one input of the multiplier 389. The register 388 stores the ratio (scale) of the size of the polygon read from the polygon parameter area of the polygon parameter memory 40 to the mapping pattern, and this ratio is given as the other input of the multiplier 389. ,
The respective U and V ratios are multiplied to calculate the address (MX, MY) on the mapping pattern, and this address value (MX, MY) is stored in the register 390. Each of these circuits is controlled by the controller 391.

The operations of the polygon outer shape processing device 20 and the polygon inner processing device 30 will be described according to the above circuit example based on the operation flows of FIGS. 30 to 33.

The operation of the polygon outer shape processing device 20 will be described. First, the controller 25 reads out the number of polygons (P) from the screen memory 5, and then reads out the number of polygon end points to be processed.
1 (steps S1 and S2).

Then, the starting points (XS, YS, ZS) of the respective sides are read from the screen memory 5 (step S3), and the address of the screen memory 5 is incremented. Then, the end points (XE, YE, ZE) of each side are read from the screen memory 5 (step S
4). A polygon extraction device 21 calculates a direction vector from the read start point (XS, YS) and end point (XE, YE) of the end point, determines the left side or the right side based on the side vector, and sets the polygon direction (DIR). Yes (step S5).

Then, the X parameter calculator 22a of the polygon outline shape processor 20 calculates the X parameter (step S6). Data of YE and YS from the screen memory 5 is given to the subtractor of the X parameter calculation device 22a, and the distance DY between them is calculated.

Subsequently, the start point (XS) and end point (XE) data is given from the screen memory 5 to the subtractor of the X parameter operation unit 22a, and the subtraction result (XE-XS) from this subtractor is supplied to the divider. To be done.

This divider performs the division of (XE-XS) / DY to calculate the X parameter (step S
6). In the fine difference calculation circuit, DZ = (ZE-Z
S) / DY is calculated and the Z parameter is calculated (step S7).

Then, Y is set to YS (step S
8), using the X parameter, an X vertical interpolation device 23a
Then, the X vertical interpolation calculation is performed (step S9).

Further, the Z parameter is the Z value interpolating device 23.
b, and Z vertical interpolation calculation is performed (step S
10).

In step S11, the calculation of Y + DIR,
That is, when the polygon is downward, "+1" is calculated, and when it is upward, "-1" is calculated, and the process proceeds to step S12. Then, in step S12, Y ≠ YE is determined, and Y ≠ Y
In the case of E, the process returns to step S9, the above-described operation is repeated, and when Y = YE, the process proceeds to step S13.

In step S13, it is determined whether or not the sides of all the polygons have ended. If not, then
Returning to step S3, the above-described operation is repeated.

When all the sides of the polygon have been completed, the process proceeds to step S14, and in step S14, it is determined whether or not all the processes of the polygon have been completed. If all the processes of the polygon have not been completed, Returning to step S2, the above-mentioned operation is repeated. Then, when it is determined that all the polygons have been processed, the outer shape processing operation ends.

Next, the internal polygon processing device 30 will be described. First, reading from the polygon edge memory 6 will be described with reference to FIG.

The polygon internal processing device 30 first initializes the Y address (step S21), reads the number of polygons for each Y address of the scan line, and (step S2).
2), go to step S23.

In step S23, the left side of X of two points (X
The address (L) and the Z value (ZL) are read from the polygon edge memory 6, and the process proceeds to step S24.

At step S24, the right side (X) of two points X indicating the outer shape of the polygon between the two sides facing each other for each Y address.
The address (R) and the Z value (ZR) are read from the polygon edge memory 6, and the process proceeds to step S25.

Then, the parameter calculation device 31 performs parameter calculation (step S25), and then the hidden surface processing parameter calculation (step S26).

To the hidden surface processing device 34, XL value, DXY value,
The ZL value and the DDZ value are given, and the hidden surface processing is performed (step S27). In step S28, it is determined whether or not all polygons on the scan line have been processed. If the processing has not been completed, the process returns to step S23 to repeat the above operation.

Further, when one scan line, that is, the number of polygons of the Y address is completed, the process proceeds to step S29, the Y address is incremented in step S29, and the process corresponding to all the Y addresses is completed.
That is, the above-described operation is repeated until the Y address becomes larger than the vertical resolution (step S30), and the parameter calculation operation ends when the processing corresponding to all the addresses ends.

Next, the operation of the horizontal dot hidden surface processing device 34-n will be described with reference to the operation flow of FIG. First, it is determined whether or not the dot exists within the polygon. That is, the scan line address of the Y address (for each scan line) is given from the polygon edge memory memory controller 31a, this XL is compared with the X address L corresponding to the dot, and whether the value of DXY is 0 or not is determined. It is determined (step S71). If XL is larger than the X address and DXY is not 0, the dot exists within the polygon range, so the process proceeds to step S72. If not, the hidden surface processing operation is repeated.

In step S72, the depth register 34
The Z value (ZA) stored in 1 is compared with the Z value that has just been read, and if the Z value of the depth register 341 is larger, that is, if the dot that has just been read is on the front side, step S73. If the Z value is small, the process proceeds to step S74. In step S73, the polygon parameter address is stored in the polygon parameter address register 342, and the flow advances to step S74. In step S74, the operation of DXY = DXY-1 is performed, and step S75
After proceeding to step S75, the Z value is interpolated in step S75, that is, Z = DDZ + Z is calculated.
The hidden surface processing operation ends.

Next, the data read operation from the polygon parameter memory 40 in the polygon internal processing device 30 will be mainly described with reference to the operation flow chart of FIG. First, after initializing the Y address and the X address (steps S41 and S42), the hidden surface processing device 34 performs X
The polygon parameter address of the address is read (step S43).

Subsequently, in step S44, it is determined whether or not a polygon exists at the X address. If no polygon exists, the process proceeds to step S50, and if a polygon exists, the process proceeds to step S45. . In step 45, parameters are calculated by the parameter calculation device, and the process proceeds to step S46. In step S46, the polygon parameter memory 40 is set in accordance with the polygon parameter address corresponding to the X address given by the hidden surface processing device 34.
Then, the polygon parameters are read out, and the process proceeds to step S47.

In step S47, the mapping pattern memory 7 is read according to the parameters read from the polygon parameter memory 40 by the horizontal interpolation computing device 33.
Address (MX, MY) is calculated, and the process proceeds to step S48.

In step S48, the mapping pattern memory 7 is accessed according to the calculated address, and R, G, B or L is read from the mapping pattern memory 7.
Color information such as the UT value is read, and the process proceeds to step S49.

In step S49, the color information is written in the frame memory 8, and the process proceeds to step S50. In step S50, the X address is incremented by 1, and the process proceeds to step S51.

In step S51, the X address is compared with the horizontal resolution. If the X address is smaller than the horizontal resolution, the process returns to step S43 and the above-described operation is repeated. When the X address becomes larger than the horizontal resolution, the process proceeds to step S52, and in step S52, the hidden surface processing device 34
Is initialized and the process proceeds to step S53.

At step S53, the Y address is incremented by one, and the process proceeds to step S54 and step S5.
At 4, the Y address and vertical resolution are compared. If the Y address is smaller than the vertical resolution, the process returns to step S42, and the above-described operation is repeated. When the Y address becomes larger than the vertical resolution, the polygon internal processing operation ends.

[0171]

As described above, according to the present invention, conversion coefficients (UX, UY, UZ), (VX, V) for converting three-dimensional polygon coordinates into a two-dimensional mapping pattern.
Y, VZ) is obtained, hidden surface processing is performed, and then U-V mapping and projection mapping are performed using this conversion coefficient to obtain the address of the mapping pattern memory. That is,
ROM of the coordinates of the polygon on the object coordinates and the above conversion coefficients (UX, UY, UZ), (VX, VY, VZ)
Stored in a storage means such as, for example, rotation calculation of an object, rotation calculation by visual field conversion, etc., each time the direction of a polygon changes, conversion coefficients (UX, UY, UZ), (VX, V
Y, VZ) is also subjected to the same rotation calculation as the polygon end points, and conversion coefficients (UX, UY, UZ), (VX, UZ) from the three-dimensional polygon on the visual field coordinates to the two-dimensional mapping pattern are obtained.
By calculating (VY, VZ) and performing the mapping calculation at the point where the hidden surface processing is completed, the mapping can be performed at high speed with a small amount of hardware.

Further, conversion coefficients (UX, UY, UZ),
(VX, VY, VZ) does not have for each polygon, but can be combined as long as they have the same direction and the same rotational motion, and the capacity of the ROM or the like can be reduced.

Further, since the mapping memory addresses (MX, MY) are not assigned to the polygon end points, when performing a special effect such as changing the mapping pattern of the polygon surface, the conversion coefficient (UX, UX,
By changing (UY, UZ) and (VX, VY, VZ), many polygons can be processed with less processing.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a stereoscopic image display device of the present invention.

FIG. 2 is a block diagram showing a matrix calculation device in the geometric conversion device of the present invention.

FIG. 3 is a block diagram showing an interface of a matrix operation device.

FIG. 4 is a schematic diagram showing a state in which three-dimensional polygon coordinates are converted into a two-dimensional mapping pattern.

FIG. 5 is a diagram showing a relationship of conversion coefficients when converting a three-dimensional polygon into a two-dimensional mapping pattern.

FIG. 6 is a flowchart showing the processing operation of the geometric conversion circuit of the present invention.

FIG. 7 is a flowchart showing a mapping conversion processing operation of the present invention.

FIG. 8 is a diagram showing a calculation example of object rotation.

FIG. 9 is a diagram illustrating a calculation example of object rotation.

FIG. 10 is a diagram showing a calculation example of a visual field rotation.

FIG. 11 is a diagram showing an example of calculation of field of view rotation.

FIG. 12 is a block diagram showing a configuration of a polygon outline shape processing device used in the present invention.

FIG. 13 is a block diagram showing a configuration of an X parameter calculation device in the polygon outer shape processing device.

FIG. 14 is a block diagram showing a configuration of a Z parameter calculation device in the polygon outer shape processing device.

FIG. 15 is a block diagram showing a configuration of an X vertical interpolation device in the polygon outline shape processing device.

FIG. 16 is a block diagram showing a configuration of a Z vertical interpolation device in the polygon outline shape processing device.

FIG. 17 is a block diagram showing the configuration of a parameter calculation device of the polygon internal processing device used in the present invention.

FIG. 18 is a block diagram showing a specific configuration of a hidden surface processing parameter calculation device of the parameter calculation device.

FIG. 19 is a block diagram showing a configuration of a hidden surface processing device of the parameter calculation device.

FIG. 20 is a block diagram showing a configuration of a scan line hidden surface processing apparatus which constitutes the hidden surface processing apparatus.

FIG. 21 is a block diagram showing a specific configuration example of a horizontal dot hidden surface processing apparatus which constitutes the scan line hidden surface processing apparatus.

FIG. 22 is a timing chart showing a transfer state of data to the horizontal dot hidden surface processing apparatus.

FIG. 23 is a schematic diagram showing the processing timing of the scan line hidden surface processing apparatus.

FIG. 24 is a block diagram showing a configuration example of a horizontal interpolation calculation device of an internal drawing processing device used in the present invention.

FIG. 25 is a block diagram showing a specific example of a mapping operation device of the horizontal interpolation operation device.

FIG. 26 is a view coordinate X, Y, of the mapping arithmetic device.
It is a block diagram which shows the specific Example of a Z value generator.

FIG. 27 is a block diagram showing a specific example of the visual field coordinate Z value generation device of the mapping calculation device.

FIG. 28 is a block diagram showing a specific example of a visual field coordinate X, Y value generation device of the mapping calculation device.

FIG. 29 is a block diagram showing a specific example of the interpolation mapping calculation device.

FIG. 30 is a flowchart showing the operation of the polygon outline shape processing apparatus of the present invention.

FIG. 31 is a flowchart showing the operation of the polygon internal processing device of the present invention.

FIG. 32 is a flowchart showing the operation of the polygon internal processing device of the present invention.

FIG. 33 is a flowchart showing the hidden surface processing operation of the polygon internal processing device of the present invention.

FIG. 34 is a schematic diagram showing a screen memory used in the present invention.

FIG. 35 is a schematic diagram showing a polygon edge memory used in the present invention.

FIG. 36 is a schematic diagram showing a polygon parameter memory used in the present invention.

FIG. 37 is a schematic diagram showing an example of a mapping pattern memory.

[Fig. 38] Fig. 38 is a diagram illustrating a relationship in a side vector direction of polygons.

FIG. 39 is a diagram showing a relationship between a direction vector of a polygon and a side.

[Explanation of symbols]

 1 world memory 2 geometric conversion device 5 screen memory 7 mapping pattern memory 8 frame memory 9 CRT 20 polygon outer shape processing device 30 polygon internal processing device 40 polygon parameter memory

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁶ Identification code Internal reference number FI technical display location 9365-5H G06F 15/72 420

Claims (3)

[Claims] 1. A means for calculating a conversion coefficient for performing mapping conversion from three-dimensional polygon coordinates to a two-dimensional mapping pattern, end point information forming a polygon, and end point information of a mapping pattern memory storing a texture image and depth information of the polygon. Storage means for storing, conversion means for performing coordinate conversion of each end point information from the storage means, visual field coordinate values of the end points of the polygon, the conversion coefficient, and the size ratio of the polygon and the mapping pattern are stored for each polygon. Polygon parameter storage means, screen end point information from the conversion means, polygon depth information, and a screen storage means for storing the address value of the polygon parameter storage means, and a polygon outline based on the screen end point information from the conversion means. Address information and polygon depth information The outline processing means for converting the address value of the polygon parameter storage means into the outline information of the polygon for each scan line and the information between the two opposite sides calculated by the outline processing means are calculated, and X is calculated.
Means for calculating the displacement of the address and the displacement of the depth information,
A means for determining whether or not the pixel position corresponding to each pixel of the scan line is within the range of the polygon, and the depth information of the most existing pixel and the depth information of the polygon at that pixel position are compared and compared. The method of rewriting the depth information of the target to be replaced with the depth information of the polygon which is always present in the foreground, and the means of adding the displacement of the depth information to the depth information of the polygon and calculating the depth information of the adjacent pixel position are compared A means for calculating at least one X address between two opposite sides of a polygon existing at the front at the pixel position and an address value of the polygon parameter storage means, and an access by the calculated address value of the polygon parameter storage means. Address of mapping pattern memory based on the read information of polygon parameter storage Means for calculating, by accessing the mapping pattern memory based on the calculated mapping pattern address, a three-dimensional image processing device including means for transferring image data to the display unit. 2. The stereoscopic image according to claim 1, wherein the means for calculating the conversion coefficient calculates the conversion coefficient by performing object rotation processing and field-of-view conversion rotation processing on the conversion coefficient. Processing equipment. 3. The stereoscopic image processing apparatus according to claim 1, wherein the same conversion coefficient is used for polygons that perform the same rotational movement in the same direction.