Bonsai: Rapid Bounding Volume Hierarchy Generation using Mini Trees
Author
Summary, in English
We present an algorithm, called Bonsai, for rapidly building bounding volume hierarchies for ray tracing. Our method starts by computing midpoints of the triangle bounding boxes and then performs a rough hierarchical top-down split using the midpoints, creating triangle groups with tight bounding boxes. For each triangle group, a mini tree is built using an improved sweep SAH method. Once all mini trees have been built, we use them as leaves when building the top tree of the bounding volume hierarchy. We also introduce a novel and inexpensive optimization technique, called mini-tree pruning, that can be used to detect and improve poorly built parts of the tree. We achieve a little better than 100% in ray-tracing performance compared to a "ground truth" greedy top-down sweep SAH method, and our build times are the lowest we have seen with comparable tree quality.
Department/s
Publishing year
2015
Language
English
Pages
23-42
Publication/Series
Journal of Computer Graphics Techniques
Volume
4
Issue
3
Full text
- Available as PDF - 18 MB
- Download statistics
Document type
Journal article
Publisher
Williams College
Topic
- Computer Science
Status
Published
Research group
- Computer Graphics
ISBN/ISSN/Other
- ISSN: 2331-7418