JP3068007B2 - Rendering device and mapping device, and rendering method and mapping method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a rendering apparatus and method for computer graphics (CG) processing, and more particularly to a mapping apparatus and a mapping method for performing texture mapping for generating a high-quality image. It is. Further, the present invention can be applied to various CG calculations, such as illuminance calculation, opacity calculation, and bump calculation, which are performed in generating a CG.

[0002]

2. Description of the Related Art In recent years, computer graphics,
In the field of game machines and the like, polygon rendering processing using texture mapping is often performed. Normally, in a texture mapping method called an inverse map, the coordinates of the corresponding texture pattern (u, v) are calculated from the screen coordinates (Xs, Ys), and the color of the texture point (corresponding point) at the calculated coordinates is converted to the screen coordinates. (Xs, Ys)
To reflect.

[0003] The corresponding point calculation is performed by an incremental algorithm (Increment algorithm) in terms of high-speed processing and simplification of a constituent circuit.
al Algorithm: In each step, incremental calculation is performed based on the calculation result of the previous step) (George Wolberg, “Digital Image Warpin
g, "pp189-pp204).

FIGS. 37 and 38 are diagrams showing a texture mapping process by an incremental algorithm. Here, it is assumed that the relationship (Equation 1) and (Equation 2) hold between a point (x, y) on the polygon of the screen coordinates and a point (u, v) on the texture of the texture coordinates. Hereinafter, the calculation for obtaining (u, v) by (Equation 1) and (Equation 2) is referred to as corresponding point calculation.

[0005]

U = F (x, y) = a × x + b × y + c

[0006]

[Mathematical formula-see original document] v = G (x, y) = d * x + e * y + f In FIG.
It represents a pixel. The triangles in the figure indicate polygons projected on the screen. Point 1401,
1402 and 1403 are vertices constituting the polygon. A point 1401 is a zero vertex, a point 1402 is a first vertex, a point 1403 is a second vertex, and respective screen coordinates and corresponding texture coordinates are (8,0,0,0), (0,
6,0,16) and (11,9,16,16). The side 1404 is the 0th
0 which is connected by the vertex 1401 of the
1, the side 1405 is composed of the first vertex 1402 and the second vertex 14
The side 12 and the side 1406 connected by 03 are the second vertex 140
The side 20 is connected to the third vertex 1401 by the third vertex 1401. Further, points 1002, 1004, and 1006 represent drawing points on the screen calculated by the incremental algorithm. A drawing point is set on a polygon projected on a screen when a polygon is drawn. The pixel value to be given to each pixel is determined based on the coordinate value of the drawing point.
As a method of determining a drawing point, an incremental algorithm is often used. The increment algorithm determines a drawing point based on a point on a polygon edge (boundary of a polygon).
In particular, the mapping apparatus performs mapping by determining a corresponding point corresponding to each drawing point on a mapping image (for example, a texture image) and reflecting the pixel value of the corresponding point on a pixel on the screen. The determination of the corresponding point is performed by the corresponding point calculation.

Hereinafter, the details of the calculation of the corresponding points on the polygon edge will be described. In FIG. 38, the portion surrounded by the grid is one pixel of the screen. FIG. 38 shows a part of the side 1404 in FIG. 37 and 38
Points 1002, 1004, and 1006 in represent the same drawing point. The edge 1001 of the polygon to be drawn by the texture mapping is a part of the side 1404, and the edge 1
There is a polygon to be drawn on the right side of 001. The drawing point on the polygon edge determined in the previous step of the increment algorithm is denoted by 1002, and the pixel on which the pixel value of the edge drawn point 1002 is reflected is denoted by 1003. The edge drawing point obtained in the current step for the polygon edge is 1004
The pixel on which the pixel value of the edge drawing point 1004 is reflected is denoted by 1005.

The drawing points on the polygon edges and the corresponding points corresponding to the drawing points are calculated by sequentially changing the scan lines, and when the scan lines scan the entire polygon, the processing on the polygon edges is completed. Here, the entire polygon is scanned by setting the scan line as a horizontal line on the screen and changing the scan line from the top to the bottom of the screen. In other words, scanning a polygon is synonymous with adding y values of a scan line one by one.

At this time, the screen coordinates of the edge drawing point 1002 and the texture coordinates of the corresponding point are represented by (x0, y0, u
(0, v0), and the screen coordinates of the edge drawing point 1004 and the texture coordinates of the corresponding point are (x1, y1, u1, v1), these can be expressed by the following equation (Equation 3).

[0010]

## EQU3 ## (x1, y1, u1, v1) = (x0 + dx / dy, y0 + 1, u0 + du / dy, v0 + dv / dy) Similarly, (Expression 4) is the correspondence of texture mapping for edges. In the general formula of the point calculation, the subscript indicates the number of the scan line.

[0011]

(Xn + 1, yn + 1, un + 1, vn + 1) = (xn + dx / dy, yn + 1, un + du / dy, vn + dv / dy) (Equation 1) By performing the processing of (Equation 4) from the starting point to the ending point of the polygon edge, the position of the drawing point (screen coordinate value) and the position of the corresponding point with respect to the polygon edge are obtained. (Texture coordinate value) can be calculated.

Here, parameters (DDA parameters) required to realize processing by the incremental algorithm
Are dx / dy, du / dy, and dv / dy, respectively.

[0013]

Dx / dy = (0-8) / (6-0) =-8/6 du / dy = (0-0) / (6-0) = 0/6 dv / dy = (16- 0) / (6-0) = 16/6.

The calculation of screen coordinates and texture coordinates at polygon edges in FIG. 37 can be realized as follows. Here, calculation is performed for the side 1404.

(8.00, 0.00, 0.00, 0.00) ……… (initial value) ↓ + (-8/6, 1, 0, 16/6) (6.67, 1.00, 0.00, 2.67) ↓ + (-8 / 6, 1, 0, 16/6) (5.33, 2.00, 0.00, 5.33) ↓ + (-8/6, 1, 0, 16/6) (4.00, 3.00, 0.00, 8.00) ↓ + (-8 / 6, 1, 0, 16/6) (2.67, 4.00, 0.00, 10.67) ↓ + (-8/6, 1, 0, 16/6) (1.33, 5.00, 0.00, 13.33) ↓ + (-8 / 6, 1, 0, 16/6) (0.00, 6.00, 0.00, 16.00) (End) Next, the calculation of the corresponding points in the polygon span (the interior points of the polygon) will be described. The point of the polygon span determined in the previous step (hereinafter referred to as the span point) is the span point 10
04, and a pixel on which the pixel value of the span point 1004 is reflected is a pixel 1005. The point of the polygon span to be obtained in the current step is set as the span point 1006, and the
A pixel to which the pixel value of 06 is reflected is referred to as a pixel 1007.
The polygon span point 1004 indicates the same as the polygon edge point. Note that the span point includes an edge point, and the point 1004 is also called a span point.

The drawing points and corresponding points in the polygon span are calculated by sequentially changing the pixels to be drawn (hereinafter, referred to as drawing pixels), and when the entire polygon span has been drawn, the processing relating to the polygon span is completed. . Here, it is assumed that the drawing pixel is changed from left to right, and this is equivalent to adding x of the screen coordinate value one by one.

At this time, the screen coordinates of the span point 1004 and the texture coordinates of the corresponding point corresponding to the span point 1004 are (x1, y1, u1, v1), and the span point 1006
If the texture coordinates of the corresponding point corresponding to the screen coordinates and the span point 1006 are (x2, y2, u2, v2),
These can be represented by the following equation (Equation 6).

[0018]

(X2, y2, u2, v2) = (x1 + 1, y1, u1 + ∂u / ∂x, v1 + ∂v / ∂x) Similarly, (Formula 7) is the corresponding point of texture mapping for the polygon span. In the general formula of calculation, the subscript represents the number of the drawing pixel.

[0019]

(Xn + 1, yn + 1, un + 1, vn + 1) = (xn + 1, yn, un + ∂u / ∂x, vn + ∂v / ∂x) ((formula 1), ( From equation (2), u and v can be partially differentiated by x.) By performing the processing of equation (7) from the start point to the end point of the polygon span, the coordinate values (screen coordinate values) of the drawing points related to the polygon span and the coordinates of the corresponding points The value (texture coordinate value) can be calculated.

Here, parameters (DDA parameters) required to realize processing by the incremental algorithm
Are ∂u / ∂x and ∂v / ∂x, respectively

[0021]

８u / ∂x =-{(6-0) (16-0)-(9-6) (0-0)} / {(0-8) (9-6)-(11- 0) (6-0)} = 96/90 ∂v / ∂x =-{(6-0) (16-16)-(9-6) (16-0)} / {(0-8) ( 9-6)-(11-0) (6-0)} = -48/90.

The calculation of the screen coordinates and the texture coordinates in the polygon span in FIG. 37 can be realized as follows. Here, a span including the span point 1004 is calculated.

(5.33, 2.00, 0.00, 5.33) ……… (initial value) ↓ + (1, 0, 96/90, -48/90) (6.33, 2.00, 1.07, 4.80) ↓ + (1, 0 , 96/90, -48/90) (7.33, 2.00, 2.13, 4.27) ↓ + (1, 0, 96/90, -48/90) (8.33, 2.00, 3.20, 3.73) ……… (End) Note that the calculation of the span point is continued as long as it does not exceed the right edge of the drawing.

With the above-described incremental algorithm, accurate corresponding point calculation in texture mapping can be performed at high speed. (U, v) calculated by this
The texture mapping can be realized by referring to the texture image by the value and reflecting the value on the drawing pixel. With respect to the normally calculated drawing point (x, y), a point at which the fractional part is discarded is set as a drawing pixel. Here, a pixel value obtained by referring to the texture image with the texture coordinate value (u0, v0) is set as the pixel 1003. 1005 includes texture coordinate values (u
The pixel value obtained by referring to the texture image in (1, v1)
07 reflects the pixel value referring to the texture image with the texture coordinate value (u2, v2).

[0025]

In the calculation of corresponding points by the incremental algorithm, a high-speed operation can be realized with a simple configuration by performing an operation based on the calculation result of the previous step. However, there is a problem that an error occurs in the calculation of the corresponding points.

Here, a case where the calculation of the corresponding point for the drawing pixel is not accurately performed will be described. FIG. 39 shows FIG.
8 explains the calculation of the corresponding points by the incremental algorithm in the same manner as in FIG.

The polygon span point 1006 (x2, y2, u2, v0) calculated from the polygon edge point 1002 (x0, y0, u0, v0) in FIG.
The texture coordinates (u2, v2) of (2) become (Equation 9) (from (Equation 1), (Equation 2), and (Equation 6)), and the drawing pixel 1007
Is drawn with the values obtained based on the texture coordinates of (Equation 9).

[0028]

(U2, v2) = (u1 + ∂u / ∂x, v1 + ∂v / ∂x) = (u0 + du / dy + ∂u / ∂x, v0 + dv / dy + ∂v / ∂x ) = (u0 + (a × dx / dy + b) + a, v0 + (d × dx / dy + e) + d) = (u0 + a × (1 + dx / dy) + b, v0 + d × ( 1 + dx / dy) + e) However, regarding the texture coordinates, the texture coordinates of the drawing pixel 1007 with respect to the drawing pixel 1003 are (Equation 10).
Becomes The coordinates of the drawing pixel 1003 are set as a polygon edge point 1002 (x0, y0, u0, v0). A position where the edge point 1002 is shifted by one pixel in parallel with the y-axis is set as a point 1111 (x ′, y ′, u ′, v ′), and this point is set as a coordinate in the drawing pixel 1007.

[0029]

(U2 ', v2') = (u0 + ∂u / ∂y, v0 + ∂v / ∂y) = (u0 + b, v0 + e) Here, the true value and the incremental algorithm are used for the corresponding point u. Assuming that the difference from the obtained value is E, Equation 11 is obtained.

[0030]

E = u2′−u2 = −a × (1 + dx / dy) Therefore, the range of E is (Equation 12).

[0031]

−a <E <a (∵−2 <dx / dy <0 from FIG. 38) Next, the error of (Expression 12) will be described in terms of a difference between a sample point and a drawing point. Here, the sample points are points that have the same positional relationship in each pixel area. For example, the center point of the pixel area can be defined as a sample point. That is, if the pixels are regularly arranged in a lattice, the sample points are also arranged in a lattice. On the other hand, the drawing points are determined by the positional relationship between the pixels to be drawn (particularly, polygon edges) and the pixels, so that the drawing points are not always regularly arranged in a grid.

In FIG. 39, the sample point in each pixel is set as the point closest to the origin in the pixel (upper left of the pixel shown in the figure), and a circle is marked. Further, drawing points (edge points 1002, 10
04 and span points 1006), and distances 1108, 1109, 111 between the sample points of the pixels 1003, 1005, and 1007 on which these drawing points are reflected.
0 is L1, L2, and L3, respectively. Where (Equation 7)
Therefore, L2 and L3 have the same value.

At this time, with respect to the corresponding point u, errors E1, E2, E3 between the value at the sample point and the value at the drawing point calculated by the increment algorithm can be expressed by (Equation 13).

[0034]

E1 = L1 × ∂u / ∂x E2 = L2 × ∂u / ∂x E3 = L3 × ∂u / ∂x Further, if the error is represented by E ′,
4).

[0035]

E ′ <∂u / ∂x (∵Distance between sample point and drawing point is less than 1) <a Thus, the corresponding point calculation in the incremental algorithm shown in (Equation 12) and (Equation 14) is performed. The error can be said to be caused by the difference between the pixel sample point and the drawing point calculated by the increment algorithm. FIG. 40 shows an example of image quality degradation due to this calculation error. FIG. 40 is a diagram for indicating that the texture mapped to the polygon due to the calculation error is discontinuous, and includes a texture image mapped to the polygon, an image mapped by the conventional method,
5 shows an image obtained by an ideal mapping.
From FIG. 40, it can be seen that image quality degradation occurs when mapping is performed by a conventional method.

The difference between the equations (12) and (14) is different because the (12) sample point is an arbitrary point in the pixel. Hereinafter, regarding the error of the corresponding point calculation, the sample point is fixed. That is, the corresponding point error is represented by (Equation 14).

Although the description has been given with respect to the corresponding point u, the corresponding point v can be expressed as (Equation 2), and the illuminance (R,
G, B) and opacity A (Equation 15),
It can be expressed as (Equation 16). From these equations,
It can be seen that an error similar to the calculation error described here also occurs in the calculation of the corresponding point v, the illuminance, the opacity, and the like.

[0038]

R = Fr (x, y) = (ar × x + br × y + cr) G = Fg (x, y) = (ag × x + bg × y + cg) B = Fb (x, y) = (ab × x + bb × y + cb)

[0039]

A = Fa (x, y) = (aa × x + ba × y + ca) That is, an incremental algorithm was used for calculation of corresponding points, illuminance, opacity, etc. for displaying a polygon. In this case, an error occurs.

Furthermore, the relationship between polygons and textures is not limited to (Equation 1) and (Equation 2), but occurs in the calculation of corresponding points by the incremental algorithm. The relational expression between polygon (x, y), texture (u, v), illuminance (R, G, B), and opacity A is differentiable by y and partial differentiable by x. Can be performed. For example, this corresponding point relationship is expressed by (Equation 17), (Equation 1)
8).

[0041]

[Mathematical formula-see original document] u = F (x, y) = (a * x + b * y + c) / (g * x + h * y + i)

[0042]

V = G (x, y) = (d × x + e + y + f) / (g × x + h × y + i) [coefficient (a) of (Expression 17) and (Expression 18) b, c, d, e,
f is different from the coefficients of (Equation 1) and (Equation 2)] However, the relational expression of polygon and texture is expressed by (Equation 17)
Even in (Equation 18), a calculation error occurs as in the case described above.

In other words, no matter which relational expression is used, the occurrence of calculation errors such as corresponding points, illuminance and opacity by the incremental algorithm cannot be avoided.

As described above, the calculation of the illuminance, opacity, bump, displacement, etc., including the corresponding points for the drawing pixels, cannot be accurately performed by the conventional incremental algorithm.

The error of the corresponding point calculation by the incremental algorithm is caused by a maximum displacement of one pixel on the screen. If the texture size is the same as or smaller than the polygon, the result is as follows. (Equation 12),
The error represented by (Equation 14) becomes smaller. However,
When the texture is sufficiently enlarged, the error increases in proportion to the enlargement ratio, and when a texture mapping image is generated, the image quality significantly deteriorates. However, in an apparatus that maps an image captured in real time to an arbitrary polygon in real time, it is impossible to determine the enlargement ratio of the texture in advance. For this reason, when an arbitrary texture is mapped to an arbitrary polygon, the deterioration of the image quality, which is a problem here, cannot be avoided.

Therefore, attention is paid to the error generated by the incremental algorithm, and this error is effectively eliminated to realize the theoretically accurate calculation of the corresponding point. Also, in realization, the configuration is extremely simple, and does not impair the high speed and the simplicity of the configuration. Furthermore, accurate and high-speed calculation of corresponding points in mapping is required.
It is very important not only in the field of computer graphics but also in home-use game machines, multimedia devices such as karaoke, and the like, and its applications are widespread. It is expected that the demand for real-time mapping processing will increase in the future.

Hereinafter, an error included in the coordinates (u, v) calculated by the conventional DDA will be described with reference to FIG.

In FIG. 6, it is assumed that a solid line represents coordinates in a screen space, and a broken line represents coordinates in a texture space.
Numbers surrounded by o indicate coordinate values in the texture space.

The screen pixel 603 is located at the screen coordinates (0, 2), and the texture pixel 604 is located at the texture coordinates (2, 3).

Reference numeral 605 indicates a polygon to be processed. The polygon 605 has coordinates (x, y, u, v)
= (7, 0, 0, 0), (0, 5, 0, 4), (3,
9, 4, 4) and (10, 4, 4, 0).

Reference numerals 601-a, 601-b,
601-c, 601-d and 601-e represent DDA in the edge direction, and reference numerals 602-a, 602-b,
602-c, 602-d, 602-e and 602-f
Is the DD in the span direction at the scan line of y = 3
Represents A.

The end point of each of the arrows representing the DDA is a point generated by the DDA in the span direction (this is called the DDA arrow).

In the texture mapping process, 601,
The pixels in the texture space indicated by the DDA arrow 602 are reflected on the pixels in the screen space indicated by the DDA arrows 601 and 602.

More specifically, the scan line at y = 3 has the following correspondence.

Arrow of DDA Screen pixel Texture pixel 601-c (2,3) (0,2) 602-a (3,3) (0,2) 602-b (4,3) (0,1) 602 −c (5,3) (1,1) 602 -d (6,3) (1,0) 602 -e (7,3) (2,0) 602 -f (8,3) (2,0) However, in the screen pixel (6, 3), the texture pixels to be reflected are (1, 0), (1, 1), (2, 1), and
(2, 0).

Which of these four texture pixels is DD
What happened at A depended on at what point in the screen pixel the texture was referenced.

That is, the image generated by the texture mapping differs depending on at which point of the screen pixel the texture is referred.

If the reference points to the textures in the screen pixels vary within the polygon, the quality of the generated image deteriorates. In particular, when there is this variation between spans, the image quality is greatly deteriorated.

The above phenomenon will be described using mathematical expressions.

In texture mapping, texture coordinates (u, v) and polygon coordinates (x, y) are expressed as (Equation 19) and (Equation 20).

[0061]

[Mathematical formula-see original document] u = f (x, y)

[0062]

Here, v = g (x, y) Here, (Equation 19) will be described, but the same applies to (Equation 20).

At this time, the polygon coordinates referring to the texture are (x0, y0). The polygon coordinates (x
Assuming that the screen coordinates obtained by quantizing (0, y0) are (X, Y),

[0064]

X0 = X + ex

[0065]

[Mathematical formula-see original document] y0 = Y + ey.

That is, the coordinate value u of the texture is expressed by (Equation 2)
3). It can be seen that the texture error varies due to the quantization error.

[0067]

U = f (X + ex, Y + ey) As described above, in the conventional method, since the position in the screen pixel that refers to the texture is not determined, the image is significantly deteriorated.

The present invention has been made in view of the above problems, and an object of the present invention is to provide a rendering device and a mapping device capable of generating a high-quality image at high speed in a computer graphics rendering process. It is in. In particular, in the mapping processing, it is an object of the present invention to realize the calculation of the corresponding points in the mapping processing at high speed and accurately with a simple configuration. The mapping process includes texture mapping, illuminance,
This includes mapping processing such as opacity, bump, displacement, and the like.

[0069]

[Means for Solving the Problems]

[0070]

The mapping apparatus of the present invention generates parameters corresponding to a polygon based on the positions of the vertices of the polygon projected on a plane having a plurality of pixels and the corresponding points given to the vertices of the polygon. A calculation unit, and an edge generation unit that determines a position of a first drawing point on an edge of the polygon and a position of a first corresponding point corresponding to the first drawing point based on the parameter, A rendering pixel corresponding to the first rendering point is determined, a sample point corresponding to the rendering pixel is determined, and the first pixel is determined based on the sample point.
A correction unit that corrects the position of the corresponding point, and the position of a second drawing point inside the polygon is determined based on the parameter and the sample point, and a second drawing point corresponding to the second drawing point is determined. A span generator for determining the position of the corresponding point, whereby the above object is achieved.

The correction unit is configured to set 1 for the first drawing point.
The dimension may be corrected.

The edge generating section sets a point where the edge of the polygon intersects the upper edge of the drawing pixel as a first drawing point, and the correction section sets a point closest to the origin in the drawing pixel to the first drawing point. It may be a sample point.

The bit precision for expressing the parameter may be set to a predetermined value, and the correction unit may include a shifter and an adder.

According to another mapping apparatus of the present invention, a parameter corresponding to a polygon is projected based on a position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the polygon vertex. An arithmetic unit for generating, an edge generating unit for determining a position of a first drawing point on an edge of the polygon and a first corresponding point corresponding to the first drawing point based on the parameter; A position of a second drawing point, which is a point inside the polygon, is determined based on the parameter and the first drawing point, and a second drawing point corresponding to the second drawing point is determined.
, A generated image storage unit that stores a value corresponding to each of the plurality of pixels on the plane, and a position of the first drawing point or the second drawing A pixel storage processing unit for storing a pixel value generated based on the position of the point as a value corresponding to one pixel of the generated image storage unit or a plurality of adjacent pixels; Is achieved.

[0076] The pixel storage processing section is configured to determine one pixel or a plurality of adjacent pixels on the plane of the area of the area on the plane defined by the position of the first drawing point or the second drawing point. The ratio of the area occupied by pixels to the area
The image processing apparatus may further include an area ratio calculation unit for calculating, and a pixel value distribution unit that distributes the generated pixel value to one pixel or a plurality of adjacent pixels on the plane based on the ratio .

The area ratio calculating section sets the position of the first drawing point or the second drawing point to (x, y),
A first multiplier for multiplying (1-x) and (1-y);
a second multiplier for multiplying x by (1-y); (1-
x) and a third multiplier for multiplying y, and a fourth multiplier for multiplying x and y, wherein the pixel value distribution unit includes an output from the first multiplier and A fifth multiplier for multiplying the generated pixel value, a sixth multiplier for multiplying the output from the second multiplier by the generated pixel value, and a fifth multiplier for multiplying the generated pixel value by the third multiplier. A seventh multiplier for multiplying an output by the generated pixel value; and an eighth multiplier for multiplying an output from a fourth multiplier by the generated pixel value. Good.

The position (x, y) of the first drawing point or the second drawing point or the bit precision representing the generated pixel value is set to a predetermined value, and the first to eighth points are set. Each of the multipliers may include a shifter and an adder.

The edge generating section sets a point at which an edge of the polygon intersects with an upper edge of the corresponding pixel as the first drawing point, whereby the second multiplier,
The fourth multiplier, the sixth multiplier, and the eighth multiplier may be omitted.

Another mapping apparatus according to the present invention provides a plurality of polygons corresponding to a polygon based on the positions of the vertices of the polygon projected on a plane having a plurality of pixels and the corresponding points given to the polygon vertices . Parameters that differ from each other
The first parameter, the second parameter and the third parameter
An operation unit that generates a plurality of parameters including a meter ,
Based on the first parameter, the position and the first first candidate point corresponding to the first drawing point on the polygon edges
A first edge generation section for determining a first corresponding point position corresponding to the candidate points, based on the second parameter,
A second edge generation unit that determines a position of a second candidate point corresponding to a first drawing point on an edge of the polygon and a position of a second corresponding point corresponding to the second candidate point; a selector for selecting one of the outputs of the second edge generation section of the first edge generation section, based on the selected output by the third parameter and the selection unit, the A span generator for determining the position of a second drawing point inside the polygon and determining the position of a third corresponding point corresponding to the second drawing point, thereby achieving the above object. .

While one of the first edge generator and the second edge generator is operating, the other edge generator may not be operating.

The calculating section calculates the inclination of the edge of the polygon on the plane, the selecting section accumulatively adds the decimal part of the inclination, and determines whether or not the result of the accumulative addition exceeds a predetermined value. Accordingly, one of the output of the first edge generator and the output of the second edge generator may be selected.

According to another mapping apparatus of the present invention, at least two polygons corresponding to a polygon are projected based on the positions of the vertices of the polygon projected on a plane having a plurality of pixels and the corresponding points given to the polygon vertices. An operation unit for generating a set of parameters; and one of the at least two sets of parameters.
An increment switching unit for selecting a set of parameters; a position of a sample point corresponding to a first drawing point on an edge of the polygon based on the selected set of parameters; An edge generation unit that determines the position of a first corresponding point corresponding to the position, and determines the position of a second drawing point inside the polygon based on the selected set of parameters and the position of the sample point. And a span generation unit that determines a position of a second corresponding point corresponding to the second drawing point,
This achieves the above object.

The arithmetic unit calculates the inclination of the edge of the polygon on the plane, and the increment switching unit accumulatively adds the decimal part of the inclination, and determines whether the result of the accumulative addition exceeds a predetermined value. May be selected from among the at least two sets of parameters.

According to another mapping apparatus of the present invention, a parameter corresponding to a polygon is projected based on a position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the vertex of the polygon. A calculating unit that generates, based on the parameters, a position of a first corresponding point corresponding to a first drawing point on an edge of the polygon and a position of a sample point corresponding to the first drawing point An edge generation unit for determining, a correction unit for correcting the position of the sample point when the distance between the first drawing point and the sample point exceeds a predetermined value, and a correction unit based on the parameter and the sample point. And a span generation unit for determining the position of a second drawing point inside the polygon and determining the position of a second corresponding point corresponding to the second drawing point. Achieved.

The correction section is included in the span generation section. The span generation section corrects the position of the sample point, and adjusts the position of the second drawing point and the second corresponding point. May be performed.

The arithmetic unit calculates the inclination of the edge of the polygon on the plane, the span generation unit accumulatively adds the decimal part of the inclination, and determines whether the result of the accumulative addition exceeds a predetermined value. May be determined depending on the position of the sample point.

The polygon vertices have attribute values for expressing the material of the polygon, and generate values corresponding to the first corresponding point and the second corresponding point based on the attribute values. You may further have a means.

The polygon vertices have coordinate values of bumps or displacements, and may further have means for calculating bumps or displacements inside the polygons.

The mapping device may further include means for performing an anti-aliasing process.

[0091] Each of the plurality of pixels on the plane may have a corresponding plurality of sub-pixels, and the first drawing point may be determined corresponding to sub-pixel positioning.

[0092]

[0093]

The mapping method of the present invention generates a parameter corresponding to a polygon based on the position of the vertex of the polygon projected on a plane having a plurality of pixels and the corresponding point given to the polygon vertex. And, based on the parameters, a first one on the edge of the polygon.
Determining the position of the drawing point and the position of the first corresponding point corresponding to the first drawing point; determining the drawing pixel corresponding to the first drawing point; Determining the sample point to be corrected, and correcting the position of the first corresponding point based on the sample point; and determining the position of a second drawing point inside the polygon based on the parameter and the sample point. Determining the position of a second corresponding point corresponding to the second drawing point, thereby achieving the above object.

In another mapping method according to the present invention, a parameter corresponding to a polygon is projected based on the position of the vertex of the polygon projected on a plane having a plurality of pixels and the corresponding point given to the polygon vertex. Generating, based on the parameters, a first
Determining the position of the drawing point and the first corresponding point corresponding to the first drawing point; and determining a second point within the polygon based on the parameter and the first drawing point. Determining the position of the second drawing point, and determining the position of the second corresponding point corresponding to the second drawing point; and determining the position of the first drawing point or the position of the second drawing point. A value generated based on one of the plurality of pixels on the plane or
Setting a value corresponding to a plurality of adjacent pixels, thereby achieving the above object.

The operation will be described below.

According to the rendering device and the mapping device of the present invention, in order to correct an error included in a pixel value generated based on a coordinate value of a drawing point on a polygon edge of a polygon projected on a screen, Generate a high-quality image by generating a pixel value of each pixel by performing a rendering process or calculating a corresponding point on a mapping image based on the coordinate values of a sample point corresponding to a pixel including a drawing point. Can be. More specifically, it is as follows.

First, in the first configuration, the edge generating unit calculates an edge drawing point corresponding to the y-coordinate of the sample point of the pixel defined in advance. At this time, the defined sample point and the calculated edge drawing point include the calculation error shown in (Equation 14). For the calculation error of (Equation 14),
When the distance between the sample point and the edge drawing point on the x-axis is L,
The processing of (calculation of texture coordinates (u, v)) (Equation 24) for the corresponding point is performed by the correction unit. As a result, it is possible to accurately calculate the corresponding points of the texture.

[0099]

U = u−L × ∂u / ∂x v = v−L × ∂v / ∂x The same applies to parameters (expression 24) other than texture coordinates, such as illuminance and opacity. be able to.

If the edge drawing point, which is the initial value of the span drawing point, matches the pixel sample point, all span drawing points included in the span match the pixel sample point. That is, it is not necessary to perform the parameter correction processing, and the corresponding point calculation of the span drawing point can be correctly performed.

As described above, by correcting the parameters for calculating the corresponding points at the edge drawing points, the corresponding points can be accurately calculated for all the pixels including the polygon.

L shown in the correction processing (Equation 24) is a value after the decimal point of the x-coordinate value of the edge drawing point calculated by the edge generation unit. When the x-coordinate value of the drawing point is x, (Equation 25) Can be given.

[0103]

L = x− [x] Further, ∂u / ∂x and ∂v / ∂x do not need to be newly calculated because they are used in the span generator. Furthermore, (Equation 24)
With respect to the precision of the multiplication indicated by, it is not necessary to exceed the precision of the decimal point of the x-coordinate value of the edge point calculated by the edge generation unit, and the precision has a few extra bits with respect to the resolution of the pixel to be generated. Alone is enough. in this way,
The configuration of the correction unit is relatively simple, and the advantage of simplification of the configuration by the incremental algorithm remains as a whole device.

Regarding the processing speed, the high-speed processing of the incremental algorithm is not impaired. The processing in the interpolation unit shown here is one multiplication and one addition (Equation 24).
The delay caused by performing the correction processing is extremely small. Further, the entire apparatus can operate the edge generation section, the interpolation section, the span generation section, and the like in a pipeline manner, and the high-speed processing as a whole is not impaired at all.

Further, in the anti-aliasing processing for edges, it is necessary to sample points on screen coordinates in an area where no polygon exists. in this case,
The distance between the sample point in the area where the polygon exists and the closest sample point in the x-axis direction is L, and the corresponding point can be calculated from the parameter of the sample point where the polygon exists by using (Equation 24). .

As described above, the texture mapping apparatus of the present invention realizes the accuracy of the calculation of the corresponding points of the texture mapping, simplification of the configuration, and high-speed processing.

Further, in the second configuration, the sample point in the first configuration is set to, for example, a point closest to the origin inside the pixel, so that the amount of calculation required for the correction processing is reduced, and a simpler circuit configuration Thus, a mapping device can be realized.

In the first and second configurations, the error of the corresponding point calculation is eliminated by correcting the calculation parameter of the corresponding point to be calculated as a result. However, the third configuration is a memory for storing the generated image. The pixel values obtained from the texture image are distributed and stored in (frame memory) according to the area of the texture pixels.
In the incremental algorithm, the deviation between the calculated drawing point and the sample point of the pixel causes image quality deterioration. When writing the pixels of the texture referred to by the calculated drawing points into the frame memory, ideally the texture pixels affect up to four pixels in the frame memory. With respect to the four pixels of the frame memory that exert an influence, a pixel value corresponding to the area ratio shared between the texture pixel and the frame pixel is reflected on each frame pixel. Thereby, the same effect as that described above can be obtained. That is, high-quality images can be obtained by various mappings.

In the third configuration, there is no need to perform parameter correction processing. On the other hand, the amount of access to the frame memory increases. However, the distribution storage in the frame memory is local, and an increase in the amount of access can be concealed by using a small amount of intermediate buffer with the frame memory.

In the fourth configuration, two edge generation units calculate data on polygon edges, and these data are appropriately selected by the selection unit, thereby obtaining
It is possible to ideally calculate screen coordinate values and texture coordinate values for polygon edges.

In this configuration, it is necessary to provide two edge generating units, but the correction processing can be realized by selecting data. Since this selector can be realized by a selector, it can be executed at a higher speed than the correction process. In addition, the circuit of the selector can be realized very easily.

Further, it is also possible to stop the operation of one of the two edge generating sections under the control of the selecting section. Thereby, the power consumption of the entire apparatus can be suppressed.

In the fifth configuration, the two edge generators provided in the fourth configuration are combined into one.
This is realized by appropriately selecting the increment value of the increment processing in the edge generation unit. The circuit can be realized by a very simple configuration.

Further, in the sixth configuration, the increment value calculated by the calculation unit and used by the edge generation unit is set to a value that simplifies the correction processing in the correction unit. That is, the normal increment processing is performed in the edge generation unit. The data generated here can be corrected very easily in the correction unit.

As a result, the correction section can be realized with a very simple configuration. In addition, the amount of calculation for the increment value calculated by the calculation unit is not much different from that of the conventional one. Therefore, with a simple configuration, it is possible to calculate an ideal polygon screen coordinate value and an ideal texture coordinate corresponding thereto at high speed.

In the seventh configuration, the processing in the correction unit and the span generation unit in the sixth configuration is realized by the same circuit. This is realized by using the same circuit, and does not reduce the processing speed. That is, the same function can be realized with a simpler configuration than the sixth configuration.

The mapping apparatus of the present invention focuses on the fact that the relative positional relationship between the drawing point calculated by the incremental algorithm and each corresponding pixel is not always constant, and calculates the position information of the sample point representing each pixel. The image quality is improved by determining each pixel value by using this.

Further, in another mapping apparatus according to the present invention, each pixel value determined by the position information of each drawing point calculated by the incremental algorithm is used to determine the relative positional relationship between each drawing point and each pixel value. By allocating the pixels to a plurality of adjacent pixels on the basis of the above, the same effect as the above-described mapping device is obtained.

Further, the problem of the error caused by the incremental algorithm not only affects the mapping process but also is a problem common to general rendering algorithms such as shading. Therefore, the present invention can be widely applied to rendering processing in general.

The image deterioration occurs because the position in the screen pixel referring to the texture has not been determined. That is, it is possible to prevent the image quality from deteriorating by making the position in the screen pixel that refers to the texture constant in the screen coordinate space.

The relational expression in texture mapping is:
Although expressed as (Equation 19) and (Equation 20), description will be made here using (Equation 26).

[0122]

U = f (x) = A × x + B This is for the sake of simplicity, but the same can be said in principle for (Equation 19) and (Equation 20).

The quantized value of x is X, and the quantization error is ex.
Then, the value x is represented by (Equation 27).

[0124]

X = X + ex Further, if an error between u calculated based on the value before quantization and u calculated based on the value after quantization is E, the error E is expressed by Expression 28. Is done.

[0125]

E = f (x) −f (X) = f (X + ex) −f (X) = f (ex) That is, if a quantization error is eliminated in the x space,
An error is not included in the value of u before and after quantization.

Also, by making the quantization error constant, E becomes constant as a result. This is because the calculated u has an error uniformly, and there is no relative error in the u space.

Thus, by making the coordinate values (x, y) for calculating the texture constant in all the pixels in the screen space, the texture coordinates to be calculated can be made error-free in the texture space. it can.

Therefore, the coordinates of the polygon and the texture can be calculated without errors, thereby preventing the image quality generated by the texture mapping from deteriorating.

[0129]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The principle of the mapping apparatus of the present invention can be widely applied to rendering processing in general, but for simplification of description, the following embodiments will describe the mapping apparatus. When the present invention is applied to rendering processing other than mapping, instead of performing the rendering operation using the coordinate values of each drawing point, the coordinate values of the sample points corresponding to each drawing point and the attribute values given to each polygon May be used to perform a desired rendering operation. The attribute value is a value for expressing a polygon material, and is a value indicating a reflectance, a transmittance, a refractive index, or the like of the polygon.

(Embodiment 1) Hereinafter, a first embodiment of the mapping apparatus of the present invention will be described with reference to the drawings.

FIG. 1 shows an example of the configuration of a mapping apparatus according to the present invention. The mapping device includes a main processor 1, a main memory 2, a rendering processor 3, a pixel memory 4, a DAC (digital-to-analog converter).
5, a monitor 6, and a system bus 7.

The main processor 1 performs a geometric operation of three-dimensional graphic processing for performing texture mapping, controls the rendering processor 3 and the DAC 5, and controls the entire system.

The main memory 2 stores a program executed by the main processor 1 and data required for each processing such as polygon data.

The rendering processor 3 performs polygon drawing on the pixel memory 4 under the control of the main processor 1.

The pixel memory 4 stores an image drawn by the rendering processor 3 and also stores a texture to be mapped.

The system bus 7 interconnects an input / output device (not shown) with the main processor 1, the main memory 2, the rendering processor 3, and the pixel memory 4.

The generated image is output to the monitor 6 via the DAC 5.

FIG. 2 shows a configuration example of the rendering processor 3. The rendering processor 3 includes a DDA coefficient operation unit 201, a mapping address generation unit 208, and an original image pixel processing unit 207.

The DDA coefficient calculation unit 201 determines the DDA used by the mapping address generation unit 208 based on the relationship between polygons and texture vertices input via the system bus 7.
Generate coefficients. The DDA coefficient includes a differential value of y (vertical DDA) and a partial differential value of x (horizontal DDA).

The mapping address generating section 208
A, a rendering process is performed by using an edge generation unit 202, a correction unit 203, and a span generation unit 204.
And

As shown in FIG. 3, the edge generation unit 202 includes a DDA processing unit 301 for x and a DDA processing unit 3 for y.
02, a DDA processing unit 303 for u, and a DDA processing unit 304 for v.

The DDA processing units 301 to 304 calculate the coordinate points (x, y, u, v) of the polygon edge using the differential value of y calculated by the DDA coefficient calculation unit 201. Specifically, the processing shown in (Equation 29) is performed.

In (Equation 29), (x (n + 1), y
(N + 1), u (n + 1), v (n + 1)) are (x
(N), y (n), u (n), v (n)) indicate the coordinates at the polygon edge on the scan line immediately below. Also, dx / dy and du / d shown in (Equation 29)
The values of v and dv / dy are calculated by the DDA coefficient calculation unit 201 and provided to the edge generation unit 202.

[0144]

(X (n + 1), y (n + 1), u (n + 1), v (n + 1)) = (x (n), y (n), u (n), v (n)) + (dx / Dy, 1, du / dy, dv / dy) Further, as shown in FIG. 4, the correction unit 203 includes an x correction unit 411, a y correction unit 412, a u correction unit 413,
v correction unit 414. Correction units 411 to 41
4 performs the processing (correction processing) shown in (Equation 32). Further, du / dy, ∂u / ∂x, and the like required for correction are calculated by the DDA coefficient calculation unit 201.

Further, as shown in FIG. 5, the span generation section 204 includes a DDA processing section 511 for x, a DDA processing section 512 for u, and a DDA processing section 513 for v.
In the span processing, since the y value does not change, the DD of y
No A processing unit is required.

The DDA processing sections 511 to 513 calculate the coordinate points (x, y, u, v) of the polygon edge using the differential value of y calculated by the DDA coefficient calculation section 201. Specifically, the processing shown in (Equation 30) is performed.

In (Equation 30), (x (n + 1), y
(N + 1), u (n + 1), v (n + 1)) are (x
(N), y (n), u (n), v (n)) indicate the coordinates at a point that is one pixel in the span direction.

[0148]

(X (n + 1), y (n + 1), u (n + 1), v (n + 1)) = (x (n), y (n), u (n), v (n)) + (1 , 0, ∂u / ∂x, ∂v / ∂x) Further, the pixel memory 4 includes a generated image storage unit 205,
And an original image storage unit 206. Generated image storage 2
Reference numeral 05 stores an image drawn by the rendering processor 3. The original image storage unit 206 stores an original image (texture) to be drawn by the rendering processor 3.

FIG. 7 is a block diagram showing an address generator in the mapping apparatus according to the first embodiment of the present invention. Using the position of the polygon vertex and the corresponding point given to the polygon vertex, the arithmetic unit 101 calculates a parameter used for calculation of a drawing point inside the polygon and calculation of the corresponding point by an incremental algorithm. The edge generation unit 102a performs an operation of determining the positions of the drawing points and the corresponding points on the polygon edge using the parameters calculated by the calculation unit 101. The correction unit 103a performs a correction process on the corresponding point (texture image) generated by the edge generation unit 102a using the parameters calculated by the calculation unit 101 and the drawing points determined by the edge generation unit 102a. The span generation unit 104 calculates the drawing points of the polygon span and the corresponding points using the parameters calculated by the calculation unit 101 and the data generated by the correction unit 103a, and outputs the calculation results.

The operation of the address generator of the mapping apparatus having the above-described configuration will be described below with reference to the drawings.

FIG. 8 is an enlarged view of the pixel crossed by the side 1404 in FIG. 37. The pixel in FIG. 8 is (x, y) = (2,4) (2,5) (3,3) in FIG. 5) It corresponds to the part enclosed by (3,4). 201 indicates a pixel on the screen, 202 indicates an edge of the polygon, and the polygon exists on the right side of the edge. Reference numeral 203 denotes an edge drawing point (x0, y0) before correction processing generated by the edge generation unit 102a. Reference numeral 205 denotes a sample point (X, Y) of the pixel 201. Reference numeral 204 denotes a point (x ′,
y '), located on the polygon edge 202, y' = Y
And The point (x, y) on the polygon and the corresponding point (u, v) on the texture image are represented by (Equation 1) and (Equation 2).
And the corresponding point of the texture image at the edge drawing point 203 is (u0, v0), and the sample point 2
The corresponding point of the texture image at 05 is (U, V), point 2
The corresponding point of the texture image in 04 is (u ′, v ′).

At this time, these corresponding points include (Equation 3)
1), the relationship shown in (Equation 32) holds ((Equation 4),
(Equation 7)).

[0153]

(U ′, v ′) = (u0 + du / dy × (Y−y0),
v0 + dv / dy × (Y-y0))

[0154]

(U, V) = (u ′ + ∂u / ∂x × (X−x ′),
v '+ ∂v / ∂xx (X-x'))

[0155]

Since x '= x0 + dx / dy, (u0, v0) and (U, V) are (Equation 3)
The relationship of 4) holds.

[0156]

(U, V) = (u0 + du / dy × (Y-y0) + ∂u
/ ∂xx (X-x0-dx / dy), v0 + dv / dyx (Y-y
0) + ∂v / ∂x × (X−x0−dx / dy)) Specifically, the sample point is set as the center point of the pixel, and (X, Y) =
(2.5, 4.5), assuming that the y coordinate of the drawing point to be calculated is 4.20, (x0, y0, u0, v0) = (2.40, 4.20, 0,00, 11.20), and (Equation 34), (Equation 5) , (Equation 8), (U, V) = (1.53, 11.24). Here, the target polygons are the same as those described in the related art, and dx / dy, du / dy,
The same value can be used for dv / dy, ∂u / ∂x, and ∂v / ∂x. By calculating the pixel value of the texture based on the (U, V) value, it becomes possible to reflect an accurate pixel value on the screen pixel. That is, the edge drawing point 20 generated by the edge generation unit 102a
By correcting the corresponding point (u0, v0) of 3 (x0, y0) to the corresponding point (U, V) of the sample point 204 (X, Y) by the correction unit 103a (see (Equation 34)), It is possible to calculate an ideal corresponding point of 201. Further, by ideally calculating the corresponding point of the top pixel of the span, the corresponding point of the pixel included in this span can also be ideally calculated (see (Equation 7)).

Here, a configuration example of the correction unit 103a will be described. Since the correction processing for the texture coordinates v is the same as the correction processing for u, in FIG.
Only the configuration related to the texture coordinate u in FIG. In (Equation 34), (Y-y0) and (X-x0) do not exceed 1, and are defined by sample points of pixels. That is, here, Y−y0 = decimal part of Y−decimal part of y0 = 0.5−decimal part of y0 X−x0 = decimal part of X−decimal part of x0 = 0.5−decimal part of x0 . In FIG. 9, a multiplier 1601
Is a first multiplier for calculating the second term of (Expression 34) representing U. The adder 1602 is a first adder that calculates (X-x0 + dx / dy) in the third term of U (Equation 34). The multiplier 1603 is a second multiplier that calculates the third term of (Expression 34) representing U. The adder 1604 calculates U
The first, second, and third terms of (Expression 34) representing
This is a second adder to be calculated. Further, the corresponding point v can be realized with the same configuration. With this configuration, it is possible to realize the correction processing according to (Equation 34), that is, the correction unit 103a in the present embodiment.
Can be realized.

As described above, according to the present embodiment, by providing the correction unit 103a, the edge generation unit 102a
Correction processing is performed on the corresponding point corresponding to the edge drawing point generated in step (1). This makes it possible to calculate an ideal corresponding point for the pixel including the edge drawing point. If the head of the span drawing point, that is, the edge drawing point is an ideal corresponding point, an ideal corresponding point can be calculated for the pixels included in the span. That is, ideal corresponding points can be calculated for all the pixels included in the polygon, and the image quality of the mapping image can be improved.

Further, the variable (Equation 34) used in the correction processing performed by the correction unit 103a is the same as the variable used in the conventional incremental algorithm, and does not need to be newly generated. Further, although the entire processing is delayed by the correction processing, all the components shown in FIG. 7 can be operated in a pipeline manner, and the high-speed performance of the entire processing is not impaired at all.

In the present embodiment, the relationship between the polygon and the texture image is (Equation 1) and (Equation 2), but the relationship is not limited to (Equation 1) and (Equation 2). For example, even if this relation is expressed by (Equation 17) and (Equation 18), accurate corresponding point calculation can be performed.

In other words, the present embodiment can correspond to any corresponding point formula.

In this embodiment, the calculation of the corresponding points on the image to be mapped to the polygon has been described. However, the same processing can be applied to the illuminance calculation and the opacity calculation. In addition, as with the corresponding points, these can also correspond to any relational expressions.

Although the present embodiment has been described with respect to a method in which anti-aliasing processing is not performed, similar processing can be performed including anti-aliasing processing.

Note that the same correction processing as that of the present embodiment can be performed when sub-pixel positioning is performed.

The address generator for determining the position (address) of the corresponding point on the texture image has been described with reference to FIG. 7, but if this is used for texture mapping, the configuration shown in FIG. 10 is obtained. The address generator 1701 receives the correspondence between polygons and textures, and generates an address (x, y) of a polygon on the screen and an address (u, v) of the corresponding texture on the screen. The texture memory 1702 stores a texture image. The frame memory 1703 stores an image to be generated. The address generating unit 1701 draws the polygon drawing coordinates and the corresponding texture coordinates (u, v)
Is output. The pixel value read from the texture memory 1702 according to the output texture coordinates (u, v)
(R, G, B) is stored in the frame memory 1703. This storage address is determined from (x, y) output from the address generator 1701.

Also, illuminance mapping (shading)
, The configuration shown in FIG. Illuminance calculation unit 1
Reference numeral 801 denotes an address (x, y) of a polygon on a screen, using the correspondence between the polygon and the illuminance of the polygon as an input.
And the pixel value representing the color in the corresponding polygon
(R, G, B). The frame memory 1803 is a frame memory for storing an image to be generated. The illuminance calculation unit 1801 outputs the drawing coordinates of the polygon and the corresponding pixel values (R, G, B). The output pixel value (R,
G, B) are stored in the frame memory 1803. This storage address is (x, y) output from the illuminance calculation unit 1801.
Is determined from

Further, mapping other than those described here, such as opacity, bump, and displacement mapping, can be realized by a similar configuration.

The same applies to the following embodiments, and the present invention can be used for mapping of texture, illuminance, opacity, bump, displacement, and the like.

(Embodiment 2) Hereinafter, a second embodiment of the mapping apparatus of the present invention will be described with reference to the drawings. The configuration is the same as in the first embodiment. In the present embodiment, a point closest to the origin in a pixel is determined as a sample point, and an edge drawing point and its corresponding point are calculated in accordance with the y-axis of the sample point, so that the correction processing in the correction unit is performed one-dimensionally. Can be simplified as compared with the first embodiment.

FIG. 12 is an enlarged view of the pixel crossed by the side 1404 in FIG. 37. The pixel in FIG.
7 corresponds to a portion surrounded by (x, y) = (2, 4) (2, 5) (3, 5) (3, 4). 401 indicates one pixel on the screen,
Reference numeral 402 denotes an edge of the polygon. The polygon to be drawn exists on the right side of the polygon edge. Reference numeral 403 denotes an edge drawing point (x0, y0) before correction processing generated by the edge generation unit 102a.

Reference numeral 404 denotes a sample point (X, Y) of the pixel 401.
It is. Further, it is assumed that the relationship shown in (Equation 1) and (Equation 2) holds between the point (x, y) on the polygon and the point (u, v) on the texture image. The corresponding point is (u0, v0), and the corresponding point of the texture image at the sample point 404 is (U, V).

At this time, these corresponding points include (Equation 3)
1), the relationship shown in (Equation 32) holds ((Equation 4),
(Equation 7)).

Here, the sample point of the screen pixel is set as the point closest to the origin in the pixel (FIG. 1).
2, an edge drawing point and its corresponding point are calculated by the edge generation unit 102a in accordance with the y-axis of the sample point of the screen pixel defined in advance. Thereby, an edge point as shown in FIG. 12 can be generated.

At this time, (3)
The relationship shown in 5) holds (see (Equation 4) and (Equation 7)).

[0175]

(U, V) = (u0−∂u / ∂x × (x0−X), v0−
∂v / ∂x × (x0−X)) Also, since the sample point 404 is the point closest to the origin in the pixel 401,

[0176]

(X, Y) = ([x0], y0), and (Expression 35) can be replaced by (Expression 37).

[0177]

(U, V) = (u0−∂u / ∂x × (x0− [x0]), v
0-∂v / ∂xx (x0- [x0])) Specifically, the sample point is defined as the upper left (X, Y) = (2.0,
4.0), when the y coordinate of the calculated drawing point is adjusted to the sample point, (x0, y0, u0, v0) = (2.67, 4.00, 0.00, 10.67), and (Equation 34), (Equation 5), (Equation 5) 8), (U, V) = (-0.71, 11.03). Here, the calculated U becomes a negative value. This is an ideal corresponding point calculation where the sample points are outside the polygon and become negative.

Here, the target polygons are the same as those described in the prior art, that is, dx / dy, du / d
The same value can be used for y, dv / dy, ∂u / ∂x, and ∂v / ∂x. By calculating the pixel value on the texture image using the (U, V) value, it becomes possible to reflect an accurate pixel value for the pixel.

That is, the corresponding point (u0, v0) of the edge drawing point 403 (x0, y0) generated by the edge generating unit 102a is
The corresponding point of the sample point 404 (X, Y) in the correction unit 103a
By correcting to (U, V) (see (Equation 37)), an ideal corresponding point of the pixel 401 can be calculated. Further, by ideally calculating the corresponding point of the top pixel of the span, the corresponding point of the pixel included in this span can also be ideally calculated (see (Equation 7)).

Next, the correction unit 103 in the present embodiment
A configuration example of a will be described. Since the correction processing for the texture coordinates u and v can be considered in the same manner, FIG.
3 shows a configuration regarding the texture coordinates u in the correction unit 103a. In (Equation 37), (x0- [x0]) represents the decimal part of x0. In FIG. 13, a multiplier 1901 calculates the second term of (Expression 37) representing U. The adder 1902 is an adder that adds the first term and the second term of (Equation 37) to calculate U. The corresponding point V
Can also be realized with a similar configuration. With this configuration, it is possible to realize the correction processing according to (Equation 37), that is, the correction unit 1 according to the present embodiment.
03a can be realized.

The corresponding point (u0, v0) of the edge drawing point 403 (x0, y0) generated by the edge generating unit 102a is changed to the corresponding point (U, V) of the sample point 404 (X, Y) by the correction unit 103a. By performing the correction (Equation 37), an ideal corresponding point of the pixel 401 can be calculated. Further, by ideally calculating the corresponding point of the top pixel of the span, the corresponding point of the pixel included in this span can also be ideally calculated (see (Equation 7)).

As described above, according to the present embodiment, the edge generating unit 102a generates an edge drawing point corresponding to the y-coordinate of a pixel sample point and a corresponding point, and
In step 3a, parameters relating to the polygon edges generated by the edge generation unit 102a are corrected. Thus, ideal corresponding points can be calculated for all the pixels included in the polygon, as in the first embodiment, and the image quality of the texture mapping image can be improved.

The correction processing can be realized by one multiplication and one addition for one parameter from the configuration diagram of the correction unit 103a shown in FIG. 13, and (x0− [x
0]) can be realized by the upper bit mask,
The circuit can be simplified as compared with the case of the first embodiment. That is, the delay of the entire processing due to the correction processing can be extremely reduced. Also, as for the entire apparatus, all the components can be operated in a pipeline manner, and the high-speed processing as a whole is not impaired.

In this embodiment, the sample point in the pixel is set to the point closest to the origin in the pixel. However, the position of this sample point can take another position. For example, the point farthest from the origin may be used as the sample point.

In the present embodiment, the relationship between a point on a polygon and a point on a texture image is represented by (Equation 1) and (Equation 2).
However, the relationship is not limited to (Equation 1) and (Equation 2). For example, even if this relation is expressed by (Equation 17) and (Equation 18), accurate corresponding point calculation can be performed. In other words, it can correspond to any corresponding point expression.

In this embodiment, the calculation of the corresponding points of the polygon has been described. However, the same processing can be realized for the illuminance calculation and the opacity calculation. In addition, as with the corresponding points, these can also correspond to any relational expressions.

Although the present embodiment has been described with respect to a method in which anti-aliasing processing is not performed, similar processing can be performed including anti-aliasing processing.

It should be noted that the same correction processing as in the present embodiment can be performed even when sub-pixel positioning is performed.

Embodiment 3 Hereinafter, a third embodiment of the present invention will be described with reference to the drawings.

FIG. 14 is a configuration diagram of a mapping device according to the third embodiment of the present invention. Using the position of the polygon vertex and the corresponding point given to the polygon vertex, the calculation unit 501 calculates a drawing point inside the polygon and a parameter used for calculating the corresponding point by the incremental algorithm. The edge generation unit 502 uses the data generated by the calculation unit 501 to calculate drawing points and corresponding points of polygon edges. The span generation unit 503 calculates the drawing points of the polygon span and the corresponding points using the data generated by the calculation unit 501 and the corresponding points generated by the edge generation unit 502. The original image storage unit 504 stores an original image (mapping image). The generated image storage unit 505 stores the generated image. The pixel storage processing unit 506 includes the span generation unit 5
The one pixel data stored in the original image storage unit 504 is stored as one or more adjacent pixel data in the generated image storage unit 505 using the data from step S03.

The operation of the mapping apparatus configured as described above will be described below with reference to the drawings.

FIG. 15 is an enlarged view of a pixel crossed by a side 1404 in FIG. 37. The pixel in FIG.
7 corresponds to a portion surrounded by (x, y) = (2, 4) (2, 6) (4, 6) (4, 4). Pixels 601a, 601b, 601c, 601
d is a pixel on the screen, and the coordinates of the point (upper left) closest to the origin in each pixel are (x, y) =
(2,4), (3,4), (2,5) and (3,5). An edge 602 indicates an edge (side 1404) of the polygon, and it is assumed that the polygon exists on the right side of the edge 602. Drawing point 603 edge
Drawing points generated by the di-generating unit 502 (x0, y0) = ( 2.4
0,4.20).

Here, the sample point of the screen pixel is set as the point closest to the origin in the pixel (FIG. 1).
5, a point 604a is a sample point (X, Y) = (2,4) of the pixel 601a, a point 604b is a sample point (X + 1, Y) = (3,4) of the pixel 601b, and a point 604c is The sample point (X, Y + 1) = (2, 5) of the pixel 601c, and the point 604d is the pixel 601
It is assumed that the sampling point of d is (X + 1, Y + 1) = (3, 5). Pixel 60
Reference numeral 5 denotes a texture pixel corresponding to the drawing point 603, which represents a state of being projected on a screen. The texture pixels are read from the original image storage unit 504 and have the same size as the screen pixels.

When texture mapping is performed,
As described above, the corresponding point (u0, v0) of the drawing point 603 generated by the edge generating unit 502 does not match the corresponding point of the pixel 601a.

Here, on the assumption that the corresponding point at the drawing point does not match the corresponding point at the sample point of the pixel, the data of the pixel to be drawn on the screen is stored in a plurality of pixels on the screen. Resolve the discrepancy problem.

That is, the texture pixel 605 represented by the corresponding point (u0, v0) of the drawing point 603 (x0, y0) is read from the original image storage unit 504. The pixels 605 are stored after being distributed to the pixels 601a, 601b, 601c, and 601d on the screen to solve the conventional problem. The distribution is performed according to the determined area shared by the texture pixel 605 and each screen pixel. That is, a weighting coefficient is calculated for each screen pixel according to the shared area, and a value obtained by multiplying the pixel value of the texture pixel 605 by each weighting coefficient is distributed to each screen pixel value. For example, a shared area ratio can be used as a weighting coefficient.

In FIG. 15, reference numeral 606a denotes a portion (shared area) shared by the texture pixel 605 and the screen pixel 601a, and the area (shared area) is Sa. Similarly, reference numeral 606b denotes a shared area with the screen pixel 601b, and the shared area is Sb. 606c
Represents a shared region with the screen pixel 601c, and the shared area is Sc. 606d is the screen pixel 6
01d, and the shared area is Sd. These shared areas can be expressed as in (Equation 38) to (Equation 41).

[0198]

[Equation 38] Sa = (1− (x0−X)) × (1− (y0−Y))

[0199]

Sb = (x0-X) × (1- (y0-Y))

[0200]

Sc = (1− (x0−X)) × (y0−Y)

[0201]

Sd = (x0−X) × (y0−Y) Specifically, the respective shared areas are shown below (see FIG. 16). FIG. 16 is an enlarged view of the four shared areas in FIG.

Sa = (1-2.4-2) * (1-4.2-4) = 0.6 * 0.8 = 0.48 Sb = (2.4-2) * (1-4.2-4) = 0.4 * 0.8 = 0.32 Sc = ( 1-2.4-2) * (4.2-4) = 0.6 * 0.2 = 0.12 Sd = (2.4-2) * (4.2-4) = 0.4 * 0.2 = 0.08 At this time, the pixel value of the texture pixel 605 is (R, G, B) = (1
92, 64, 32), the pixel 601a, the pixel 601b,
The pixels 601c and 601d have (R, G, B) = (9
2.16, 30.72, 15.36), (61.44, 20.48, 10.24), (23.
04, 7.68, 3.84) and (15.36, 5.12, 2.56) are stored.

These processes are performed by the image storage processing unit 506, and the texture data (pixel value) of the original image storage unit 504 is read out and the above-described process is performed on the generated image storage unit 505. The original image storage unit 504 and the generated image storage unit 505 are realized by, for example, a memory, and the image storage processing unit 506 is realized by a configuration as shown in FIG.

In FIG. 17, a multiplier 2101 calculates a common area Sa, a multiplier 2102 calculates a common area Sc, a multiplier 2103 calculates a common area Sb, and
104 calculates the shared area Sd. The multiplier 2105 calculates a pixel value to be stored in the pixel 601a, and
Calculates the pixel value to be stored in the pixel 601c,
07 calculates the pixel value to be stored in the pixel 601b, and the multiplier 2108 calculates the pixel value to be stored in the pixel 601d.
With such a configuration, the image storage processing unit 506 can be realized.

As described above, according to the present embodiment, by providing the image storage processing unit 506, the value of the texture pixel reflected on the screen pixel can be changed according to the shift between the drawing point and the sample point generated in the incremental algorithm. , Distribute and store. That is, it is possible to reflect accurate pixel values in texture mapping for all pixels on the screen, and to implement accurate texture mapping on the screen. This is different from the first and second embodiments in which the position of the drawing point is corrected, and the present embodiment can be said to correct the drawing pixel.

The processing performed by the image storage processing unit 506 added in the configuration of the present embodiment is a processing for calculating the shared area of the texture pixel and the screen pixel ((Equation 38) to (Equation 41)) and the processing according to the area. Processing for distributing the texture pixel values, and processing for storing the distributed texture pixel values.

The calculation of the shared area and the distribution of the pixel values performed by the multiplier in FIG. 17 can be realized by a shifter and an adder. In other words, the multiplier in FIG. 17 is not a so-called multiplier, but a multiplier composed of shift and addition. In addition, by suppressing the accuracy required in these processes, the number of adders can be reduced, and furthermore, the delay due to the addition process can be reduced. That is, these processes are not high loads and do not lead to a reduction in processing speed. Further, regarding the processing of storing the distributed texture pixel values, since the stored pixels are always adjacent, the access to the generated image storage unit 505 itself is performed in parallel, and the processing performed by the image storage processing unit 506 is performed. It is also possible to operate in parallel with other components. That is, the configuration of the image storage processing unit 506 is not complicated, and its processing speed does not deteriorate.

In the present embodiment, the sample point in the pixel is the point closest to the origin in the pixel, but the position of this sample point is arbitrary.

In this embodiment, the edge generation unit 5
02, the value of the drawing point in the y-axis direction does not match the value of the sample point of the pixel in the y-axis direction, but the edge generation unit 502 generates a drawing point that matches these values. The amount of access to the generated image storage unit 505 can be reduced.

In the present embodiment, the calculation of the corresponding points of the polygon has been described, but the same processing can be realized for the illuminance calculation and the opacity calculation. In addition, as with the corresponding points, these can also correspond to any relational expressions.

[0211] In the present embodiment, the description has been given of the method in which the anti-aliasing processing is not performed. However, the same processing can be performed including the anti-aliasing processing.

[0212] Even when sub-pixel positioning is performed, the same correction processing as that of the present embodiment can be performed.

In this embodiment, the texture pixels have a common area with the four pixels on the screen.
By generating drawing points in accordance with the y coordinate values of the sample points, the maximum number of shared areas is two. Thereby, access to the generated image storage unit realized in the memory can be dramatically reduced.

(Embodiment 4) Hereinafter, a fourth embodiment of the present invention will be described with reference to the drawings.

FIG. 18 is a configuration diagram of an address generation unit of the mapping device according to the fourth embodiment of the present invention. The calculation unit 701 calculates a drawing point inside the polygon and a parameter used for calculating the corresponding point using the position of the polygon vertex and the corresponding point given to the polygon vertex. The first edge generation unit 702a calculates candidate points and corresponding points corresponding to the drawing points of the polygon edges using the parameters generated by the calculation unit 701. The second edge generation unit 702b calculates candidate points and corresponding points corresponding to the drawing points of the polygon edges using the parameters generated by the calculation unit 701. The selection unit 703 includes a first edge generation unit 702a
Or the second edge generation unit 70
2b, and outputs the selected result to the first edge generation unit 702a and the second edge generation unit 702b. The span generation unit 704 is
Using the parameters generated in step 1 and the result selected by the selection unit 703, the drawing point of the polygon span and the corresponding point are calculated, and the calculation result is output.

The operation of the address generator of the mapping apparatus having the above configuration will be described below with reference to the drawings.

FIG. 19 shows the pixels on the screen crossed by the edges of the polygon to be drawn. Reference numeral 801 denotes an edge of a polygon, and it is assumed that a polygon exists on the right side of the edge, and the relationship shown in (Equation 1) and (Equation 2) holds between the polygon and the texture. This polygon edge passes through P0 (6,0) and P4 (0,4) on the screen, and the first edge generation unit 702a and the second edge generation unit 702a are defined by a predetermined screen pixel. A candidate point and a corresponding point corresponding to the edge drawing point are calculated in accordance with the y-axis of the sample point. Here, a sample point of a pixel is a point closest to the origin in the pixel. Points 802a, 802b, 802c, 802d, 80
2e is each drawing point P0, P1, P2, P3, P4 calculated in the scan line direction by the incremental algorithm.
Pixels 803a, 803b, 803c, 803d, 803
e are the drawing points 802a, 802b, 802c,
It is assumed that pixels 802d and 802e are reflected. Point 804
a, 804b, 804c, 804d, and 804e are sample points of the pixels 803a, 803b, 803c, 803d, and 803e. Further, arrows indicated by 805a to 805d indicate transitions of pixel sample points to be drawn along polygon edges. Here, for the polygon to be texture-mapped, the screen coordinates and texture coordinates of each vertex are (x, y, u, v) = (6,0,0,0) (0,4,0,
16) (8, 5, 16, 16).

FIG. 20 is an enlarged view near the drawing point P0 (802a). 20, the components having the same reference numerals as those in FIG. 19 indicate the same components as those in FIG. Point 901 is the closest sample point existing leftward in the figure with respect to drawing point 802b (same as 804b), and point 902 is the closest sample point present rightward in the figure with respect to drawing point 802b. I do. Here, it is assumed that the sample point 901 and the sample point 902 are candidate points of the drawing point 802b. The arrow 903 indicates the sample point 8
It is assumed that a change from 04 a to the sample point 901 and an arrow 904 indicates a change from the sample point 804 a to the sample point 902.

At this time, sample points 901 and 902
From the distance between the drawing point 802b and the corresponding point u at 903
(Du / dy (L)) is (Equation 42), and the change (du / dy (R)) of the corresponding point u in 904 is (Equation 43) (correspondence from sample point 804a to drawing point 802b) The change of the point u is du / dy).

[0220]

[Mathematical formula-see original document] du / dy (L) = du / dy-∂u / ∂x ×
(Dx / dy- [dx / dy])

[0221]

(43) du / dy (R) = du / dy + ∂u / ∂x ×
(1−dx / dy + [dx / dy]) The change of the two corresponding points u is represented by 804a,
The pixels 803a, 803c, 804c, 804d, and 804e are appropriately selected each time they change.
The ideal corresponding points of b, 803c, 803d, and 803e can be calculated. In FIG. 19, 805a, 80
5c is du / dy (L), and 805b and 805d are du.
/ Dy (R) will be used for the corresponding point calculation.

The change (du / dy) of the two corresponding points u
(L) and du / dy (R)) are selected as follows. Error E of x on the x-axis between the drawing point and the sample point
(Distance) is E by repeating the incremental algorithm
(Equation 46) is accumulated. However, the accumulated error does not exceed 1. Similarly to the corresponding point u, there are two increments of x and v, respectively, and these are selected in the same procedure. Two increments of the drawing point x and the corresponding point v are represented by dx / dy (L),
dx / dy (R), dv / dy (L), dv / dy
(R). These are (Equation 44) and (Equation 45)
The calculation is performed by the calculation unit 701 according to the following equation.

[0223]

Dx / dy (L) = [dx / dy] dx / dy (R) = [dx / dy] +1

[0224]

Dv / dy (L) = dv / dy-∂v / ∂x ×
(Dx / dy- [dx / dy]) dv / dy (R) = dv / dy + ∂v / ∂xx × (1-dx
/ Dy + [dx / dy]) In selecting two increments, the difference (expressed as an error) between the drawing point and the sample point shown in (Equation 46) is cumulatively added. If this cumulative error is 1 or more, dx / Dy (R), du / dy
(R), dv / dy (R) is used as an increment of (R). When the accumulated error is less than 1, dx / dy
(L), du / dy (L), and dv / dy (L) are used (increments of (L)).

[0225]

E = dx / dy- [dx / dy] In FIG. 19, the sample point 804a is changed to the sample point 80.
4b, the cumulative error E0 of x is (Equation 47)
And the increment for the drawing point x and the corresponding points u and v is (L)
Use the increment of.

[0226]

E0 = dx / dy− [dx / dy] = 1.5− [1.5] = 0.5 <1.0 When changing the sampling point 804b to the sampling point 804c, the cumulative error E1 of x becomes (Equation 48), and drawing is performed. (R) is used as the increment for the point x and the corresponding points u and v.

[0227]

E1 = E0 + dx / dy- [dx / dy] = 0.5 + 1.5- [1.5] = 1.0> = 1.0 When the sample point 804c is changed to the sample point 804d, the cumulative error E2 of x becomes 49), and the increment regarding the drawing point x and the corresponding points u and v uses (L).

[0228]

E2 = E1 + dx / dy- [dx / dy] = 0 + 1.5- [1.5] (E1 = E1-
When the sample point 804d is changed to the sample point 804e, the cumulative error E3 of x becomes (Equation 50), and (R) is used for the increment regarding the drawing point x and the corresponding points u and v. .

[0229]

E3 = E2 + dx / dy- [dx / dy] = 0.5 + 1.5- [1.5] = 1.0> = 1.0 Specifically, the corresponding point is calculated as follows. First, the relationship between the screen coordinates and the texture coordinates of the polygon to be texture mapped ((x, y, u, v) = (6,0,0,0) (0,
(4,0,16) (8,5,16,16) triangular polygon), dx / dy, du / dy, dv / d
y, dx / dy, dx / dy (L), du / dy
(L), dv / dy (L), dx / dy (L), dx /
dy (R), du / dy (R), dv / dy (R), d
x / dy (R), ∂u / ∂x, ∂v / ∂x are calculated by the arithmetic unit 70
Calculate with 1. Here, the edge 801 used for the description is calculated (Equation 51).

[0230]

Dx / dy = −6 / 4 = −1.5 du / dy = −0 / 4 = 0 dv / dy = 16/4 = 4 ∂u / ∂x =-((y1-y0) (u2- u1)-(y2-y1) (u1-u0)) / ((x1-x0) (y2-y1)-(x2-x1) (y 1-y0)) =-((4-0) (16- 0)-(5-4) (0-0)) / ((0-6) (5-4)-(8-0) (4-0)) = 64/38 ∂v / ∂x =-( (y1-y0) (v2-v1)-(y2-y1) (v1-v0)) / ((x1-x0) (y2-y1)-(x2-x1) (y 1-y0)) =-( (4-0) (16-16)-(5-4) (16-0)) / ((0-6) (5-4)-(8-0) (4-0)) = -16 / 38 dx / dy (L) = [dx / dy] =-2.0 du / dy (L) = 0-∂u / ∂x * ((-1.5)-(-2.0)) = 0-64 / 38 * ( 0.5) = -0.84 dv / dy (L) = 0 -∂v / ∂x * ((-1.5)-(-2.0)) = 4-(-16/38) * (0.5) = 4.21 dx / dy ( R) = [dx / dy] + 1 = -1.0 du / dy (R) = 0 + ∂u / ∂x × (1-(− 1.5) + (− 2.0)) = 0+ (64/38) × (0.5) = 0.84 dv / dy (R) = 0 + ∂v / ∂x × (1-(-1.5) + (-2.0)) = 4 + (-16/38) × (0.5) = 3.79 E = dx / dy-[dx / dy] = -1.5-(-2.0) = 0.5 Formula (51) calculated by the arithmetic unit 701 Based on the parameter, the first edge generation section 702a, a second edge generation section 702b, the processing of the selection unit 703 will be described.

The first edge generation section 702a includes an operation section 7
The increment of (L) calculated in step 01 (see (Equation 51)) and the screen coordinate value and the texture coordinate value (6,0,0,0) of the point P0 are given as initial values. Second edge generation unit 702b
Is the increment of (R) calculated by the arithmetic unit 701 and ((Equation 5)
1)), the screen coordinate value and the texture coordinate value (6, 0, 0, 0) of the point P0 are given as initial values. Selector 703
, The difference E (see (Equation 51)) between the drawing point and the sample point calculated by the calculation unit 701 is given.

In the edge generation units 702a and 702b, the initial value is set to (x, y, u, v) given to the polygon vertex.
Thereafter, each increment value is added to (x, y, u, v) output from the selection unit 703. The first edge generation unit 702a uses the increment value of (L), and the second edge generation unit 702b uses the increment value of (R) to execute the next step.
Calculate (x, y, u, v).

The selecting section 703 sequentially adds E (= dx / dy- [dx / dy]) when calculating an edge point, and calculates a cumulative error. If this cumulative error is less than 1, (x, y, u, v) is output from the first edge generator 701a, and if this cumulative error is 1 or more, it is output from the second edge generator 702b (x , y, u, v).

FIG. 21 shows the flow of processing in the first edge generator 702a, the second edge generator 702b, and the selector 703.

In FIG. 21, processes 2201, 220
3, 2205, and 2207 are the first edge generation unit 702
a. Processing 2202, 2204, 22
06 and 2208 are processes in the second edge generation unit 702b. Processing 2211, 2212, 2213, 2
Reference numeral 214 denotes a process in the selection unit 703, which selects data based on this value. 2221, 2222, 222
Reference numerals 3 and 2224 depict how the selection unit 703 selects data. In the figure, shaded numerical values (data) are values calculated by the arithmetic unit 701. The data output from the selection unit 703 is underlined.

Next, calculation of screen coordinate points and texture coordinate points in the target polygon (step 0)
(Step 4).

In each step, the y coordinate values are 0, 1, 2, 3, and 4.

(Step0) The point P0 (6,0,0,
0) is an initial value in the subsequent processing.

This (6,0,0,0) is the output value from the selection unit 703 and the span generation unit 704.

(Step 1) The initial value of the increment algorithm is point P0 (6, 0, 0, 0), which is the vertex of the polygon.

In the first edge generation unit 702a and the second edge generation unit 702b, the processing 220
1 and 2202 are performed. These are processes for adding the increment value given from the arithmetic unit 701.

At the same time, processing 2211 is performed in selection section 703. This is a process of cumulatively adding E given from the arithmetic unit 701. Process 220
After the completion of 1, 2202, and 2211, the selection unit 703 selects data from the value of the accumulated error E (sum (E) in the figure). Here, since it is less than 1, (x, y, u, v) output from the first edge generation unit 702a is selected. That is, (4.00,1.00, -0.84,4.21) is selected (2221
Selection of). This is the increment calculation of 805a shown in FIG.

(Step 2) Next, the first edge generation unit 702
a and the second edge generation unit 702b perform processes 2203 and 2204, respectively. In the selection unit 703, the data (4.00,1.00, -0.84,4.21) previously selected
Is incremented in the same manner as above.

At the same time, a process 2412 for cumulatively adding E given from the operation unit 701 in the selection unit 703.
Perform After the processes 2403, 2404, and 2412 are completed, the selection unit 703 determines the accumulated error E (sum (E) in the figure).
Data is selected from the values of. Here, since it is one or more, the output is provided from the second edge generation unit 702b.
(x, y, u, v) is selected (selection of 2222). That is,
(3.00,2.00,0.00,8.00). This is the increment calculation of 805b shown in FIG. Here, since the accumulated error E has exceeded 1, the process of subtracting 1 from this is performed simultaneously (error correction).

(Step 3) Next, the first edge generation unit 7
02a and the second edge generation unit 702b perform processes 2205 and 2206, respectively. Selector 70
In step 3, the previously selected data (3.00,2.00,0.00,8.
00), the increment value is added in the same manner as above.

At the same time, a process 2413 in which the selection unit 703 cumulatively adds E given from the calculation unit 701.
Perform After the processes 2405, 2406, and 2413 are completed, the selection unit 703 determines the accumulated error E (sum (E) in the figure).
Data is selected from the values of. Here, since it is less than one, it is output from the first edge generation unit 702a.
(x, y, u, v) is selected (selection of 2223). That is,
Select (1.00,3.00, -0.84,12.21). This is shown in FIG.
This is the increment calculation of 805c shown in FIG.

(Step 4) Further, the first edge generation unit 70
Processing 2207 and 2208 are performed in 2a and the second edge generation unit 702b, respectively. Selector 703
In the data selected earlier (1.00, 3.00, -0.84, 12.
For 21), add the increment value as before.

At the same time, a process 2414 for accumulating and adding E given from the operation unit 701 in the selection unit 703.
Perform After the processes 2407, 2408, and 2414 are completed, the selection unit 703 determines the cumulative error E (sum (E) in the figure).
Data is selected from the values of. Here, since it is one or more, the output is provided from the second edge generation unit 702b.
(x, y, u, v) is selected (selection of 2224). That is,
(0.00, 4.00, 0.00, 16.00). This is the increment calculation of 805d shown in FIG.

By executing the processing from (step 0) to (step 4) as described above, corrected screen coordinate values and texture coordinate values can be obtained for the edge drawing points of polygon edges. That is, it is possible to calculate the drawing point and the corresponding point regarding the ideal polygon edge.

Also, the first edge generation unit 702a, the second
The configuration example of the edge generation unit 702b and the selection unit 703 will be described.

FIG. 22 is a configuration diagram of the first edge generation unit 702a. Here, output from the arithmetic unit 701
(x, y, u, v) is an integer. That is, it is assumed that the vertex coordinates of the target polygon and texture are integers. The selectors 2301a to 2301d receive the data (x, y, u, v) output from the arithmetic unit 701 or the adder 2302a
To select the data (x, y, u, v) output from 2302d. Selectors 2301a, 2301b, 2301c,
2301d is a selector for selecting x, y, u, and v, respectively. When these selectors calculate the first edge point, they are output from the calculation unit 701 (x, y, u,
v) is selected, otherwise, the data (x, y, u, v) output from the adders 2302a to 2302d is selected.

The adder 2302a performs an increment process on x, and sets the incremented value to x output from the selector 703 and the increment value to dx / dy (L) (see (Equation 51)). Similarly, the adder 2302b performs an increment process on y, and outputs the incremented value from the selection unit 703.
y, the increment value is 1. The adder 2302c performs an increment process on u, and outputs u as the incremented value from the selection unit 703 and du / dy (L) (see (Equation 51)).
And The adder 2302d performs an increment process on v, and sets the increment value to v output from the selection unit 703 and the increment value to dv / dy (L) (see (Equation 51)). These increment values do not change until the processing for one edge is completed.

As a result, the processing 2201 described earlier,
The first edge generation unit 702a that executes 2203, 2205, and 2207 can be realized. The processing content of the second edge generation unit 702b is the same as that of the first edge generation unit 702a. Therefore, it can be realized by the same configuration, and the description is omitted here.

FIG. 23 is a part of a configuration diagram of the selection unit 703. In FIG. 23, reference numeral 2401 denotes an adder. An initial value is a difference (E) between a drawing point calculated by an increment algorithm and a sample point of a screen pixel. It is a mechanism for accumulative addition (cumulative error is sum (E)).
This error E does not change until the processing for one edge is completed. Selectors 2402a through 242
02d receives the result of the accumulated error calculated by the adder 2401, and selects the output value of the first edge generator 702a or the output value of the second edge generator 702b.
The selector 2402c is a selector 2402c for x.
Is a selector for u, and a selector 2402d is a selector for v. Regarding the value of y, the first edge generation unit 702a
Is the same as the output value from the second edge generation unit 702b, there is no selector for y.

When the adder 2401 is an adder that performs cumulative addition up to a value less than 1, by detecting whether or not the addition result overflows,
From (Equation 47) to (Equation 50), the processing contents described above ((ste
From (p0) to (step 4)), the processes 2221 to 2224 shown in FIG. 21 can be realized. That is, when the addition result of the adder 2401 overflows, the second
The output value (x, y, u, v) of the edge generation unit 702b is selected. If no overflow occurs, the output value (x, y, u, v) of the first edge generation unit 702a is selected.

FIG. 24 shows an outline of the processing of these operations. FIG. 25 illustrates a triangular polygon to be mapped by the processing of FIG. 24 (target polygon). In FIG. 25, it is assumed that (ix, iy, iu, iv) of a vertex is represented by an integer, and the vertex coordinates and the corresponding point coordinates satisfy the condition of (Expression 52).

[0257]

FIG. 24 shows an outline of the processing, and each processing will be described in comparison with the components in the fourth embodiment.
Processing 1301 is processing in the arithmetic unit 701. 1302
Is the drawing point (x, y) in the span generation unit 704, and the corresponding point
This is the output processing of (u, v). 1303 is the span generation unit 7
This is a process of calculating drawing points and corresponding points in the span direction in 04 (see (Equation 7)). Reference numeral 1304 denotes an end condition of the process 1303, which is a process end condition in the span generation unit 704. 1305 is a first edge generation unit 702a and a second edge generation unit 702a.
The processing is common to the edge generation unit 702b, and is processing for calculating an edge drawing point (see (Equation 4)) and processing for calculating a numerical value serving as a selection criterion in 1306. The numerical value serving as the selection criterion is E shown in (Equation 46). Reference numeral 1306 denotes a selection process in the selection unit 703.
dy (L) and du / dy (R) are selected. Reference numeral 1307 denotes a corresponding point calculation process in the first edge generation unit 702a. Reference numeral 1308 denotes a corresponding point calculation process in the second edge generation unit 702b. Reference numeral 1309 denotes an end condition of the entire process, whereby the process of the present apparatus ends.

As described above, by performing the processing of calculating the corresponding points and the drawing points on the polygon shown in FIG. 25 by the processing shown in FIG. 24, accurate calculation of the corresponding points can be realized.

That is, it is possible to select du / dy (L) for 805a and 805c and to select du / dy (R) for 805b and 805d as the parameters used for calculating the corresponding points. The selection of the increment for the corresponding point u as described above is performed by the selection unit 703. Although the corresponding point u has been described here, the same can be said for the corresponding point v, illuminance, opacity, and the like.

That is, by selecting the corresponding point generated by the first edge generating section 702a or the second edge generating section 702b by the selecting section 703 ((Equation 4)
7) to (Equation 50)), it is possible to calculate an ideal corresponding point in a pixel where a polygon edge exists. Furthermore, by ideally calculating the corresponding point of the pixel where the polygon edge which is the leading pixel of the span exists, the corresponding point of the pixel included in this span can also be ideally calculated (see (Expression 7)). ).

As described above, according to the present embodiment, the first
Edge generation unit 702a, second edge generation unit 702b
Selecting section 703 for selecting parameters generated in
Is provided, it is possible to obtain an ideal corresponding point for the drawing pixel. Thereby, Embodiment 1,
As in 2 and 3, ideal corresponding points can be calculated for all pixels on which the polygon is projected, and the image quality of the mapping image can be improved.

In each edge generating section, only the same processing load as in the conventional incremental algorithm is applied. The calculation of the parameter (incremental value) used in each edge raw correction can be performed in advance for the edge of the polygon, and does not significantly increase the load on these calculations.

In this embodiment, it is necessary to provide two edge generators. However, as compared with the conventional method, only a delay occurs in selecting each generated parameter, and the speed of the entire process is not impaired.

In the present embodiment, the first edge generator 702a and the second edge generator 702b are operated simultaneously. However, by executing the cumulative error calculation of the selection unit 703 in advance, it is possible to stop the operation of one of the edge generation units.
This will be described with reference to the flowchart of FIG. After the processing of the accumulative error meter 2211 is completed, it is possible to recognize which edge generating unit data is to be selected. Here, the result of step 2201 is selected.
There is no problem in stopping the processing (processing circuit) of the second edge generation unit 702b that performs the second step. That is, it may be possible to execute the cumulative error calculation of the selection unit 703 in advance and stop the operation of one of the edge generation units. Thereby, the power consumption of the entire apparatus can be suppressed.

In this embodiment, the sample point in the pixel is the point closest to the origin in the pixel, but the position of the sample point is arbitrary.

In the present embodiment, the relationship between the polygon and the texture is (Equation 1) and (Equation 2), but the relationship is not limited to (Equation 1) and (Equation 2). For example, even if this relation is expressed by (Equation 17) and (Equation 18), accurate corresponding point calculation can be performed. In other words, it can correspond to any corresponding point expression.

In the present embodiment, the calculation of the corresponding points of the polygon has been described.
Similar processing can be realized for bump mapping calculation and the like. In addition, as with the corresponding points, these can also correspond to any relational expressions. FIG.
0 and FIG. 11 show examples of the overall configuration of the case where texture mapping and illuminance mapping are realized.

In the figure, 1701 and 1801 can realize texture mapping and illuminance mapping by using those described in the present embodiment. Opacity mapping, bump mapping, and the like can be realized with a similar configuration. The description of these configuration diagrams has been made in the first embodiment, and will not be repeated here. In the present embodiment, the description has been given of a method in which the anti-aliasing processing is not performed. However, the same processing can be performed including the anti-aliasing processing.

Note that the same correction processing as in the present embodiment can be performed even when sub-pixel positioning is performed.

(Embodiment 5) Hereinafter, a fifth embodiment of the present invention will be described with reference to the drawings.

FIG. 26 is a diagram showing the configuration of the address generator of the mapping apparatus according to the fifth embodiment of the present invention. In FIG. 26, those having the same reference numerals as those in FIG.
The same as 8 is shown. The edge generation unit 2502 calculates the screen coordinate value at the polygon edge and the texture coordinate value corresponding to the screen coordinate value by performing an increment calculation using the designated increment value using the data generated by the calculation unit 701. The increment switching unit 2503 is
01, the increment value in the edge generation unit 2502 is specified. The polygons to be mapped here are the same as in the fourth embodiment (FIG. 19), and the corresponding points are (Equation 1) and (Equation 2).
It is assumed that the following relationship holds.

A description will now be given of the texture mapping processing in this embodiment. The calculation unit 701 calculates necessary parameters in the same manner as in the fourth embodiment (Equation 42), (Equation 43), (Equation 44), and (Equation 45)
reference). Specifically, it takes the value shown in (Equation 51).

The edge generation unit 2502 receives signals dx / dy (L), du / dy (L), and dx / dy (L) from the increment switching unit 2503 shown in FIG.
v / dy (L), dx / dy (R), du / dy (R),
The increment value of dv / dy (R) is switched, and an increment process (DDA process) is performed according to the selected increment value.

The incremental switching section 2503 cumulatively adds E ((Equation 46), (Equation 51)) described in the fourth embodiment, and controls switching using the result. That is, the increment value used in the edge generation unit 2502 is switched. The switching process performed by the incremental switching unit 2503 is similar to the selection process of the selection unit 703 described in the fourth embodiment. Specifically, when the cumulative error (sum (E)) is less than 1, the increment value used in the edge generation unit 2502 is dx / dy
(L), du / dy (L), and dv / dy (L).
When the accumulated error is 1 or more, the edge generation unit 2502
The increment values used in are dx / dy (R), du / dy (R),
dv / dy (R). Further, when the accumulated error is 1 or more, a process of subtracting 1 from the accumulated error (sum (E)) is also performed.

Here, the flow of processing of the edge generation unit 2502 and the increment switching unit 2503 in this embodiment will be described (the target polygon is shown in FIG. 19). FIG. 27 shows the flow of these processes, and the processes will be described below. In FIG. 27, processes 2601, 2602, and 26
03 and 2604 are processing performed by the edge generation unit 2502. Processing 2611, 2612, 2613, 2614
Is a process performed by the incremental switching unit 2503. The shaded portions in FIG. 27 are increment values (screen coordinates, texture coordinates) controlled by the increment switching unit 2503 and used by the edge generation unit 2502. Also, what is indicated by the underline is output data (x, y, u, v) from the edge generation unit 2502.

(Step0) The point P0 (6,0,0,
0) is an initial value in the subsequent processing.

The initial value of the accumulated error sum (E) is 0
It is. This (6,0,0,0) is the output value from the edge generator 2502.

(Step 1) In the incremental switching unit 2503, the error E
Are cumulatively added (step 2611). Since the cumulative error here is less than 1, the edge generation unit 2502 is requested to use the increment value of (L) via next_inc_ident shown in FIG.

[0279] Upon receiving this, the edge generation unit 2502 sets (s
(L) increment value (-2.00, tep0)
1.00, -0.84, 4.21), and outputs the addition result (process 2601). Therefore, (4.00,1.00, -0.84,4.21) is output. This is the increment calculation of 805a shown in FIG.

(Step 2) Next, in the increment switching unit 2503, the cumulative error calculation result exceeds 1 (process 2612).
Therefore, it requests the edge generation unit 2502 to use the increment value of (R) via next_inc_ident shown in FIG.

The edge generation unit 2502 receiving this outputs the (s
tep1), the (R) increment value (-1.00,1.00,0.84,
3.79) and outputs the addition result (Process 260
2). Therefore, (3.00,2.00,0.00,8.00) is output. This is the increment calculation of 805b shown in FIG.

Further, since the cumulative error has exceeded 1, the increment switching section 2503 performs a process of subtracting 1 from the cumulative error.

(Step 3) In addition, the increment switching unit 2503
The error E is cumulatively added (step 2613). Since the cumulative error here is less than 1, the edge generation unit 2502 is requested to use the increment value of (L) via next_inc_ident shown in FIG.

[0284] Upon receiving this, the edge generation unit 2502 sets (s
tep2), (L) increment value (-2.00,1.00, -0.8
4,4.21) and outputs the addition result (Process 260
3). Therefore, (1.00,3.00, -0.84,12.21) is output. This is the increment calculation of 805c shown in FIG.

(Step 4) Further, in the increment switching unit 2503, the cumulative error calculation result exceeds 1 (processing 261).
4). Therefore, the edge generation unit 2502 is
It is requested to use the increment value of (R) via next_inc_ident indicated by 6.

The edge generation unit 2502 receiving this outputs
tep3), the (R) increment value (-1.00,1.00,0.84,
3.79) and outputs the addition result (process 261).
4). Therefore, (0.00, 4.00, 0.00, 16.00) is output. This is the increment calculation of 805d shown in FIG.

In addition, since the accumulated error has exceeded 1, the increment switching unit 2503 performs a process of subtracting 1 from the accumulated error.

As described above, by executing the processing from (step 0) to (step 4), ideal polygon coordinates and texture coordinates can be obtained for polygon edges.

Next, a configuration example of the edge generation section 2502 and the increment switching section 2503 will be described.

FIG. 28 is a configuration diagram of the edge generation unit 2502. Selectors 2701a, 2721c and 270
1d is controlled by next_inc_ident shown in FIG. The edge generator 250
Increment value (incremental value of (L) or (R) used in 2)
Is changed.

Adders 2702a, 2702b, 2702
Increment processing is performed by c and 2702d. At this time, the increment value selected by the selectors 2701a, 2721c, 2701d is used. In addition, a value output from the edge generation unit 2502 is used as the increment value. In FIG. 28, the value output from the edge generation unit is fed back and input to these adders 2702a to 2702d. Thereby, processing 2601, 2602, 2
603 and 2604 are realized.

Selectors 2703a, 2703b, 270
In 3c and 2703d, when calculating the first edge point, (x, y, u, v) output from the arithmetic unit 701
Is selected, otherwise, the data (x, y, u, v) output from the adders 2702a to 2702d is selected. This makes it possible to sequentially calculate (x, y, u, v) from the initial value of the target polygon edge.

FIG. 29 is a block diagram of the incremental switching unit 2503. In FIG. 29, an adder 2801 accumulates an error E (Equation 51) with respect to x for each scan line by setting an initial value as a difference (E) between a drawing point calculated by an increment algorithm and a sample point of a screen pixel. It is a mechanism for adding (accumulated error is sum (E)).

The index for controlling the increment value in the edge generation unit 2502 and for switching the increment value in the increment switching unit 2503 is based on whether the accumulated error (sum (E)) exceeds 1, and when it exceeds 1, Thereafter, a process of subtracting 1 is performed. That is, the increment switching unit 2503 is configured by a cumulative adder up to a value less than 1, and determines whether or not the cumulative addition result overflows. Thus, the processes 2611, 2612, 2613, and 2614 are realized.

Therefore, the edge generation unit 2 shown here
502, the configuration of the incremental switching unit 2503 (see (FIG. 28) and (FIG. 29)) changes the above-described processing (from (step0) to (step
4)) can be realized.

As described above, according to the present embodiment, the increment switching unit 2503 calculates the difference (error) between the x value of the screen coordinate value and the sample point of the screen pixel by the calculation unit 701. This is realized by performing cumulative addition (sum (E)) on the calculated values. Also, from the value of the accumulated error, specifically, it is only necessary to determine whether or not the accumulated addition result overflows. In order to calculate the screen coordinate value and the texture coordinate value of the polygon edge depending on whether or not it overflows. Increment value ((L) increment value,
(R) is controlled so as to be used in the increment calculation in the edge generation unit 2502.

The edge generation section 2502 performs an increment calculation using the increment value designated by the increment switching section 2503. Here, the screen coordinate value and the texture coordinate value of the point representing the polygon to be obtained are ideal values for the screen pixels.

That is, by providing the edge generating unit 2502 and the increment switching unit 2503, it is possible to obtain ideal screen coordinate values and texture coordinate values for the drawing pixels. This makes it possible to calculate ideal corresponding points for all pixels included in the polygon, as in the previous embodiment, and improve the image quality of the mapped image.

The circuit scale of the edge generation unit 2502 is not increased dramatically only by increasing the number of selectors by the number of increment values. Further, the processing speed is in a negligible range. Therefore, it has the same processing capacity as the conventional incremental algorithm.

As can be seen from the configuration diagram of FIG. 29, the circuit size of the incremental switching unit 2503 is simple and the circuit size is small.

Therefore, the configuration of this embodiment of the present invention has the same processing speed as the conventional incremental algorithm regardless of the processing capacity and circuit scale, and furthermore, performs ideal corresponding point calculation. Is what you can do.

In the present embodiment, the sample point in the pixel is the point closest to the origin in the pixel, but the position of this sample point is arbitrary.

In the present embodiment, the relationship between the polygon and the texture is (Equation 1) and (Equation 2), but the relationship is not limited to (Equation 1) and (Equation 2). For example, even if this relation is expressed by (Equation 17) and (Equation 18), accurate corresponding point calculation can be performed. In other words, it can correspond to any corresponding point expression.

In this embodiment, the calculation of the corresponding points of the polygon has been described. However, as described in the first embodiment, the same processing is realized for the illuminance calculation, the opacity calculation, the bump mapping calculation, and the like. (See FIGS. 10 and 11). Also, opacity mapping, bump mapping, and the like can be realized with a similar configuration.

Although the present embodiment has been described with respect to a method in which anti-aliasing processing is not performed, similar processing can be performed including anti-aliasing processing.

[0306] Even when sub-pixel positioning is performed, the same correction processing as that of the present embodiment can be performed.

Embodiment 6 Hereinafter, a sixth embodiment of the present invention will be described with reference to the drawings.

FIG. 30 is a diagram showing the configuration of the address generator of the mapping apparatus according to the sixth embodiment of the present invention. In FIG. 30, those having the same reference numerals as in FIG.
The same as 8 is shown. The calculation unit 2901 calculates a drawing point inside the polygon and a parameter used for calculating the corresponding point from the position of the polygon vertex and the corresponding point given to the polygon vertex. The edge generation unit 2902 performs an incremental calculation using the parameters generated by the calculation unit 2901 and the data corrected by the correction unit 2903 to calculate screen coordinate values at polygon edges and corresponding texture coordinate values. I do. The correction unit 2903 performs a correction process on the corresponding point generated by the edge generation unit 2902 using the parameters generated by the calculation unit 2901 and the drawing points generated by the edge generation unit 2902. Further, it is assumed that the polygon to be mapped is the same as in the fourth embodiment (FIG. 19), and the relation of (Equation 1) and (Equation 2) holds for the corresponding points.

[0309] At this time, the texture mapping processing according to the present embodiment will be described. The arithmetic unit 2901 is different from the fourth and fifth embodiments in that it calculates only the increment of (L) (Equation 42), (Equation 44), and (Equation 4).
5)). Specifically, dx / d shown in (Equation 51)
Calculate y (L), du / dy (L), and dv / dy (L). Further, the difference (E) (Equation 46) between the drawing point and the sample point, which is necessary for determining whether or not to perform the correction process in the correction unit 2903, is calculated.

[0310] The edge generation section 2902 is provided with an operation section 2901.
(X, y, u, v) given as an initial value, and thereafter output from the correction unit 2903 following the edge generation unit 2902 (x, y, u, v).
y, u, v) with respect to dx / dy calculated by the arithmetic unit 2901
(L), du / dy (L), and dv / dy (L) are used as increment values to perform an increment process (DDA process).

The correcting section 2903 is provided with an edge generating section 2902
(X, y, u, v) data output from. The correction is required when the cumulative error (sum (E)) as a result of the cumulative addition of the difference (E) between the drawing point and the sample point calculated by the arithmetic unit 2901 is 1 or more. By performing correction processing each time correction is required, the x value before correction and the x coordinate value of the sample point always have a difference of one pixel. After performing the correction processing, 1 is subtracted from the accumulated error. The correction process here is performed as follows.
That is, if the correction processing of (Expression 53) is performed on the calculated (x, y, u, v), ideal screen coordinate values and texture coordinate values can be calculated. u, v) values are output from the correction unit 2903.

[0312]

X ← x + 1 y ← yu ← u + ∂u / ∂xv ← v + ∂v / ∂x These processes will be described with reference to the polygon shown in FIG. 19 as an example. FIG. 31 is a diagram showing the target polygon shown in FIG.
9 shows the transition of the increment processing and the correction processing. The same components as those in FIG. 19 are denoted by the same reference numerals. 805
Arrows indicated by a, 3005b, 805c, and 3005d are:
This is a transition of the sample point by the increment processing performed by the edge generation unit 2902. Arrows indicated by 3001 and 3002 indicate transitions of sample points due to the correction processing performed by the correction unit 2903.

Regarding the calculation of the screen coordinate values and the texture coordinate values, the target polygon is shown in FIG.
1, the edge generation unit 2902 and the correction unit 29
FIG. 32 shows the specific processing at 03. In FIG. 32, processes 3101, 3102, 3103 and 3104
Represents an incremental process performed by the edge generation unit 2902. Processes 3111, 3112, 3113, and 3114 are processes for determining whether or not to perform the correction process in the correction unit 2903, and calculate the accumulated error described above. Processing 31
Reference numerals 22 and 3124 denote correction processing performed by the correction unit 2903.

This processing will be described in order along the polygon edge 801.

(Step0) The point P0 (6,0,0,
0) is an initial value in the subsequent processing. The initial value of the accumulated error sum (E) is 0. This (6,0,0,0) is the output value from the edge generator 2902.

(Step 1) The edge generation unit 2902 calculates (step 0)
Of the result (initial value), the increment value (-2.00,1.00, -0.84,
(4.00, 1.00, -0.84, 4.21), which is the result of adding (4.21), is output to the correction unit 2903 (process 3101).

The correcting section 2903 cumulatively adds the error E (step 3111). Here, since the result of the accumulated error is less than 1, no correction processing is performed.

That is, the output from the correction unit 2903 is
(4.00,1.00, -0.84,4.21).

(Step 2) Next, the edge generation unit 2902
This is the result of adding the increment value (-2.00,1.00, -0.84,4.21) to the result (4.00,1.00, -0.84,4.21) of (step1) (2.0
0,2.00, -1.68,8.42) is output to the correction unit 2903 (process 3102).

The correcting section 2903 cumulatively adds the error E (process 3112). Here, since the result of the accumulated error is 1 or more, a correction process is performed. The correction process is performed by inputting (2.00,2.00, -1.68,8.42) to (1.00,0,00, ∂u / ∂x, ∂
This is realized by adding (v / 1.00x) = (1.00, 0.00, 1.68, -0.42) (process 3122). (3.00, 2.
00,0.00,8.00), which is the output value. After this processing, a value obtained by subtracting 1 from the accumulated error in the correction unit 2903 is set as the accumulated error.

(Step 3) The edge generation unit 2902 calculates the (step 2)
(3.00,2.00,0.00,8.00), the increment value (-2.00,
1.00, -0.84,4.21) is added (1.00,3.00, -0.
84, 12.21) to the correction unit 2903 (process 310).
3).

The correcting section 2903 cumulatively adds the error E (step 3113). Here, since the result of the accumulated error is less than 1, no correction processing is performed.

That is, the output from the correction unit 2903 is
(1.00,3.00, -0.84,12.21).

(Step 4) Further, the edge generation unit 2902
Is the result of (step3) (1.00,3.00, -0.84,12.21)
This is the result of adding the increment values (-2.00,1.00, -0.84,4.21)
(−1.00, 4.00, −1.68, 16.42) is output to the correction unit 2903 (process 3104).

The correcting section 2903 cumulatively adds the error E (process 3114). Here, since the result of the accumulated error is 1 or more, a correction process is performed. Correction processing is performed on the input (-1.00, 4.00, -1.68, 16.42) in the same way as (step2) with (1.00,
(0.003, 1.68, -0.42) is added (process 3124). (0.00, 4.00, 0.00, 16.00) can be obtained as a correction result, and this is an output value. After this processing, a value obtained by subtracting 1 from the accumulated error in the correction unit 2903 is set as the accumulated error.

By executing the processing from (step 0) to (step 4) as described above, ideal screen coordinate values and texture coordinate values can be obtained for polygon edges.

Next, the edge generation unit 2902 and the correction unit 29
The configuration example of No. 03 will be described.

FIG. 33 is a configuration diagram of the edge generation unit 2902. In FIG. 33, 3201a, 3201b, 3
201c and 3201d are adders for performing an increment process. Each of the adders sequentially performs addition on x, y, u, and v. Thereby, the process 310
1 to 3104 can be implemented.
Also, 3202a, 3202b, 3202c and 32
02d is a selector. To calculate the first edge point of the polygon edge, select (x, y, u, v) output from the calculation unit 2901; otherwise, select the correction unit 2
(X, y, u, v) from 903 was incremented (x, y, u, v)
Select (y, u, v). This makes it possible to sequentially calculate (x, y, u, v) from the initial value of the target polygon edge.

FIG. 34 is a configuration diagram of the correction unit 2903. In FIG. 34, 3301a, 3301c and 3301
Reference numeral 301d denotes an adder, which implements the correction processing shown in (Equation 53). An adder 3302 performs cumulative addition of the difference (E) between the drawing point calculated by the calculation unit 2901 and calculated by the incremental algorithm and the sample point of the screen pixel. Based on the result of the adder 3302, it is determined whether to output data of the correction processing or output data that is not corrected. Here, the adder 3302
Instead of being determined by the value of the addition result in (1), the range of the adder is set to less than 1, and the data of the correction processing is output or the data not corrected is output depending on whether the addition result overflows or not. You can also decide what to do. Also, 3303a, 3303
c and 3303d are selectors, and when the adder 3302 overflows, correction data, that is, adder 330
A selector that outputs the output values from 1a, 3301c, and 3301d and outputs uncorrected data if the adder 3302 does not overflow.

Therefore, the edge generation unit 2 shown here
902, the configuration of the correction unit 2903 (FIG. 28), (FIG.
9)), the above processing (from (step0) to (step
4)) can be realized.

As described above, according to the present embodiment, the provision of the edge generation unit 2902 and the correction unit 2903 makes it possible to obtain ideal screen coordinate values and texture coordinate values for pixels to be drawn. Becomes This makes it possible to calculate ideal corresponding points for all the pixels included in the polygon, as in the previous embodiment, and improve the image quality of the texture mapping image.

The edge generation unit 2902 has the same circuit scale as that of the conventional incremental calculation.
It has the same processing power as the conventional incremental algorithm.

As can be seen from the configuration diagram of FIG. 34, the circuit size of the correction section 2903 is extremely simple, and does not increase the circuit size.

Therefore, according to the present invention, an ideal corresponding point can be calculated without increasing the circuit scale and without decreasing the processing capability. In the present embodiment, the sample point in the pixel is the point closest to the origin in the pixel, but the position of this sample point is arbitrary.

In the present embodiment, the relationship between the polygon and the texture is (Equation 1) and (Equation 2), but the relationship is not limited to (Equation 1) and (Equation 2). For example, even if this relation is expressed by (Equation 17) and (Equation 18), accurate corresponding point calculation can be performed. In other words, it can correspond to any corresponding point expression.

In the present embodiment, the calculation of the corresponding point of the polygon has been described.
Similar processing can be realized for bump mapping calculation and the like (see FIGS. 10 and 11). Also, opacity mapping, bump mapping, and the like can be realized with a similar configuration.

Although the present embodiment has been described with respect to a method in which anti-aliasing processing is not performed, similar processing can be performed including anti-aliasing processing.

Note that the same correction processing as in the present embodiment can be performed even when sub-pixel positioning is performed.

Embodiment 7 Hereinafter, a seventh embodiment of the present invention will be described with reference to the drawings.

FIG. 35 is a configuration diagram of a texture mapping device according to the seventh embodiment of the present invention. 35, the components having the same reference numerals as those in FIG. 30 indicate the same components as those in FIG.

Reference numeral 3404 denotes a value calculated by the calculation unit 2901.
E, ∂u / ∂x, ∂v / ∂x are input, and correction processing of the corresponding points at the drawing points calculated by the edge generation unit 2902, and span generation for calculating the screen coordinates and texture coordinates of the span points inside the polygon. Department.

At this time, the texture mapping processing in the present embodiment will be described. In the present embodiment, by providing the span generation unit 3404 that simultaneously realizes the processing in the correction processing unit 2902 and the processing in the span generation unit 704 in the sixth embodiment, the screen coordinates and the texture inside the ideal polygon are provided. Calculate the coordinates. The outline of the operation is the same as that of the sixth embodiment, and the edge generation unit 2902 performs an incremental process.
The correction processing shown in (Equation 53) is performed. It is a feature of the seventh embodiment that the correction processing is performed by the span generation unit 3404. The span generation unit 3404 can perform the correction processing and the span processing because the correction processing of (Equation 53) is the same as the processing (Equation 7) in the span generation.

[0343] The span generation unit 34 for realizing this.
FIG. 36 shows a configuration diagram of No. 04. In FIG. 35, the processing performed by the processing (Equation 53) performed by the correction unit 2903 in FIG. 30 is performed by the span generation unit 3403. In this case, this can be realized by adding a cumulative addition process of E for determining whether to execute the correction process to the span generation unit. FIG. 36 shows an example of such a configuration.

In FIG. 36, the correction unit 2 shown in FIG.
The same reference numerals are given to the same components as those in the configuration diagram 903. At this time, the adders 3301a and 3301
As described above, c and 3301d are used for the correction processing.
Here, by inputting the operation trigger signal for the correction processing and the span processing signal to this adder, the correction processing and the span processing can be realized by one circuit. That is, the span generation unit 3404 enables the correction process and the span process. The buffer 350
Reference numerals 1a, 3501b, 3501c, and 3501d are output buffers with enable.

Data before the correction processing (output from the adder 3301 before the correction processing trigger is input) is not a span value.
This is to prevent the output from the 04.

By realizing the correction processing and the span processing with a common circuit, the circuit scale can be reduced.

[0347]

As described above, according to the present invention, the corresponding point on the mapping image is corrected by using the difference between the drawing point obtained by the incremental algorithm and the sample point of each pixel. High quality images can be generated. In addition, a high-quality image is generated by distributing pixel values determined using drawing points obtained by an incremental algorithm to a plurality of pixel values based on a relative positional relationship between drawing points and pixels. Can be. Further, the present invention can be applied not only to a mapping device but also to general rendering processing for generating a computer image, and similar effects can be obtained.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a mapping device of the present invention.

FIG. 2 is a configuration diagram of a rendering processor of the mapping device of the present invention.

FIG. 3 is a configuration diagram of an edge generation unit of the mapping device of the present invention.

FIG. 4 is a configuration diagram of a correction unit of the mapping device of the present invention.

FIG. 5 is a configuration diagram of a span generation unit of the mapping device of the present invention.

FIG. 6 is a diagram illustrating displacement of a texture due to a quantization error at a value x.

FIG. 7 is a configuration diagram of an address generation unit of the mapping device according to the first embodiment of the present invention.

FIG. 8 is an explanatory diagram of a parameter correction process according to the first embodiment of the present invention.

FIG. 9 is a configuration diagram of a correction unit 103a according to the first embodiment.

FIG. 10 is a configuration diagram of a texture mapping device of the present invention.

FIG. 11 is a configuration diagram of an illuminance mapping device of the present invention.

FIG. 12 is an explanatory diagram of a parameter correction process according to the second embodiment of the present invention.

FIG. 13 is a configuration diagram of a correction unit 103a according to the second embodiment.

FIG. 14 is a configuration diagram of a mapping device according to a third embodiment of the present invention.

FIG. 15 is an explanatory diagram of a pixel correction process according to the third embodiment of the present invention.

FIG. 16 is an enlarged view of a shared area according to the third embodiment.

FIG. 17 shows a generated image storage unit 5 according to the third embodiment.
It is a block diagram of 05.

FIG. 18 is a configuration diagram of an address generation unit of a mapping device according to a fourth embodiment of the present invention.

FIG. 19 is an explanatory diagram of a parameter correction process according to the fourth embodiment of the present invention.

FIG. 20 is an explanatory diagram of a parameter correction process according to the fourth embodiment of the present invention.

FIG. 21 is an explanatory diagram of a processing outline in a first edge generation unit 702a, a second edge generation unit 702b, and a selection unit 703.

FIG. 22 is a configuration diagram of a first edge generation unit 702a.

FIG. 23 is a configuration diagram of a selection unit 703.

FIG. 24 is a flowchart illustrating an outline of processing according to a fourth embodiment of the present invention.

FIG. 25 is a diagram of a target polygon according to the fourth embodiment of the present invention.

FIG. 26 is a configuration diagram of an address generation unit of a mapping device according to a fifth embodiment of the present invention.

FIG. 27 is an explanatory diagram illustrating a flow of a process according to the fifth embodiment of the present invention.

FIG. 28 is a configuration diagram of an edge generation unit 2502.

FIG. 29 is a configuration diagram of an incremental switching unit 2503.

FIG. 30 is a configuration diagram of an address generation unit of a mapping device according to a sixth embodiment of the present invention.

FIG. 31 is a diagram illustrating a polygon to be processed according to the sixth embodiment of the present invention and a transition of an increment process and a correction process.

FIG. 32 is a diagram illustrating a flow of a process according to the sixth embodiment of the present invention.

FIG. 33 is a configuration diagram of an edge generation unit 2502.

34 is a configuration diagram of a correction unit 2503. FIG.

FIG. 35 is a configuration diagram of an address generation unit of a mapping device according to a seventh embodiment of the present invention.

FIG. 36 is a configuration diagram of a span generation unit 3404.

FIG. 37 is a diagram showing polygons to be used in the description of the mapping processing by the incremental algorithm.

FIG. 38 is an explanatory diagram of a corresponding point calculation process of texture mapping by an incremental algorithm.

FIG. 39 is an explanatory diagram showing drawing points of pixels and sample points of ideal pixels by an incremental algorithm.

FIG. 40 is a diagram illustrating an example of image quality deterioration in a mapping process and an ideal image.

[Explanation of symbols]

Reference Signs List 101 calculation unit 102a edge generation unit 103a correction unit 104 span generation unit 201 pixel on screen 202 polygon edge 203 edge drawing point generated by edge generation unit 102a 204 sample point (X, Y) 205 of pixel 201 205 correction unit 103a (X ', y') 401 Pixels on the screen 402 Polygon edges 403 Edge drawing points generated by the edge generation unit 102a 404 Sample points (X, Y) 501 of the pixels 201 501 Calculation unit 502 Edge generation unit 503 Span generation unit 504 Original image storage unit 505 Generated image storage unit 506 Image storage processing unit 601a Screen pixel a 601b Screen pixel b 601c Screen pixel c 601d Screen pixel d 602 Polygon edge 603 Drawing point 604a Screen Sample point 605 texture pixels 606a texture pixel 605 sample points 604d screen pixel 601d of the sample point 604c screen pixel 601c of sample points 604b screen pixel 601b of over emission pixels 601a and screen pixel 60
1a shared portion Sa 606b texture pixel 605 and screen pixel 60
1b shared portion Sb 606c texture pixel 605 and screen pixel 60
1c shared part Sc 606d texture pixel 605 and screen pixel 60
1d shared unit Sd 701 operation unit 702a first edge generation unit 702b first edge generation unit 703 selection unit 704 span generation unit 801 polygon edge 802a drawing point P0 802b drawing point P1 802c drawing point P2 802d drawing point P3 802e Drawing point P4 803a Screen pixel 803b Screen pixel 803c Screen pixel 803d Screen pixel 803e Screen pixel 804a Sample point of pixel 803a 804b Sample point of pixel 803b 804c Sample point of pixel 803c 804d Sample point of pixel 803d Sample point of pixel 803e 803e From the sample point of 803a to the pixel 803b
805b from the sample point of pixel 803b to pixel 803c
805c from the sample point of pixel 803c to pixel 803d
805d from the sample point of pixel 803d to pixel 803e
To the sample point 901 Left sample point 902 Right sample point 903 Change from sample point 804a to sample point 901 904 Change from sample point 804a to sample point 902 1001 Edge of polygon to be drawn 1002 Polygon edge point 1003 rendering pixel of polygon edge point 1002 1004 polygon edge point 1005 rendering pixel of polygon edge point 1004 1006 polygon span point 1007 rendering pixel of polygon span point 1006 1108 difference (L1) 1109 between polygon span point 1002 and ideal sample point Difference (L2) 1110 between polygon span point 1004 and ideal sample point 1110 Difference (L3) between polygon edge point 1006 and ideal sample point 1301 Calculation of differential value of y, partial differential value of x, etc. 1302 Output processing of drawing point (x, y) and corresponding point (u, v) (processing in span generating section 704) 1303 Calculation processing of drawing point and corresponding point in span direction (span generating section) 704) 1304 Processing 1303 end condition (span generation unit 70
1305) Edge drawing point calculation processing (edge generation unit 7)
02a and the edge generation unit 702b) Selection criterion value calculation processing of 1306 (processing in the selection unit 703) 1306 selection of du / dy (L) and du / dy (R) (processing in the selection unit 703) 1307 Corresponding point calculation processing (edge generation unit 702a) 1308 Corresponding point calculation processing (edge generation unit 702b) 1309 End condition of entire processing 1401 Vertex 0 (8, 0, 0, 0) 1402 Vertex 1 (0, 6, 0,16) 1403 Vertex 2 (11,9,16,16) 1404 Side 01 1405 Side 12 1406 Side 20 1601 First multiplier 1602 First adder 1603 Second multiplier 1604 Second adder 1701 Address generation unit 1702 Texture memory 1703 Frame memory 1801 Illumination calculation unit 1803 Frame memory 1901 Multiplier 1902 Adder 2101 Multiplier 2102 Multiplier 103 Multiplier 2104 Multiplier 2105 Multiplier 2106 Multiplier 2107 Multiplier 2108 Multiplier 2201 Processing performed in first edge generation section 702a 2202 Processing performed in second edge generation section 702b 2203 Performed in first edge generation section 702a Processing 2204 Processing performed by second edge generating section 702b 2205 Processing performed by first edge generating section 702a 2206 Processing performed by second edge generating section 702b 2207 Processing performed by first edge generating section 702a 2208 Second edge Processing performed by the generation unit 702b 2211 Processing performed by the selection unit 703 2212 Processing performed by the selection unit 703 2213 Processing performed by the selection unit 703 2214 Processing performed by the selection unit 703 2221 Selection processing performed by the selection unit 703 222 Performed by the selection unit 703 Selection processing 2223 selection processing performed by the selection unit 703 2224 selection processing performed by the selection unit 703 2301a x-value selector 2301by y-value selector 2301cu u-value selector 2301d v-value selector 2302a x-value adder 2302b y-value addition Unit 2302c u value adder 2302d v value adder 2401 cumulative adder 2402a x value selector 2402c u value selector 2402d v value selector 2502 edge generation unit 2503 increment switching unit 2601 processing performed by edge generation unit 2502 edge 2602 edge Processing performed by generation section 2502 2603 Processing performed by edge generation section 2502 2604 Processing performed by edge generation section 2502 2611 Processing performed by increment switching section 2503 2612 Processing performed by increment switching section 2503 261 Processing performed by increment switching section 2503 2614 Processing performed by increment switching section 2503 2701a Selector of increment value (dx / dy) 2701c Selector of increment value (du / dy) 2701d Selector of increment value (dv / dy) 2702a x Adder 2702by an adder that performs an increment process of y 2702c an adder that performs an increment process of u 2702dv An adder that performs an increment process of v 2703a An x-value selector 2703by A selector of a y value 2703c u A selector of a u value 2703d v Selector 2801 Cumulative adder 2901 Operation unit 2902 Edge generation unit 2903 Correction unit 3005b Transition of increment processing in edge generation unit 2902 3005d Transition of increment processing in edge generation unit 2902 3001 Transition of correction performed in correction processing 2903 3002 Transition of correction performed in correction processing 2903 3101 Processing in edge generation section 2902 3102 Processing in edge generation section 2902 3103 Processing in edge generation section 2902 3104 Processing in edge generation section 2902 3111 Processing performed in correction section 2903 3112 correction Processing performed by unit 2903 3113 Processing performed by correction unit 2903 3114 Processing performed by correction unit 2903 3122 Correction processing performed by correction unit 2903 3124 Correction processing performed by correction unit 2903 3201a Increase processing of adder 3201by that performs x processing Adder to be performed 3201c Adder to perform increment processing of cu 3201dV Adder to perform increment processing of v 3202a Selector of x value 3202b Selector of y value 3202c u Selector of u value 3202dv Selector of v value 3301a Adder 3301c for correction processing for x Adder for correction processing for c u 3301dv Adder for correction processing for v 3303a Non-correction / correction selector for x value 3303c Non-correction / correction selector for u value 3303d v Non-correction / correction selector 3404 Span generator 3501a Output buffer for x value 3501b Output buffer for y value 3501cu Output buffer for u value 3501d Output buffer for v value

Continuation of the front page (56) References JP-A-5-298455 (JP, A) JP-A-6-309472 (JP, A) JP-A-3-192483 (JP, A) JP-A-7-160906 (JP) JP-A-5-298456 (JP, A) JP-A-6-259571 (JP, A) JP-A-6-195471 (JP, A) JP-A-4-222074 (JP, A) 6-37939 (JP, U) (58) Fields investigated (Int. Cl. ⁷ , DB name) G06T 15/00-15/70 G06T 3/00-3/60 JICST file (JOIS)

Claims (23)

(57) [Claims] 1. A based on the corresponding point given to the position and the polygon vertices of the vertex of the projected polygon on a plane having a plurality of pixels, and a calculation unit for generating a parameter corresponding to said polygon, said An edge generation unit that determines a position of a first drawing point on an edge of the polygon and a position of a first corresponding point corresponding to the first drawing point, based on the parameter; A correction unit that determines a drawing pixel corresponding to the point, further determines a sample point corresponding to the drawing pixel, and corrects the position of the first corresponding point based on the sample point; And a span generation unit for determining the position of a second drawing point inside the polygon based on the second drawing point, and determining the position of a second corresponding point corresponding to the second drawing point. Wherein said correction unit, the mapping apparatus according to claim 1 for 1-dimensional correction with respect to said first drawing point. 3. The image processing apparatus according to claim 1, wherein the edge generating unit determines a point at which an edge of the polygon intersects an upper edge of the drawing pixel with a first point.
Of the drawing point, the correction unit, the mapping apparatus according to the closest point to the origin of the image drawing within the pixel to claim 1, wherein the sample point. 4. Set the bit precision representing the parameter to a predetermined value, said correction unit, the mapping apparatus according to claim 3 and a shifter and an adder. 5. An arithmetic unit for generating a parameter corresponding to a polygon based on a position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the polygon vertex; An edge generation unit that determines a position of a first drawing point on an edge of a polygon and a first corresponding point corresponding to the first drawing point based on the parameter; and the parameter and the first drawing And determining the position of a second drawing point, which is a point inside the polygon, based on the
A span generation unit that determines the position of a second corresponding point corresponding to the drawing point of the above; a generated image storage unit that stores values corresponding to each of the plurality of pixels on the plane; A pixel storage processing unit that stores a pixel value generated based on the position or the position of the second drawing point as a value corresponding to one pixel of the generated image storage unit or a plurality of adjacent pixels. Equipped mapping device. 6. The pixel storage processing unit according to claim 1 , wherein the area of the area on the plane defined by the position of the first drawing point or the second drawing point is one pixel on the plane or an adjacent pixel on the plane. An area ratio calculation unit that calculates a ratio of an area occupied by a plurality of pixels to an area, and a pixel value that distributes the generated pixel value to one pixel or a plurality of adjacent pixels on the plane based on the ratio. The mapping device according to claim 5 , further comprising a distribution unit. 7. When the position of the first drawing point or the second drawing point is (x, y), the area ratio calculation unit calculates (1-x) and (1-y). A first multiplier for multiplying, a second multiplier for multiplying x and (1-y), a third multiplier for multiplying (1-x) and y, and x and y A fourth multiplier that multiplies the output from the first multiplier by the generated pixel value; and a second multiplier that multiplies the output from the first multiplier by the generated pixel value. A sixth multiplier for multiplying an output from a multiplier and the generated pixel value, a seventh multiplier for multiplying an output from a third multiplier and the generated pixel value, 7. The mapping apparatus according to claim 6 , further comprising: an eighth multiplier for multiplying an output from the fourth multiplier and the generated pixel value. 8. The method according to claim 1, wherein a position (x, y) of the first drawing point or the second drawing point or a bit precision for expressing the generated pixel value is set to a predetermined value, and 8
The mapping device according to claim 7 , wherein each of the multipliers includes a shifter and an adder. 9. The edge generating section sets a point at which an edge of the polygon intersects with an upper edge of the corresponding pixel as the first drawing point, whereby the second multiplier and the fourth The mapping device according to claim 7 , wherein the multiplier, the sixth multiplier, and the eighth multiplier are omitted. 10. Based on a plurality of corresponding points given to the position and the polygon vertices of the polygon vertices projected on a plane including a pixel, a plurality of paths corresponding to the polygon
A first parameter and a second parameter
An arithmetic unit for generating a plurality of parameters <br/> over data including the parameter and the third parameter of, based on the first parameter, the second corresponding to the first drawing point on the edge of the polygon Position of the first candidate point and the first candidate point
A first edge generation section for determining a first corresponding point position corresponding to the candidate points, based on the second parameter, the second corresponding to the first drawing point on the polygon edges Of the candidate point of
A second edge generating unit that determines a position of a second corresponding point corresponding to the candidate point, and selecting one of an output of the first edge generating unit and an output of the second edge generating unit a selection unit for, the third parameter and based on the selected output by said selection section, determines a position of the second drawing point inside the polygon, the third corresponding to the drawing point of the second And a span generator for determining the position of the corresponding point of the mapping. 11. The mapping apparatus according to claim 10 , wherein while one of said first edge generator and said second edge generator is operating, the other edge generator is not operating. 12. The calculation unit calculates the slope of the edge of the polygon on the plane, the selection unit cumulatively adds the fractional part of-out inclined, whether the result of該累product addition exceeds a predetermined value The mapping apparatus according to claim 10 , wherein one of an output of the first edge generation unit and an output of the second edge generation unit is selected according to the setting. 13. An operation for generating at least two sets of parameters corresponding to a polygon based on the position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the polygon vertex. And an increment switching unit for selecting one of the at least two sets of parameters; and a first drawing point on the edge of the polygon based on the selected set of parameters. An edge generation unit that determines a position of a sample point, a position of a first corresponding point corresponding to the first drawing point, and the position of the sample point based on the selected set of parameters and the position of the sample point. A span generation unit for determining a position of a second drawing point inside the polygon and determining a position of a second corresponding point corresponding to the second drawing point. 14. The arithmetic unit calculates an inclination of the edge of the polygon on the plane, and the increment switching unit accumulatively adds a decimal part of the inclination, and determines whether a result of the accumulative addition exceeds a predetermined value. 14. The mapping device according to claim 13, wherein one set of parameters is selected from the at least two sets of parameters according to whether or not the set of parameters is determined. 15. An arithmetic unit for generating a parameter corresponding to a polygon based on a position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the polygon vertex; An edge generation unit that determines a position of a first corresponding point corresponding to a first drawing point on an edge of the polygon and a position of a sample point corresponding to the first drawing point based on the parameter; A correction unit configured to correct the position of the sample point when a distance between the first drawing point and the sample point exceeds a predetermined value; and a correction unit configured to correct a position of the sample point within the polygon based on the parameter and the sample point. And a span generator for determining the position of the second drawing point and determining the position of the second corresponding point corresponding to the second drawing point. 16. The system according to claim 16, wherein the correction section is included in the span generation section, and the span generation section corrects a position of the sample point, and stores a position of the second drawing point and the second drawing point. Perform both the process of determining the position of the corresponding point,
The mapping device according to claim 15 . 17. The arithmetic unit calculates an inclination of an edge of the polygon on the plane, the span generation unit accumulatively adds a decimal part of the inclination, and determines whether a result of the accumulative addition exceeds a predetermined value. 17. The mapping apparatus according to claim 16 , wherein whether to correct the position of the sample point is determined according to whether or not the mapping is performed. 18. The polygon vertex has an attribute value for expressing a polygon material, and a value corresponding to the first corresponding point and the second corresponding point is determined based on the attribute value. claim from claim 1, further comprising a generation to means
18. The mapping device according to 17 . 19. Polygon vertices, bumps, or has a coordinate value of the displacement, the mapping apparatus according to claims 1 to 17, further comprising means for performing polygon internal bump or displacement calculation . 20. The method of claim 19, wherein the mapping device, mapping device according to claims 1 to 17, further comprising means for performing anti-aliasing processing. The method according to claim 21, wherein each of the plurality of pixels on the plane has a corresponding plurality of sub-pixels, wherein claim 1, wherein the first drawing point is determined in correspondence with the sub-pixel positioning 18. The mapping device according to claim 4, or any one of claims 10 to 17 . 22. A step of generating a parameter corresponding to the polygon based on a position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the vertex of the polygon; Determining the position of a first drawing point on the edge of the polygon and the position of a first corresponding point corresponding to the first drawing point, based on Determining a rendering pixel to be rendered, further determining a sample point corresponding to the rendering pixel, and correcting the position of the first corresponding point based on the sample point; based on the parameter and the sample point Determining the position of a second drawing point inside the polygon and determining the position of a second corresponding point corresponding to the second drawing point. 23. Generating a parameter corresponding to the polygon based on a position of a vertex of the polygon projected on a plane having a plurality of pixels and a corresponding point given to the polygon vertex; Determining a position of a first drawing point on the edge of the polygon and a first corresponding point corresponding to the first drawing point, based on the parameter and the first drawing point. The position of a second drawing point, which is a point inside the polygon, is determined based on the second
Determining a position of a second corresponding point corresponding to the drawing point of the above, and a value generated based on the position of the first drawing point or the position of the second drawing point on the plane. 1 of the plurality of pixels
A value corresponding to one pixel or a plurality of adjacent pixels.