Traversal methods for GPU ray tracing

نویسنده

  • Marek Vinkler
چکیده

Ways of exploiting the raw performance of GPUs for computing ray tracing have been a hot research topic recently. Performance similar to the multi-core CPU ray tracing engines has been achieved. In this paper we present a new traversal method created by combining two of the existing methods. The proposed method is less sensitive to performance loss due to certain object scene distribution. It can also be faster than the methods from which it originated. Several possibilities how to create such a method exist and even better methods can be constructed with the addition of a single instruction to the next generation of GPUs. The resulting ray tracer achieves 50+ fps for primary rays on moderately complex scenes running on current mainstream GPUs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stackless Multi-BVH Traversal for CPU, MIC and GPU Ray Tracing

Stackless traversal algorithms for ray tracing acceleration structures require significantly less storage per ray than ordinary stack-based ones. This advantage is important for massively parallel rendering methods, where there are many rays in flight. On SIMD architectures, a commonly used acceleration structure is the multi bounding volume hierarchy (MBVH), which has multiple bounding boxes p...

متن کامل

Stack Implementation on Programmable Graphics Hardware

We present a technique that allows the implementation of a stack on programmable graphics hardware, using textures and fragment shaders. This development enables a whole new class of GPU algorithms, including recursive functions on complex data structures. Kd-tree traversal for ray tracing is demonstrated as an application. The traversal core was integrated into a purely GPU based photorealisti...

متن کامل

Reduced Precision for Hardware Ray Tracing in GPUs

We propose a high performance, GPU integrated, hardware ray tracing system. We present and make use of a new analysis of ray traversal in axis aligned bounding volume hierarchies. This analysis enables compact traversal hardware through the use of reduced precision arithmetic. We also propose a new cache based technique for scheduling ray traversal. With the addition of our compact fixed functi...

متن کامل

Stackless KD-Tree Traversal for High Performance GPU Ray Tracing

Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet available from the CPUs in standard PCs. Incidentally, most of these PCs also contain modern GPUs that do offer much larger raw compute power. However, limitations in the programming and memory model have so far kept the perf...

متن کامل

Hybrid CPU/GPU KD-Tree Construction for Versatile Ray Tracing

We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to efficiently distribute workload between ...

متن کامل

Effficient stackless ray traversal for bounding sphere hierarchies with CUDA

One of the challenges of GPU-based ray tracing is the hierarchical space indexation structure traversal. Stackless approaches to this problem offer benefits both in terms of maximum representable scene size and performances. [5, 9] We improve on the current stackless traversal methods by increasing memory access locality and accelerating both the primary and secondary ray shooting through speci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010