Ordered depth-first layouts for ray tracing
Jae‐Ho Nah, Jeong‐Soo Park, Jinwoo Kim, Chanmin Park, Tack‐Don Han · 2010
We present an ordered depth-first tree layout for ray tracing. Among two child nodes, a child node with the larger surface area is stored next to its parent node. Hence, the probabilities that a ray accesses to the same cache line increase. Our approach can be easily and widely used for various ray tracing systems with very small overheads, as it is based on existing depth-first layouts.