Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
228 words
A shading circuit for shading a plurality of triangular polygons which constitute a solid model to be displayed on a screen defined by orthogonal coordinate axes X and Y, characterized by comprising: preprocessing means (l5), connected to receive three items of vertex data which each contain the intensity and X, Y and Z coordinates of a corresponding vertex of a triangular polygon, for specifying the value in Y coordinate as one of scan lines which are parallel to the coordinate axis X and intersect the polygon, obtaining intensities and depth or Z coordinates of two points located at the positions where said one scan line intersects sides of the polygon, and obtaining the change ΔI/ΔX of intensity for each unit change in X coordinate and the change ΔZ/ΔX of Z coordinate for each unit change in X coordinate, based on the intensities and Z coordinates of said two points; and shading section (l6), connected to receive the vertex data items and the changes ΔI/ΔX and ΔZ/ΔX, for sequentially obtaining intensities and Z coordinates of points on a side of the polygon as starting intensities and starting Z coordinates for said scan lines, and sequentially obtaining intensities and Z coordinates of points inside the polygon for each scan line, based on the corresponding starting intensity and the corresponding starting Z coordinate and commonly on the changes ΔI/ΔX and ΔZ/ΔX.
Claim 2
Dependent Claim
80 words
A shading circuit according to claim l, characterized in that said preprocessing means includes processing means (l2, l4) for determining that one of three vertexes of the polygon as one of said two points which has an intermediate value in Y coordinate, and obtaining an intensity and Z coordinate of the other one of said two points based on said intermediate value, and obtaining the changes ΔI/ΔX and ΔZ/ΔX based on the intensities and Z coordinates of said two points.
Claim 3
Dependent Claim
72 words
A shading circuit according to claim 2, characterized in that said preprocessing means includes divider circuit (l4) for dividing the difference between the intensities of said two points by the difference between the X coordinates of said two points to obtain the change ΔI/ΔX, and dividing the difference between the Z coordinates of said two points by the difference between the X coordinates of said two points to obtain the change ΔZ/ΔX.
Claim 4
Dependent Claim
45 words
A shading circuit according to claim 3, characterized in that said shading section includes a side DDA (4l) for sequentially obtaining intensities and Z coordinates of points on that side of the polygon which is opposed to the vertex of the intermediate Y coordinate value.
Claim 5
Dependent Claim
64 words
A shading circuit according to claim 4, characterized in that said shading section includes a scan DDA (43), connected to receive an intensity and a Z coordinate, for sequentially accumulating the change ΔI/ΔX to the received intensity and the change ΔZ/ΔX to the received Z coordinate, thereby obtaining intensities and Z coordinates of the points inside the polygon which are on a scan line.
Claim 6
Dependent Claim
32 words
A shading circuit according to claim 5, characterized in that said preprocessing means (l5) and shading section (l6) are associated to perform a pipeline processing for said plurality of the triangular polygons.
Claim 7
Independent Claim
232 words
A method for shading a plurality of triangular polygons which constitute a solid model to be displayed on a screen defined by orthogonal coordinate axes X and Y, characterized by comprising: a first step of preparing three items of vertex data which each contain the intensity and X, Y, and Z coordinates of a corresponding vertex of a triangular polygon; a second step of specifying the value in Y coordinate as one of scan lines which are parallel to the coordinate axis X and intersect the polygon and obtaining intensities and depth or Z coordinates of two points located at the positions where said one scan line intersects sides of the polygon, based on said vertex data items; a third step of obtaining the change ΔI/ΔX of intensity for each unit change in X coordinate and the change ΔZ/ΔX of Z coordinate for each unit change in X coordinate, based on the intensities and Z coordinates of said two points; and a fourth step of sequentially obtaining intensities and Z coordinates of points on a side of the polygon, as starting intensities and starting Z coordinates for said scan lines, based on the vertex data items, and sequentially obtaining intensities and Z coordinates of points inside the polygon for each scan line, based on the corresponding starting intensity and the corresponding starting Z coordinate and commonly on the changes ΔI/ΔX and ΔZ/ΔX.
Claim 8
Independent Claim
249 words
A method for shading a plurality of triangular polygons which constitute a solid mode to be displayed on a screen defined by orthogonal coordinate axes X and Y, characterized by comprising: a first step of preparing three items of vertex data which each contain the intensity and X, Y, and Z coordinates of a corresponding vertex of a triangular polygon; a second step of obtaining the change ΔI/ΔX of intensity for each unit change in X coordinate and the change ΔZ/ΔX of depth or Z coordinate for each unit change in X coordinate, based on the following equations: (ΔI/ΔX)Y: constant = {(Yl-Y2)(I2-I3)-(Y2-Y3)(Il-I2)} /{(Yl-Y2)(X2-X3)-(Y2-Y3)(Xl-X2)} (ΔZ/ΔX)Y: constant = {(Yl-Y2)(Z2-Z3)-(Y2-Y3)(Zl-Z2)} /{(Yl-Y2)(X2-X3)-(Y2-Y3)(Xl-X2)} where Xl, X2, and X3 are respectively the X coordinates of three vertexes A, B, and C of the polygon; Yl, Y2, and Y3 are respectively the Y coordinates of vertexes A, B, and C; Zl, Z2, and Z3 are respectively the Z coordinates of vertexes A, B, and C; and IL, I2, and I3 are respectively the intensities of vertexes A, B, and C; and a third step of sequentially obtaining intensities and Z coordinates of points on a side of the polygon, as starting intensities and starting Z coordinates for scan lines parallel to coordinate axis X, based on the vertex data items, and sequentially obtaining intensities and Z coordinates of points inside the polygon for each scan line, based on the corresponding starting intensity and the corresponding starting Z coordinate and commonly on the changes ΔI/ΔX and ΔZ/ΔX.
Claim 9
Dependent Claim
121 words
A shading method according to claim 8, characterized in that said second step includes a first substep of obtaining said changes ΔI/ΔX and ΔZ/ΔX, a second substep of obtaining the change ΔX/ΔY of X coordinate for each unit change in Y coordinate, with respect to each of vertexes A, B, and C, and a third substep of obtaining the change ΔI/ΔY of intensity for each unit change in Y coordinate and the change ΔZ/ΔY of Z coordinate for each unit change in Y coordinate, with respect to at most two of vertexes A, B, and C, said first, second and third substeps being performed with a use of a multiplier, ALU, and divider which are contained in a geometric transformation circuit.
Claim 10
Dependent Claim
154 words
l0. A shading method according to claim 8, characterized in that said second step includes a first substep of obtaining numerators and denominators of each of said two equations, using a multiplier and ALU, which are contained in a geometric transformation circuit, and a second substep of obtaining said changes ΔI/ΔX and ΔZ/ΔX based on the numerators denominators of said equations, a third substep of obtaining the change ΔX/ΔY of X coordinate for each unit change in Y coordinate, with respect to each of vertexes A, B, and C, and a fourth substep of obtaining the change ΔI/ΔY of intensity for each unit change in Y coordinate and the change ΔZ/ΔY of Z coordinate for each unit change in Y coordinate, with respect to at most two of vertexes A, B, and C, said second, third and fourth substeps being performed with a use of a divider which is contained in a shading section.