2008 IEEE Symposium on Interactive Ray Tracing 2008
DOI: 10.1109/rt.2008.4634620
|View full text |Cite
|
Sign up to set email alerts
|

Getting rid of packets - Efficient SIMD single-ray traversal using multi-branching BVHs -

Abstract: Figure 1: The BART robots scene (71.7K triangle, 1 quad light), rendered with primary rays only, forced 2-bounce reflections, soft shadows (16 light samples), and a 2-bounce path tracer (16 samples per pixel). Though slower than aggressive packet/frustum techniques for the primary ray case, our single-ray based method is more efficient for the less coherent soft shadows and path traced images. ABSTRACTWhile contemporary approaches to SIMD ray tracing typically rely on traversing packets of coherent rays throug… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0
1

Year Published

2009
2009
2018
2018

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 51 publications
(35 citation statements)
references
References 23 publications
0
34
0
1
Order By: Relevance
“…The effect was particularly clear with trees wider than four. It seems likely, however, that our implementation was not as efficient as the one described by Wald et al [2008], because GTX285 does not have the prefix sum (compaction) instruction.…”
Section: Wide Treesmentioning
confidence: 99%
“…The effect was particularly clear with trees wider than four. It seems likely, however, that our implementation was not as efficient as the one described by Wald et al [2008], because GTX285 does not have the prefix sum (compaction) instruction.…”
Section: Wide Treesmentioning
confidence: 99%
“…These kernels leverage CPU support for the vector instruction sets SSE and AVX, and are "hand optimized" to further improve performance (133). Using vector instruction allows for the efficient traversal of a BVH with branching factors that match the width of the SIMD lanes (131). The axis-aligned bounding boxes (AABBs) of the child nodes are fetched and tested within the CPU vector units, and, using the same technique, a group of triangles can be tested against a single ray at once.…”
Section: Intel Embreementioning
confidence: 99%
“…For example, multibranching BVH structures enable multiple nodes or primitives to be tested for intersection against the same ray in parallel. Quadbranching BVH (BVH4) data structures perform well with 4-wide and 16-wide vector units [Ernst and Greiner 2008;Dammertz et al 2008;Benthin et al 2012], but higher branching factors offer diminishing returns [Wald et al 2008]. …”
Section: Single-ray Vectorizationmentioning
confidence: 99%