Ray Tracing of Dynamic Scenes by Managing Empty Regions in Adaptive Boxes

Abstract

This paper presents a new ray-tracing technique to efficiently speed up ray traversal in empty regions. It first produces grid cells in a new method,and then aggregates empty cells adaptively into fewer empty boxes,so that much acceleration can be obtained by reducing computation on ray going through empty regions. The new acceleration structure can be constructed in O(n) time,and its storage complexity is also O(n). By such a structure,rays can be traced in O(log n) time,similar to ray tracing via a kd-tree . When this structure is integrated with existing acceleration structures,large dynamic scenes can be efficiently rendered. For instance,a dynamic scene with multiple buddha models in up to 6G triangles can be interactively rendered in high photorealism on a common PC,where rays are traced individually and second rays are also computed.