A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer

Popular approaches to speeding up scan conversion often employ parallel processing. Recently, several special-purpose parallel architectures have been suggested. We propose an alternative to these systems: the general-purpose ultracomputer, a parallel processor with many autonomous processing elements and a shared memory. The “serial semantics/parallel execution” feature of this architecture is exploited in the formulation of a scan conversion algorithm. Hidden surfaces are removed using a single scanline, z-buffer algorithm. Since exact anti-aliasing is inherently slow, a novel parallel anti-aliasing algorithm is presented in which subpixel coverage by edges is approximated using a look-up table. The ultimate intensity of a pixel is the weighted sum of the intensity contribution of the closest edge, that of the “losing” edges, and that of the background. The algorithm is fast and accurate, it is attractive even in a serial environment, and it avoids several artifacts that commonly occur in animated sequences.

[1]  Henry Fuchs,et al.  Distributing a visible surface algorithm over multiple processors , 1977, ACM '77.

[2]  Turner Whitted,et al.  A software test-bed for the development of 3-D raster graphics systems , 1981, SIGGRAPH '81.

[3]  Edwin E. Catmull,et al.  A hidden-surface algorithm with anti-aliasing , 1978, SIGGRAPH.

[4]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

[5]  Turner Whitted,et al.  An improved illumination model for shaded display , 1979, CACM.

[6]  Richard Weinberg,et al.  Parallel processing image synthesis and anti-aliasing , 1981, SIGGRAPH '81.

[7]  A. Gottleib,et al.  The nyu ultracomputer- designing a mimd shared memory parallel computer , 1983 .

[8]  Robert F. Sproull,et al.  Principles in interactive computer graphics , 1973 .

[9]  Crow,et al.  A Comparison of Antialiasing Techniques , 1981, IEEE Computer Graphics and Applications.

[10]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[11]  Daniel S. Whelan.  A rectangular area filling display system architecture , 1982, SIGGRAPH.

[12]  Ivan E. Sutherland,et al.  A VLSI architecture for updating raster-scan displays , 1981, SIGGRAPH '81.

[13]  Franklin C. Crow,et al.  The aliasing problem in computer-generated shaded images , 1977, Commun. ACM.

[14]  Henry Fuchs,et al.  Generating smooth 2-D monocolor line drawings on video displays , 1979, SIGGRAPH '79.

[15]  GottliebAllan,et al.  Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors , 1983 .

[16]  D. T. Lee,et al.  Shading of regions on vector display devises , 1981, SIGGRAPH '81.

[17]  James H. Clark,et al.  The Geometry Engine , 1982, SIGGRAPH.

[18]  Alan W. Paeth,et al.  DEVELOPING PIXEL-PLANES, A SMART MEMORY-BASED RASTER GRAPHICS SYSTEM. , 1982 .

[19]  Frederic I. Parke,et al.  Simulation and expected performance analysis of multiple processor Z-buffer systems , 1980, SIGGRAPH '80.

[20]  James F. Blinn,et al.  Scan line methods for displaying parametrically defined surfaces , 1988, CACM.