Multiple pixel generator

Claim 3

A method as claimed in claim 1 further comprising translating the data values provided by said vector generators into pixel position data which represents said linear function.

Claim 4

A method as claimed in claim 1 or claim 2, further comprising storing in a memory device at least some of the data values generated during said single machine cycle.

Claim 5

A method as claimed in claim 3 wherein said storing step comprises storing, during said machine cycle, those of the generated data values which meet the memory access constraints of the memory device, regenerating unstored data values in subsequent machine cycles, and storing, during said machine cycle, those of the generated data values which meet the memory access constraints of the memory device, and designating the remaining generated data values for storage in subsequent machine cycles.

Claim 9

Apparatus for generating data values for a plurality of pixels in a single machine cycle of the pixel generating system, wherein said data values represent a linear function of at least one of the coordinates of said pixels, said apparatus comprising: means for generating error terms according to Bresenham's algorithm for each of a plurality of contiguous pixels, with the number of said contiguous pixels being equal to the number of pixels which are to be generated during said single machine cycle; a plurality of vector generators for generating, during said single machine cycle, the data values for said plurality of pixels, said vector generators being connected in parallel with one another and arranged so that each of said vector generators provides the data values for an associated one of said plurality of pixels, said vector generators being further configured so that the data values for each pixel are determined, at least in part, as a function of the number of pixels being generated in one cycle and as a function of said error terms generated according to Bresenham's algorithm; and means for translating the data values provided by said vector generators into pixel position data which represents said linear function.

Claim 10

Apparatus for generating data values for a plurality of pixels in a single machine cycle of the pixel generating system, wherein said data values represent a linear function of at least one of the coordinates of said pixels, said apparatus comprising: means for generating error terms according to Bresenham's algorithm for each of a plurality of contiguous pixels, with the number of said contiguous pixels being equal to the number of pixels which are to be generated during said single machine cycle; a plurality of vector generators for generating, during said single machine cycle, the data values for said plurality of pixels, said vector generators being connected in parallel with one another and arranged so that each of said vector generators provides the data values for an associated one of said plurality of pixels, said vector generators being further configured so that the data values for each pixel are determined, at least in part, as a function of the number of pixels being generated in one cycle and as a function of said error terms generated according to Bresenham's algorithm; and means for translating the data values provided by said vector generators into pixel position data which represents said linear function.

Claim 11

Apparatus as claimed in claim 7 further comprising means for storing at least some of the data values generated during said single machine cycle, wherein said storage means comprises means for storing, during said machine cycle, those of the generated data values which meet the memory access constraints of said storage means, and means for regenerating unstored data values in subsequent machine cycles.

Claim 12

Apparatus as claimed in claim 7 or claim 8 wherein the grid of possible pixel coordinates is divided into octants so that, for a first one of said octants, the pixel coordinates which represent said linear function area greater than or equal to zero but also less than or equal to the pixel coordinates which serve as the argument for said linear function, and further comprising means for normalizing the parameters for said linear function so that the pixel coordinates for said function are contained in said first octant; said first octant is divided into a plurality of regions, with the number of regions being equal to the number of pixels which are to be generated during said single machine cycle, and further comprising means for determining, as a function of the sign of said error terms generated according to Bresenham's algorithm, which of said regions contains the pixel coordinates which represent said linear function; and said vector generators are further disposed so that the determination of the data values for each said pixel is further a function of said region which contains said pixel coordinates.

Claim 13

Apparatus for generating the x and y coordinates of multiple pixel locations for a rasterized line during a given single machine cycle of the pixel generating system, wherein the number of said pixels to be generated in said cycle is designated by n and wherein the grid of possible pixel coordinates is divided into octants so that, in a first one of said octants, the y-coordinate value of said pixel location is greater than or equal to zero and also less than or equal to the x-coordinate value thereof, said first octant being further divided into n regions, said apparatus comprising: means for normalizing the parameters which define said line so that the pixel coordinates for said rasterized line are contained in said first octant; means for generating error terms for the first n pixel locations by applying Bresenham's algorithm to each of n contiguous pixels; means for generating in parallel, during said single machine cycle, n error terms which correspond to pixel locations other than said first n pixel locations, said means being configured so that a selectable increment is added to each of said error terms for said first n pixel locations, said increment having two possible values with the value selected being determined by the sign of the error term to which said increment is to be added; means for determining, from the sign of said error terms for said first n pixel locations, which of said n regions contains the pixel coordinates for said rasterized line, and wherein the two possible values of said increment are determined as a function of said region which contains said rasterized line pixel coordinates; and wherein said two possible values of said increment are 2n(dy)-2(r+1)(dx) and 2n(dy)-2(r)(dx), for positive and negative signs, respectively, of the error term to which said increment is to be added, where r designates the region containing the rasterized line, dx designates the difference between the x-coordinate values of the ending and starting points of the line, and dy designates the difference between the y-coordinate values of the ending and starting points of the line.

Claim 14

Apparatus for generating the x and y coordinates of multiple pixel locations for a rasterized line during a given single machine cycle of the pixel generating system, wherein the number of said pixels to be generated in said cycle is designated by n and wherein the grid of possible pixel coordinates is divided into octants so that, in a first one of said octants, the y-coordinate value of said pixel location is greater than or equal to zero and also less than or equal to the x-coordinate value thereof, said first octant being further divided into n regions, said apparatus comprising: means for normalizing the parameters which define said line so that the pixel coordinates for said rasterized line are contained in said first octant; means for generating error terms for the first n pixel locations by applying Bresenham's algorithm to each of n contiguous pixels; means for generating in parallel, during said single machine cycle, n error terms which correspond to pixel locations other than said first n pixel locations, said means being configured so that a selectable increment is added to each of said error terms for said first n pixel locations, said increment having two possible values with the value selected being determined by the sign of the error term to which said increment is to be added; means for determining, from the sign of said error terms for said first n pixel locations, which of said n regions contains the pixel coordinates for said rasterized line, and wherein the two possible values of said increment are determined as a function of said region which contains said rasterized line pixel coordinates; and wherein said two possible values of said increment are 2n(dy)-2(r+1)(dx) and 2n(dy)-2(r)(dx), for positive and negative signs, respectively, of the error term to which said increment is to be added, where r designates the region containing the rasterized line, dx designates the difference between the x-coordinate values of the ending and starting points of the line, and dy designates the difference between the y-coordinate values of the ending and starting points of the line.