Incremental Polygon Rendering on a SIMD Processor Array

Simple item page
dc.contributor.authorTheoharis, Theohaiisen_US
dc.contributor.authorPage, Ianen_US
dc.date.accessioned2014-10-21T06:06:31Z
dc.date.available2014-10-21T06:06:31Z
dc.date.issued1988en_US
dc.description.abstractWe 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.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume7en_US
dc.identifier.doi10.1111/j.1467-8659.1988.tb00634.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages331-341en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1988.tb00634.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleIncremental Polygon Rendering on a SIMD Processor Arrayen_US
Files
Collections
Issue 4