Research indexJournal article
A parallel algorithm for polygon rasterization
Pineda
ACM SIGGRAPH Computer Graphics1 Jun 1988
NobleIDark:/48914/w1/20260515/30C6538EDOI10.1145/378456.378457
A parallel algorithm for polygon rasterization
Pineda · ACM SIGGRAPH Computer Graphics · 1988 · Subscription
NobleIDark:/48914/w1/20260515/30C6538EDOI10.1145/378456.378457
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
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.