
1. Bit-Trail Traversal for Stackless LBVH on DirectCompute 329
111
110
101
010
011
001
Node = 001
Trail = 001
z-split
x-split
y-split
Axis Sign
x +(0)
y –(1)
z –(1)
100
(a)
111110101100
010 011
y-split
x-split
001
z-split
Node = 001
Trail = 001
010
010
Axis Sign
x +(0)
y –(1)
z –(1)
(b)
111110101100
010 011
y-split
x-split
001
z-split
Node = 010
Trail = 010
101
100
Axis Sign
x +(0)
y –(1)
z –(1)
(c)
111110101100
010 011
y-split
x-split
001
z-split
Node = 10
Trail = 100 + 1
100
101
1
Axis Sign
x +(0)
y –(1)
z –(1)
(d)
111110101100
010 011
y-split
x-split
001
z-split
Node = 10
Trail = 101+1 01111
010 0110
0
Axis Sign
x +(0)
y –(1)
z –(1)
(e)
111110101100
010 011
y-split
x-split
001
z-split
Node = 011
Trail = 011
111
110
Axis Sign ...