Ray / Priority R-Tree Intersection

These animations, rendered with Dimension, show the ray / bounding box intersections that occur when rendering a single pixel. The first video shows the regular search, and the second shows the faster case of a cache hit, as described in the previous post. Each ray/box intersection takes up one second in these videos, which aptly illustrates the difference between the cache miss and cache hit cases. For this pixel, the improvement is more than a factor of two.

Query without caching:

Query with cache hit:

2 thoughts on “Ray / Priority R-Tree Intersection”

Leave a Reply

Your email address will not be published. Required fields are marked *