Rendering complex scenes with memory-coherent ray tracing
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
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)
Realistic image synthesis using photon mapping
Realistic image synthesis using photon mapping
Interactive Distributed Ray Tracing of Highly Complex Models
Proceedings of the 12th Eurographics Workshop on Rendering Techniques
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Beam tracing polygonal objects
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Realistic Ray Tracing
Physically Based Rendering: From Theory to Implementation
Physically Based Rendering: From Theory to Implementation
An approximate global illumination system for computer generated films
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2005 Papers
Multi-level ray tracing algorithm
ACM SIGGRAPH 2005 Papers
Reordering for cache conscious photon mapping
GI '05 Proceedings of Graphics Interface 2005
Mesh Layouts for Block-Based Caches
IEEE Transactions on Visualization and Computer Graphics
Computer Architecture, Fourth Edition: A Quantitative Approach
Computer Architecture, Fourth Edition: A Quantitative Approach
Ray tracing deformable scenes using dynamic bounding volume hierarchies
ACM Transactions on Graphics (TOG)
Constrained strip generation and management for efficient interactive 3D rendering
CGI '05 Proceedings of the Computer Graphics International 2005
Stochastic simplification of aggregate detail
ACM SIGGRAPH 2007 papers
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Dynamic Ray Scheduling to Improve Ray Coherence and Bandwidth Utilization
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Faster Ray Packets - Triangle Intersection through Vertex Culling
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies
IEEE Transactions on Visualization and Computer Graphics
Memory-savvy distributed interactive ray tracing
EG PGV'04 Proceedings of the 5th Eurographics conference on Parallel Graphics and Visualization
An application of scalable massive model interaction using shared-memory systems
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
Automatically enhancing locality for tree traversals with traversal splicing
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Efficient stack-less BVH traversal for ray tracing
Proceedings of the 27th Spring Conference on Computer Graphics
An energy and bandwidth efficient ray tracing architecture
Proceedings of the 5th High-Performance Graphics Conference
General transformations for GPU execution of tree traversals
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Automatic vectorization of tree traversals
PACT '13 Proceedings of the 22nd international conference on Parallel architectures and compilation techniques
Mining effective parallelism from hidden coherence for GPU based path tracing
SIGGRAPH Asia 2013 Technical Briefs
Out-of-core ray batching on a commodity cluster
Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Sorted deferred shading for production path tracing
EGSR '13 Proceedings of the Eurographics Symposium on Rendering
| Hi-index | 0.00 |
We present a cache-oblivious ray reordering method for ray tracing. Many global illumination methods such as path tracing and photon mapping use ray tracing and generate lots of rays to simulate various realistic visual effects. However, these rays tend to be very incoherent and show lower cache utilizations during ray tracing of models. In order to address this problem and improve the ray coherence, we propose a novel Hit Point Heuristic (HPH) to compute a coherent ordering of rays. The HPH uses the hit points between rays and the scene as a ray reordering measure. We reorder rays by using a space-filling curve based on their hit points. Since a hit point of a ray is available only after performing the ray intersection test with the scene, we compute an approximate hit point for the ray by performing an intersection test between the ray and simplified representations of the original models. Our method is a highly modular approach, since our reordering method is decoupled from other components of common ray tracing systems. We apply our method to photon mapping and path tracing and achieve more than an order of magnitude performance improvement for massive models that cannot fit into main memory, compared to rendering without reordering rays. Also, our method shows a performance improvement even for ray tracing small models that can fit into main memory. This performance improvement for small and massive models is caused by reducing cache misses occurring between different memory levels including the L1/L2 caches, main memory, and disk. This result demonstrates the cache-oblivious nature of our method, which works for various kinds of cache parameters. Because of the cache-obliviousness and the high modularity, our method can be widely applied to many existing ray tracing systems and show performance improvements with various models and machines that have different cache parameters.