03/28/2002
15-462 Graphics I
6
Hierarchical Bounding Volumes
•With
simple bounding volumes, ray casting still has requires O(n) intersection tests
•Idea
use tree data structure
–Larger
bounding volumes contain smaller ones etc.
–Sometimes
naturally available (e.g. human figure)
–Sometimes
difficult to compute
•Often
reduces complexity to O(log(n))