Fast robust BSP tree traversal algorithm for ray tracing

Authors:
Vlastimil Havran;Tomás Kopal;Jiří Bittner;Jiří Žára
Affiliations:
Czech Technical University, Faculty of Electrical Engineering, Department of Computer Science and Engineering, Karlovo nám. 13, 12135 Prague 2, Czech Republic;Czech Technical University, Faculty of Electrical Engineering, Department of Computer Science and Engineering, Karlovo nám. 13, 12135 Prague 2, Czech Republic;Czech Technical University, Faculty of Electrical Engineering, Departmere of Computer Science and Engineering, Karlovo nám. 13, 12135 Prague 2, Czech Republic;Czech Technical University, Faculty of Electrical Engineering, Department of Computer Science and Engineering, Karlovo nám. 13, 12135 Prague 2, Czech Republic
Venue:
Journal of Graphics Tools
Year:
1998

Citing 5
Cited 0

Data structures for ray tracing

Proceedings of a workshop (Eurographics Seminars on Data structures for raster graphics
Heuristics for ray tracing using space subdivision

The Visual Computer: International Journal of Computer Graphics
An introduction to ray tracing

An introduction to ray tracing
Advanced animation and rendering techniques

Advanced animation and rendering techniques
Ray tracing with the BSP tree

Graphics Gems III

Quantified Score

Hi-index	0.00

Visualization

Abstract

An orthogonal BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure for ray-tracing acceleration. While the construction of a BSP tree takes a relatively short time, the efficiency of a traversal algorithm significantly influences the overall rendering time. We propose a new fast traversal algorithm based on statistical evaluation of all possible cases occuring during the traversal of a BSP tree. More frequent cases are handled simply, while less frequent ones are more computationally expensive. The proposed traversal algorithm handles all singularities correctly, and saves between 30% and 50% of traversal time compared with the commonly-known Sung and Arvo algorithms.