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.
- 1 Bresenham, J. Algorithm for Computer Control of Digital Plotter. IBM Systems Journal 4,1 (1965), 25-30.Google Scholar
- 2 Foley, J. and A. Van Dam, "Fundamentals of Interactive Computer Graphics." Google ScholarDigital Library
- 3 Fuchs, H. and Poulton J. PIXEL-PLANES: A VLSI-Oriented Design for a Raster Graphics Engine. VLSI DESIGN (Third Quarter 1981), 20-28.Google Scholar
- 4 Fujimoto, A. and Iwata, K. Jag-Free Images on Raster Displays. IEEE Computer Graphics and Applications 3,9 (December 1983), 26-34.Google Scholar
- 5 Whitton, M. Memory Design for Raster Graphics Displays. iEEE Computer Graphics and Applications 4,3 (March 1984), 48-65.Google ScholarCross Ref
Index Terms
- A parallel algorithm for polygon rasterization
Recommendations
A parallel algorithm for polygon rasterization
SIGGRAPH '88: Proceedings of the 15th annual conference on Computer graphics and interactive techniquesA 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 ...
Data decomposition method for parallel polygon rasterization considering load balancing
It is essential to adopt parallel computing technology to rapidly rasterize massive polygon data. In parallel rasterization, it is difficult to design an effective data decomposition method. Conventional methods ignore load balancing of polygon ...
Adaptive Parallel Rendering on Multiprocessors and Workstation Clusters
This paper presents the design and performance of a new parallel graphics renderer for 3D images. This renderer is based on an adaptive supersampling approach that works for time/space-efficient execution on two classes of parallel computers. Our ...
Comments