Incremental Polygon Rendering on a SIMD Processor Array
No Thumbnail Available
Date
1988
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishing Ltd and the Eurographics Association
Abstract
We demonstrate how both area coherence and parallelism can be exploited in order to speed up rendering operations on a SIMD square array of processors. Our algorithms take advantage of the method of differences, in order to incrementally compute the values of a linear polynomial function at discrete intervals and thus implement area rendering operations efficiently. We discuss how filling of convex polygons, hidden surface elimination and smooth shading can be implemented on an N ? N processor array that supports planar arithmetic, that is, arithmetic operations performed on N ? N matrices in parallel for all matrix elements. A major attraction of the method we present is that it is based on a SIMD processor array- such machines are now recognised as highly general purpose given the wide range of applications successfully implemented on them.
Description
@article{10.1111:j.1467-8659.1988.tb00634.x,
journal = {Computer Graphics Forum},
title = {{Incremental Polygon Rendering on a SIMD Processor Array}},
author = {Theoharis, Theohaiis and Page, Ian},
year = {1988},
publisher = {Blackwell Publishing Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.1988.tb00634.x}
}