Compact, Fast and Robust Grids for Ray Tracing
- 1 June 2008
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 27 (4) , 1235-1244
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic ScenesComputer Graphics Forum, 2007
- On fast Construction of SAH-based Bounding Volume Hierarchies2007
- Grid Creation Strategies for Efficient Ray Tracing2007
- A Coherent Grid Traversal Approach to Visualizing Particle-Based Simulation DataIEEE Transactions on Visualization and Computer Graphics, 2007
- On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)2006
- Ray tracing animated scenes using coherent grid traversalACM Transactions on Graphics, 2006
- Perfect spatial hashingACM Transactions on Graphics, 2006
- Perfect hashingTheoretical Computer Science, 1997
- Analysis of an algorithm for fast ray tracing using uniform space subdivisionThe Visual Computer, 1988
- ARTS: Accelerated Ray-Tracing SystemIEEE Computer Graphics and Applications, 1986