Name
Abstract | ||
|---|---|---|
In this paper we propose a simple but effective method to modify a BVH based on ray distribution for improved ray tracing performance. Our method starts with an initial BVH generated by any state-of-the-art offline algorithm. Then by traversing a small set of sample rays we collect statistics at each node of the BVH. Finally, a simple but ultra-fast BVH contraction algorithm modifies the initial binary BVH to a multi-way BVH. The overall acceleration for ray-primitive testing is about 25% for incoherent diffuse rays and 30% for shadow rays, which is significant as a data structure optimization. Similar results are also presented for packet ray tracing, and for Quad-BVHs the improvement is 10% to 15%. The approach has the advantages of being simple, and compatible with almost any existing BVH and ray tracing techniques, and it require very little extra work to generate the modified tree. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1111/cgf.12769 | Computer Graphics Forum |
Keywords | Field | DocType |
ray tracing,bounding volume hierarchy,ray distribution,data-driven optimization | Bounding volume hierarchy,Shadow,Data structure,Bounding volume,Computer science,Ray tracing (graphics),Algorithm,Theoretical computer science,Distributed ray tracing,Acceleration,Binary number | Journal |
Volume | Issue | ISSN |
34 | 7 | 0167-7055 |
Citations | PageRank | References |
3 | 0.39 | 27 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan Gu | 1 | 43 | 5.10 |
| Yong He | 2 | 78 | 12.64 |
| Guy E. Blelloch | 3 | 2927 | 207.30 |