Parallelization and Hardware Support for Ray Tracing

Using this framework allows for interactively ray tracing even highly complex models on a single PC, including global illumination effects and the interactive visualization of

We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to bounding volume hierarchies the memory of the acceleration data structure is linear

The number of memory reads are for traversal of GrUG and kd-tree data structure and do not in- clude the memory operations needed for triangle intersection testing.. Memory reads

In order to explore alternative rendering algorithms, we have integrated a software ray tracing solution into common tools which has demonstrated superior rendering performance

They reported increased render times of over 300x native render- ing performance using CPU rasterization on a single node, however their implementation was burdened by the use of

Each unit contains a small register file and shares a node cache with the other units in its core. Both are sized to hide the latency of a cache hit, rather than a cache miss. Cache

Akin to any ray tracing pipeline, our image-based algorithm operates in two broad stages: the Build stage, where geometry primitives are recorded in image-space data structures and

(a) Embryo surface model (b) Deterministic ray-tracing (c) Monte-Carlo ray-tracing (d) Actual in-vivo US image Figure 1: Comparison of deterministic binary ray-tracing (b) with