Adaptive Ray-bundle Tracing with Memory Usage Prediction: Efficient Global Illumination in Large Scenes

نویسندگان

  • Yusuke Tokuyoshi
  • Takashi Sekine
  • Tiago da Silva
  • Takashi Kanai
چکیده

This paper proposes an adaptive rendering technique for ray-bundle tracing. Ray-bundle tracing can be done by per-pixel linked-list construction on a GPU rasterization pipeline. This rasterization based approach offers significant benefits for the efficient generation of light maps (e.g., hardware acceleration, tessellation, and recycling of shaders used in real-time graphics). However, it is inapplicable to large and complex scenes due to the limited capacity of the GPU memory because it requires a high-resolution frame buffer and high-capacity node buffer for the linked-lists. In addition, memory overflow can potentially occur on the per-pixel linked-list since the memory usage of the lists is usually unknown before the rendering process. We introduce an adaptive tiling technique with memory usage prediction. Our method uses an appropriately tiled frame buffer, thus eliminating almost all of the overflow risks thanks to our adaptive tile subdivision scheme. Using this technique, we are able to render high-quality light maps of large and complex scenes which cannot be computed using previous ray-bundle based methods.

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

ثبت نام

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

منابع مشابه

Adaptive Ray-bundle Tracing with Memory Usage Prediction: Efficient Global Illumination in Large Scenes (Implementation Details)

where Ao(t) is the area of the triangle in object space and Al(t) is the area of the triangle in light map space. However, it can lead to large errors for small triangles in practice, as shown in Figure 2 (a). UV unwrapping tools can produce noise caused by lack of computation precision which is generally undetectable to artists. Even if the area of a triangle in light map space is imperceptibl...

متن کامل

An Irradiance Atlas for Global Illumination in Complex Production Scenes

We introduce a tiled 3D MIP map representation of global illumination data. The representation is an adaptive, sparse octree with a “brick” at each octree node; each brick consists of 83 voxels with sparse irradiance values. The representation is designed to enable efficient caching. Combined with photon tracing and recent advances in distribution ray tracing of very complex scenes, the result ...

متن کامل

Ray Differentials and Multiresolution Geometry Caching

When rendering only directly visible objects, ray tracing a few levels of specular reflection from large, lowcurvature surfaces, and ray tracing shadows from point-like light sources, the accessed geometry is coherent and a geometry cache performs well. But in many other cases, the accessed geometry is incoherent and a standard geometry cache performs poorly: ray tracing of specular reflection ...

متن کامل

Cache de luminance pour l’éclairage global en présence de surfaces rugueuses

Computation of global illumination is an important means in the pursuit of photorealism of computer-generated images. It is of particular importance in scenes with glossy surfaces, since it conditions correct perception of glossy material characteristics. This dissertation focuses on efficient computation of global illumination in presence of glossy surfaces with low-frequency reflectance funct...

متن کامل

Adaptive Sampling of Area Light Sources in Ray Tracing Including Diffuse Interreflection

Ray tracing algorithms that sample both the light received directly from light sources and the light received indirectly by diffuse reflection from other patches, can accurately render the global illumination in a scene and can display complex scenes with accurate shadowing. A drawback of these algorithms, however, is the high cost for sampling the direct light which is done by shadow ray testi...

متن کامل

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


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

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

ثبت نام

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

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

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2013