Partitioning and ordering large radiosity computations
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Memory Management Schemes for Radiosity Computation in Complex Environments
CGI '98 Proceedings of the Computer Graphics International 1998
Beam tracing polygonal objects
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Geometric Tools for Computer Graphics
Geometric Tools for Computer Graphics
Lightcuts: a scalable approach to illumination
ACM SIGGRAPH 2005 Papers
ACM SIGGRAPH 2006 Papers
Matrix row-column sampling for the many-light problem
ACM SIGGRAPH 2007 papers
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Massive-Model Rendering Techniques: A Tutorial
IEEE Computer Graphics and Applications
Technical strategies for massive model visualization
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Real-time KD-tree construction on graphics hardware
ACM SIGGRAPH Asia 2008 papers
ACM SIGGRAPH Asia 2008 papers
An efficient GPU-based approach for interactive global illumination
ACM SIGGRAPH 2009 papers
Spatial splits in bounding volume hierarchies
Proceedings of the Conference on High Performance Graphics 2009
Understanding the efficiency of ray traversal on GPUs
Proceedings of the Conference on High Performance Graphics 2009
Micro-rendering for scalable, parallel final gathering
ACM SIGGRAPH Asia 2009 papers
PantaRay: fast ray-traced occlusion caching of massive scenes
ACM SIGGRAPH 2010 papers
OptiX: a general purpose ray tracing engine
ACM SIGGRAPH 2010 papers
HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry
Proceedings of the Conference on High Performance Graphics
LightSlice: matrix slice sampling for the many-lights problem
Proceedings of the 2011 SIGGRAPH Asia Conference
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Virtual ray lights for rendering scenes with participating media
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Coherent out-of-core point-based global illumination
EGSR'11 Proceedings of the Twenty-second Eurographics conference on Rendering
Adaptive progressive photon mapping
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
In this paper, we present a GPU-based out-of-core rendering approach under the many-lights rendering framework. Many-lights rendering is an efficient and scalable rendering framework for a large number of lights. But when the data sizes of lights and geometry are both beyond the in-core memory storage size, the data management of these two out-of-core data becomes critical and challenging. In our approach, we formulate such a data management as a graph traversal optimization problem that first builds out-of-core lights and geometry data into a graph, and then guides shading computations by finding a shortest path to visit all vertices in the graph. Based on the proposed data management, we develop a GPU-based out-of-GPU-core rendering algorithm that manages data between the CPU host memory and the GPU device memory. Two main steps are taken in the algorithm: the out-of-core data preparation to pack data into optimal data layouts for the many-lights rendering, and the out-of-core shading using graph-based data management. We demonstrate our algorithm on scenes with out-of-core detailed geometry and out-of-core lights. Results show that our approach generates complex global illumination effects with increased data access coherence and has one order of magnitude performance gain over the CPU-based approach.