View Code? Open in Web Editor NEW

Implementation for "Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring"

License: Other

C++ 85.80% Cuda 13.71% C 0.01% Python 0.33% Batchfile 0.15%

atrbvh's Introduction

ATRBVH

Agglomerative Treelet Restructuring Bounding Volume Hierarchy

This repository contains the full implementation for ATRBVH, as described in:

"Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring",
Leonardo R. Domingues and Helio Pedrini,
High-Performance Graphics 2015

You will also find an implementation of TRBVH, which was created from the information provided in the original paper:

"Fast Parallel Construction of High-Quality Bounding Volume Hierarchies",
Tero Karras and Timo Aila,
High-Performance Graphics 2013,
https://research.nvidia.com/publication/fast-parallel-construction-high-quality-bounding-volume-hierarchies

An implementation of LBVH can also be found here, as described in:

"Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees",
Tero Karras,
High-Performance Graphics 2012,
https://research.nvidia.com/publication/maximizing-parallelism-construction-bvhs-octrees-and-k-d-trees

If you are going to use this project, please note that both TRBVH and the idea of using an agglomerative treelet restructuring are patented:

"Bounding volume hierarchies through treelet restructuring",
US 20140365532 A1,
http://www.google.com/patents/US20140365532

"Agglomerative treelet restructuring for bounding volume hierarchies",
US 20140365529 A1,
http://www.google.com/patents/US20140365529

Recommend Projects