| dc.contributor.author | Cleary, John G. | en_US |
| dc.contributor.author | Wyvill, Brian M. | en_US |
| dc.contributor.author | Birtwistle, Graham M. and Vatti, Reddy | en_US |
| dc.date.accessioned | 2014-10-15T09:01:32Z | |
| dc.date.available | 2014-10-15T09:01:32Z | |
| dc.date.issued | 1986 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.1986.tb00263.x | en_US |
| dc.description.abstract | A 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.publisher | Blackwell Publishing Ltd and the Eurographics Association | en_US |
| dc.title | Multiprocessor Ray Tracing | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 5 | en_US |
| dc.description.number | 1 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.1986.tb00263.x | en_US |
| dc.identifier.pages | 3-12 | en_US |
