Adaptive Ray‐bundle Tracing with Memory Usage Prediction: Efficient Global Illumination in Large Scenes. (25th November 2013)

• Record Type: Journal Article
• Authors: Tokuyoshi, Yusuke; Sekine, Takashi; da Silva, Tiago; Kanai, Takashi
• Is Part Of: Computer graphics forum. Volume 32:Number 7(2013)
• Page Start: 315
• Page End: 324
• Publication Date: 2013-11-25
• Subjects: I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.12239
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: This paper proposes an adaptive rendering technique for ray‐bundle tracing. Ray‐bundle tracing can be done by per‐pixel linked‐list construction on a GPU rasterization pipeline. This rasterization based approach offers significant benefits for the efficient generation of light maps (e.g., hardware acceleration, tessellation, and recycling of shaders used in real‐time graphics). However, it is inapplicable to large and complex scenes due to the limited capacity of the GPU memory because it requires a high‐resolution frame buffer and high‐capacity node buffer for the linked‐lists. In addition, memory overflow can potentially occur on the per‐pixel linked‐list since the memory usage of the lists is usually unknown before the rendering process. We introduce an adaptive tiling technique with memory usage prediction. Our method uses an appropriately tiled frame buffer, thus eliminating almost all of the overflow risks thanks to our adaptive tile subdivision scheme. Using this technique, we are able to render high‐quality light maps of large and complex scenes which cannot be computed using previous ray‐bundle based methods.