Algorithm 1 G Mode

1: ${\mathit{R}}_{\mathit{n}}\leftarrow Ray, index:n=\left\{0,1,2\dots , N-1\right\}$, N = maximum number of guide ray

2: $\mathit{T}\mathit{B}\leftarrow Tree build data$ 3: $\mathit{L}\leftarrow Listener$ 4: $\mathit{C}\mathit{H}\mathit{T}\leftarrow$ Combinations of hit-triangles 5: $\mathit{C}\mathit{B}\leftarrow$ Combinations buffer 6: procedure Guide mode ($\mathit{L}, \mathit{T}\mathit{B}, \mathit{C}\mathit{B})$ 7: Step 01: Finds combination of hit-triangles 8: for $\mathit{R}\in \left\{{\mathit{R}}_{\mathbf{0}},\cdots {\mathit{R}}_{\mathit{n}-\mathbf{1}}\right\} \mathit{d}\mathit{o}$

9:  $\mathit{R}\leftarrow$ Set origin position (position of L) and random direction 10:  $\mathit{C}\mathit{H}\mathit{T}\leftarrow$ Ray tracing processing ($R, TB$) 11:  if $\mathit{C}\mathit{H}\mathit{T}$ is valid then 12:   $\mathit{C}\mathit{B}\leftarrow$ Add $\mathit{C}\mathit{H}\mathit{T}$

13:  end if   14: end for 15: Step 02: Sorts and removes duplicate combination of hit-triangles 16: for d = 0 to 3 do // depth loop 17:  Merge-sort $\mathit{C}\mathit{H}\mathit{T}$ that have depth d in $\mathit{C}\mathit{B}$ 18: end for 19: for i = 0 to N − 1, j = 0 to N − 1 do // N is number of combinations 20:  if $\mathit{C}\mathit{H}{\mathit{T}}_{\mathit{i}}$ is equal to $\mathit{C}\mathit{H}{\mathit{T}}_{\mathit{j}}$ then 21:   $j\leftarrow j+1$ 22:  else 23:   Remove from $\mathit{C}\mathit{H}{\mathit{T}}_{\mathit{i}\mathbf{+}\mathbf{1}}$ to $\mathit{C}\mathit{H}{\mathit{T}}_{\mathit{j}\mathbf{-}\mathbf{1}}$ 24:   $i\leftarrow j$ 25:   $j\leftarrow j+1$ 26:  end if 27: end for

28: end procedure