Parallel Progressive Ray-tracing

Simple item page
dc.contributor.authorNotkin, Irenaen_US
dc.contributor.authorGotsman, Craigen_US
dc.date.accessioned2015-01-27T11:53:43Z
dc.date.available2015-01-27T11:53:43Z
dc.date.issued1997en_US
dc.description.abstractA dynamic task allocation algorithm for ray-tracing by progressive refinement on a distributed-memory parallel computer is described. Parallelization of progressive ray-tracing is difficult because of the inherent sequential nature of the sample location generation process, which is optimized (and different) for any given image. We report on experimental results obtained from our implementation of this algorithm on a Meiko parallel computer. The three performance measures of the algorithm, namely, load-balance, speedup, and image quality, are shown to be good.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume16en_US
dc.identifier.doi10.1111/1467-8659.115en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages43-55en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.115en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleParallel Progressive Ray-tracingen_US
Files
Collections
Issue 1