BVH Optimization

[codyrhoads]

I am having difficulty incorporating an optimization in the BVH code. It is where you prune parts of the tree where the ray intersection occurs at a farther point than the current closest intersection. At the moment the algorithm checks all objects in every leaf that the ray intersects. I want to implement this at some point.