Triangle classification setup method and apparatus for 3-D graphics display system

Claim 1

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle which can be calculated from said coordinates of said vertices, wherein one set of said parameters is a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 2

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle which can be calculated from said coordinates of said vertices, wherein one set of said parameters is a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 3

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle which can be calculated from said coordinates of said vertices, wherein one set of said parameters is the values of the slopes of the edges of said triangle, and wherein said parameters further comprise values representing the comparison of said slopes to each other; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 4

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle which can be calculated from said coordinates of said vertices, wherein one set of said parameters is the values of the slopes of the edges of said triangle, and wherein said parameters further comprise values representing the comparison of said slopes to each other; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 5

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle which can be calculated from said coordinates of said vertices, wherein each said triangle is further described with a bit indicating whether said vertices were originally arranged in clockwise or counter-clockwise order when viewing a front surface of the triangle; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 6

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle which can be calculated from said coordinates of said vertices, wherein each said triangle is further described with a bit indicating whether said vertices were originally arranged in clockwise or counter-clockwise order when viewing a front surface of the triangle; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 9

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle calculated from said coordinates of said vertices; determining a triangle classification for every combination of at least a portion of said parameters, said triangle classifications including wide bottom triangles having a bottom edge which does not cross a y scan line, wide top triangles wherein a top edge of a triangle does not cross a y scan line, new left triangles wherein all three edges of a triangle cross at least one y scan line and said triangle has a left side vertex between top and bottom vertices, new right triangles wherein all three edges of a triangle cross at least one y scan line and said triangle has a right side vertex between top and bottom vertices; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 10

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle calculated from said coordinates of said vertices; determining a triangle classification for every combination of at least a portion of said parameters, said triangle classifications including wide bottom triangles having a bottom edge which does not cross a y scan line, wide top triangles wherein a top edge of a triangle does not cross a y scan line, new left triangles wherein all three edges of a triangle cross at least one y scan line and said triangle has a left side vertex between top and bottom vertices, new right triangles wherein all three edges of a triangle cross at least one y scan line and said triangle has a right side vertex between top and bottom vertices; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 11

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle calculated from said coordinates of said vertices, said parameters including vectors representing edges of said triangles in the order the vertices are presented, the sign of each of said edges, a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary, the values of the slopes of the edges of said triangle, and values representing the comparison of said slopes to each other; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 12

A method for classifying triangles based upon the coordinates of the vertices of a triangle, comprising the steps of: determining a plurality of parameters describing a triangle calculated from said coordinates of said vertices, said parameters including vectors representing edges of said triangles in the order the vertices are presented, the sign of each of said edges, a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary, the values of the slopes of the edges of said triangle, and values representing the comparison of said slopes to each other; determining a triangle classification for every combination of at least a portion of said parameters; storing in a look-up table said determined triangle classifications with said combinations of parameters as addresses; calculating a plurality of parameters of said triangle from said coordinates of said vertices; and determining the classification of said triangle by applying at least a portion of said parameters to said look-up table.

Claim 13

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, wherein one set of said parameters is a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters.

Claim 14

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, wherein one set of said parameters is a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters.

Claim 15

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, one set of said parameters being the values of the slopes of the edges of said triangle, and said parameters also including values representing the comparison of said slopes to each other; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters.

Claim 16

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, one set of said parameters being the values of the slopes of the edges of said triangle, and said parameters also including values representing the comparison of said slopes to each other; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters.

Claim 17

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, each said triangle being further described with a bit indicating whether said vertices were originally arranged in clockwise or counter-clockwise order when viewing a front surface of the triangle; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters.

Claim 18

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, each said triangle being further described with a bit indicating whether said vertices were originally arranged in clockwise or counter-clockwise order when viewing a front surface of the triangle; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters.

Claim 20

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters, said triangle classifications including degenerate triangles which do not have an edge crossing an integral boundary in both x and y directions, wide bottom triangles having a bottom edge which does not cross a y scan line, wide top triangles wherein a top edge of a triangle does not cross a y scan line, new left triangles wherein all three edges of a triangle cross at least one y scan line and said triangle has a left side vertex between top and bottom vertices, and new right triangle wherein all three edges of said triangle cross at least one y scan line and said triangle has a right side vertex between top and bottom vertices.

Claim 21

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates; and look-up table means, coupled to an output of said calculation logic means, for determining a triangle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classifications with addresses corresponding to combinations of said parameters, said triangle classifications including degenerate triangles which do not have an edge crossing an integral boundary in both x and y directions, wide bottom triangles having a bottom edge which does not cross a y scan line, wide top triangles wherein a top edge of a triangle does not cross a y scan line, new left triangles wherein all three edges of a triangle cross at least one y scan line and said triangle has a left side vertex between top and bottom vertices, and new right triangle wherein all three edges of said triangle cross at least one y scan line and said triangle has a right side vertex between top and bottom vertices.

Claim 22

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, said parameters including vectors representing edges of said triangle in the order the vertices are presented, the sign of each of said edges, a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary, the values of the slopes of the edges of said triangle, and values representing the comparison of said slopes to each other; and look-up table means, coupled to an output of said calculation logic means, for determining angle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classification with addresses corresponding to combinations of said parameters.

Claim 23

An apparatus for classifying triangles from an input of the coordinates of the vertices of a triangle, comprising: calculation logic means for calculating a plurality of parameters of said triangle from said input of said coordinates, said parameters including vectors representing edges of said triangle in the order the vertices are presented, the sign of each of said edges, a plurality of values indicating whether a particular edge of said triangle crosses an integral x or y boundary, the values of the slopes of the edges of said triangle, and values representing the comparison of said slopes to each other; and look-up table means, coupled to an output of said calculation logic means, for determining angle classification for every combination of at least a portion of said parameters, said look-up table means storing said triangle classification with addresses corresponding to combinations of said parameters.