Multi-level ray tracing algorithm

Reshetov, Alexander; Soupikov, Alexei; Hurley, Jim

doi:10.1145/1186822.1073329

Cited by 95 publications

(131 citation statements)

References 20 publications

Supporting

Mentioning

130

Contrasting

Unclassified

Order By: Relevance

“…Recent works in coherent ray tracing [16], [17], [18] combined highly-optimized coherent traversal with SIMD primitive intersection to deliver up to two orders of magnitude increase in frame rate, allowing interactive ray tracing on a single processor. For faster isosurface ray tracing, the ray-cell intersection test was adapted to a SIMD SSE architecture by Marmitt et al [19].…”

Section: Ray Tracing Volumesmentioning

confidence: 99%

Coherent multiresolution isosurface ray tracing

2008

View full text Add to dashboard Cite

Abstract-We implement and evaluate a fast ray tracing method for rendering large structured volumes. Input data is compressed into an octree, enabling residency in CPU main memory. We cast packets of coherent rays through a min/max acceleration structure within the octree, employing a slicebased technique to amortize the higher cost of compressed data access. By employing a multiresolution level of detail scheme in conjunction with packets, coherent ray tracing can efficiently render inherently incoherent scenes of complex data. We achieve higher performance with lesser footprint than previous isosurface ray tracers, and deliver large frame buffers, smooth gradient normals and shadows at relatively lesser cost. In this context, we weigh the strengths of coherent ray tracing against those of the conventional single-ray approach.

show abstract

Section: Ray Tracing Volumesmentioning

confidence: 99%

Coherent multiresolution isosurface ray tracing

2008

View full text Add to dashboard Cite

show abstract

“…With the increase in CPU cores and multi threaded architectures, ray tracing could be efficiently performed on a set of processors. MLRTA [10] performs fast ray tracing by allowing a group of rays to start traversing the tree data structure from a node deep inside the tree, saving unnecessary operations. RLOD [19] uses a LOD based scheme which integrates simplified LODs of the model into k-d tree, performing efficient ray-triangle intersection.…”

Section: Related Workmentioning

confidence: 99%

“…Ray casting has been performed for static models on the CPU [10,16,19] and the GPU [1,9,20,18]. A lot of effort has been put into ray casting and ray tracing of static models at real-time rates.…”

Section: Introductionmentioning

confidence: 99%

Ray Casting Deformable Models on the GPU

Patidar

Narayanan

2008

2008 Sixth Indian Conference on Computer Vision, Graphics &Amp; Image Processing

View full text Add to dashboard Cite

“…SIMD packet tracing can only provide as much benefit as the SIMD width of the machine. In addition to these hardware-related benefits, using packets larger than the SIMD width also allows for algorithmic benefits that actually avoid certain operations, typically by performing some conservative full-packet rejection tests based on bounding frusta, bounding rays, or interval arithmetic [5,19,20,24,26]. All of these techniques rely on high ray coherence to deliver benefits over SIMD packet tracing.…”

Section: Introductionmentioning

confidence: 99%

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

Wald

Benthin

Boulos

2008

2008 IEEE Symposium on Interactive Ray Tracing

View full text Add to dashboard Cite

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 through a binary data structure, we instead evaluate the alternative of traversing individual rays through a bounding volume hierarchy with a branching factor of 16. Though obviously less efficient than high-performance packet techniques for primary rays, we demonstrate that for less coherent secondary ray distributions this approach is at least competitive with (and often faster than) typical packet traversal techniques.

show abstract

Multi-level ray tracing algorithm

Cited by 95 publications

References 20 publications

Coherent multiresolution isosurface ray tracing

Coherent multiresolution isosurface ray tracing

Ray Casting Deformable Models on the GPU

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

Contact Info

Product

Resources

About