For my Master’s thesis, I conducted research on the use of tight bounding volumes in bounding volume hierarchies.

This thesis reviews methods for building bounding volume hierarchies (BVH) for ray tracing. It focuses on techniques applicable to interactive applications with dynamic scenes. Based on the research of these techniques, two efficient BVH construction algorithms that use tight bounding volumes, such as OBB and ODOP, are implemented. For the implementation, available codes in the CUDA language were used and unified inside a common framework. The resulting BVHs were compared in terms of their construction speed and ray tracing speed on six different scenes. The bottlenecks of this construction were discussed, and possible improvements were suggested.

AABB BVH constructed using the PLOC algorithm OBB BVH constructed using the DiTO algorithm OBB BVH constructed using the ODOP algorithm

BVH constructed using different construction methods built over the Hairball scene. From left: AABB, OBB using the DiTO algorithm, OBB using the ODOP algorithm.

The project can be downloaded here: Download

or seen here: Dspace

Where the project with the code is zipped and splitted in the PRILOHA files.