Performance of Space Subdivision Techniques in Ray Tracing

Simple item page
dc.contributor.authorMcNeill, M. D. J.en_US
dc.contributor.authorShah, B. C.en_US
dc.contributor.authorHebert, M.-P.en_US
dc.contributor.authorLister, P. F.en_US
dc.contributor.authorGrimsdale, R. L.en_US
dc.date.accessioned2014-10-21T07:21:16Z
dc.date.available2014-10-21T07:21:16Z
dc.date.issued1992en_US
dc.description.abstractWhilst providing images of excellent quality, ray tracing is a computationally intensive task. The first part of this paper compares the speed-up achieved in ray tracing using various space subdivision algorithms and discusses the implications of implementing the algorithms on parallel processing systems. The second part addresses the problem of building the data structure within the rendering process, a situation which occurs when the rendering process is parallelised and dynamic scenes are rendered. Greater performance can be achieved with dynamic structure building compared to creation of the structure prior to rendering. The dynamic building algorithm proposed reduces the building time and storage cost of space subdivision structures, and decreases the data structure creation-render cycle time, thus enhancing image parallelism performance.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume11en_US
dc.identifier.doi10.1111/1467-8659.1140213en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages213-220en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1140213en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titlePerformance of Space Subdivision Techniques in Ray Tracingen_US
Files
Collections
Issue 4