Multiprocessor Ray Tracing

Simple item page
dc.contributor.authorCleary, John G.en_US
dc.contributor.authorWyvill, Brian M.en_US
dc.contributor.authorBirtwistle, Graham M. and Vatti, Reddyen_US
dc.date.accessioned2014-10-15T09:01:32Z
dc.date.available2014-10-15T09:01:32Z
dc.date.issued1986en_US
dc.description.abstractA multiprocessor algorithm for ray tracing is described. The performance of the algorithm is analysed for a cubic and square array of processors with only local communication between near neighbours. Theoretical expressions for the speedup of the system as a function of the number of processors are derived. These analytic results are supported by simulations of ray tracing on a number of simple scenes with polygonal surfaces. It is found that a square network of processors generally performs better than a cubic network. Some comments are made on the construction of such a system using current (1985) microprocessor technology.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume5en_US
dc.identifier.doi10.1111/j.1467-8659.1986.tb00263.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages3-12en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1986.tb00263.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleMultiprocessor Ray Tracingen_US
Files
Collections
Issue 1