Question 1

Imagine you need to build a bounding volume hierarchy for efficiently answering ray-scene queries given a set of triangles. What if all queries would be for rays traveling in the positive x direction (r.d = [1 0 0]^T). How might you modify the surface area heuristic to utilize this extra information about the workload?

Question 2

Describe in your own words 5 scenarios where we need geometric queries (bonus points for new ones that we have not talked about in class).