I'm a little confused on the directions laid out in the assignment sheet as well as partly the textbook. I've been hearing that we use priority queue and BFS for some distance searching algorithm, but I'm not sure if this is referring to the distance algorithms, the ray intersect for AABB, or both.
I'm a little confused on the directions laid out in the assignment sheet as well as partly the textbook. I've been hearing that we use priority queue and BFS for some distance searching algorithm, but I'm not sure if this is referring to the distance algorithms, the ray intersect for AABB, or both.