Spatial Data Structure
Problem
Ray tracing is too slow. We need to accelerate it!
To make ray tracing faster, we need to solve this problem:
Given a scene defined by a set of primitives and a ray , find the closest point of intersection of with the scene.
Bounding Volume
Idea: Precompute conservative but smallest bounding volume that includes all primitives, then early reject if ray does not hit the box.
Problem: In the worst case, we still need to examine all primitives.