Abstract

A parallel algorithm for the rasterization of polygons is presented that is particularly well suited for 3D Z-buffered graphics implementations. The algorithm represents each edge of a polygon by a linear edge function that has a value greater than zero on one side of the edge and less than zero on the opposite side. The value of the function can be interpolated with hardware similar to hardware required to interpolate color and Z pixel values. In addition, the edge function of adjacent pixels may be easily computed in parallel. The coefficients of the "Edge function " can be computed from floating point endpoints in such a way that sub-pixel precision of the endpoints can be retained in an elegant way. CR catagories and subject descriptors: 1.3.1 [Computer Graphics]:

Citations

220	Algorithm for computer control of a digital plotter - Bresenham
167	Fundamentals of Interactive Computer Graphics - Foley, Dam - 1982
16	Pixel-Plances: a VLSI-Oriented Design for a Raster Graphics Engine - Fuchs, Poulton - 1981
4	Memory Design for Raster Graphics Displays - Whitton - 1984
2	Jag-Free Images on Raster Displays - Fujimoto, Iwata - 1983