SATO: Surface Area Traversal Order for Shadow Ray Tracing

نویسندگان

  • Jae-Ho Nah
  • Dinesh Manocha
چکیده

We present the surface area traversal order (SATO) metric to accelerate shadow ray traversal. Our formulation uses the surface area of each child node to compute the TO. In this metric, we give a traversal priority to the child node with the larger surface area to quickly find occluders. Our algorithm reduces the pre-processing overhead significantly, and is much faster than other metrics. Overall, the SATO is useful for ray tracing large and complex dynamic scenes (e.g. a few million triangles) with shadows.

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

ثبت نام

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

منابع مشابه

PYSHA: a shadow-testing acceleration scheme for ray tracing

The paper presents a new data structure called a shadow pyramid for storing 3D objects to reduce the shadow-testing time during ray tracing. For each primitive object that first intersects a ray, a shadow pyramid is constructed in which all the candidate objects that possibly block the path from the relevant light source to any point on the primitive object are registered. Shadow testing of. th...

متن کامل

Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing

We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages that are mapped efficiently to the massively parallel architecture of modern GPUs. These stages include: ray sorting into coherent packets, creation of frustums for packets, breadth-first frustum traversal through a bound...

متن کامل

Algorithm optimizations and mapping scheme for interactive ray tracing on a reconfigurable architecture

This paper presents a mapping scheme of an optimized octree-based ray tracing algorithm and its implementation on a SIMD reconfigurable architecture, MorphoSys, with appropriate hardware incorporated. A two-level SIMD mapping scheme for ray tracing is chosen to get better trade-off between coherence exploitation efficiency and bandwidth requirements. We apply an SIMD octree traversal algorithm ...

متن کامل

Pyramid Clipping for Efficient Ray Traversal

Rays having the same origin and similar directions frequently appear in the form of viewing rays and shadow rays to area light sources in ray tracing, and in hemisphere shooting or gathering in radiosity algorithms. The coherence between these rays can be exploited by enclosing a bundle of these rays with a pyramid and by classifying objects with respect to this pyramid prior to tracing the ray...

متن کامل

Ray Tracing Dynamic Scenes with Shadows on the GPU

We present fast ray tracing of dynamic scenes in this paper with primary and shadow rays. We present a GPUfriendly strategy to bring coherency to shadow rays, based on previous work on grids as acceleration structures. We introduce indirect mapping of threads to rays to improve the performance of ray tracing on the GPU for the traversal and intersection steps. We also construct a light frustum ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2014