Faster ray tracing using adaptive grids
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 17 (1) , 42-51
- https://doi.org/10.1109/38.576857
Abstract
A new hybrid approach is presented which outperforms the regular grid technique in scenes with highly irregular object distributions by a factor of hundreds, and combined with an area interpolator, by a factor of thousands. Much has been said about scene independence of different acceleration techniques and the alleged superiority of one approach over another. Several theoretical and practical studies conducted in the past have led to the same conclusion: a space partitioning method that allows the fastest rendering of one scene often fails with another. Specialization may be the answer. This has always been pursued, consciously or not, in developing various ray-tracing systems. Despite our new algorithm's impressive efficiency, we don't interpret the new method as the fastest ray-tracing scene decomposition possible. This is because our recent groundwork experiments with a derivative method produced in some of the test scenes presented in this article produced timings that were better by approximately 50%.Keywords
This publication has 7 references indexed in Scilit:
- Filtering, Clustering and Hierarchy Construction: a New Solution for Ray-Tracing Complex ScenesComputer Graphics Forum, 1995
- Proximity clouds — an acceleration technique for 3D grid traversalThe Visual Computer, 1994
- Discrete ray tracingIEEE Computer Graphics and Applications, 1992
- A LINEAR-TIME SIMPLE BOUNDING VOLUME ALGORITHMPublished by Elsevier ,1992
- Ray tracing complex models containing surface tessellationsACM SIGGRAPH Computer Graphics, 1987
- Automatic Creation of Object Hierarchies for Ray TracingIEEE Computer Graphics and Applications, 1987
- ARTS: Accelerated Ray-Tracing SystemIEEE Computer Graphics and Applications, 1986