Spatial Directional Radiance Caching

Gassenbauer, Václav; Křivánek, Jaroslav; Bouatouch, Kadi

doi:10.1111/j.1467-8659.2009.01496.x

Cited by 14 publications

(7 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Irradiance and radiance caching schemes need to store their samples in an efficient structure (e.g., kd-tree or octree) in order to quickly retrieve them when interpolation is needed. Recent sampling strategies for caching (e.g., [2,16,26]) have improved the smoothness of the reconstruction. However, due to the combined facts that these samples can be placed anywhere and that only interpolation based on local neighborhood can be performed for performance issues, these schemes cannot guarantee a continuous reconstruction of the stored radiometric quantity.…”

Section: Continuous Reconstructionmentioning

confidence: 99%

Volumetric Vector-Based Representation for Indirect Illumination Caching

Pacanowski

Granier

Schlick

et al. 2010

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

This paper introduces a caching technique based on a volumetric representation that captures low-frequency indirect illumination. This structure is intended for efficient storage and manipulation of illumination. It is based on a 3D grid that stores a fixed set of irradiance vectors. During preprocessing, this representation can be built using almost any existing global illumination software. During rendering, the indirect illumination within a voxel is interpolated from its associated irradiance vectors, and is used as additional local light sources. Compared with other techniques, the 3D vector-based representation of our technique offers increased robustness against local geometric variations of a scene. We thus demonstrate that it may be employed as an efficient and high-quality caching data structure for bidirectional rendering techniques such as particle tracing or photon mapping.

show abstract

Section: Continuous Reconstructionmentioning

confidence: 99%

Volumetric Vector-Based Representation for Indirect Illumination Caching

Pacanowski

Granier

Schlick

et al. 2010

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…For glossy interreflections, Václav et al . [GKB09] propose a spatial‐directional cache method for glossy to glossy reflections. However, they still require sequentially inserting spatial sample points into a data structure, which has to be frequently queried and updated during the computation.…”

Section: Related Workmentioning

confidence: 99%

Spherical Gaussian‐based Lightcuts for Glossy Interreflections

Huo

Jin

Liu

et al. 2020

Computer Graphics Forum

View full text Add to dashboard Cite

It is still challenging to render directional but non‐specular reflections in complex scenes. The SG‐based (Spherical Gaussian) many‐light framework provides a scalable solution but still requires a large number of glossy virtual lights to avoid spikes as well as reduce clamping errors. Directly gathering contributions from these glossy virtual lights to each pixel in a pairwise way is very inefficient. In this paper, we propose an adaptive algorithm with tighter error bounds to efficiently compute glossy interreflections from glossy virtual lights. This approach is an extension of the Lightcuts that builds hierarchies on both lights and pixels with new error bounds and new GPU‐based traversal methods between light and pixel hierarchies. Results demonstrate that our method is able to faithfully and efficiently compute glossy interreflections in scenes with highly glossy and spatial varying reflectance. Compared with the conventional Lightcuts method, our approach generates lightcuts with only one‐fourth to one‐fifth light nodes therefore exhibits better scalability. Additionally, after being implemented on GPU, our algorithms achieve a magnitude of faster performance than the previous method.

show abstract

“…Geometry illustration for our irradiance contribution calculations in Eqs. (4) and (5). Radiance arriving at each vertex v is scaled by the path throughput from the first diffuse vertex d to v, omitting the BRDF and texture reflectance at Along with R v and I v , we also store the number of samples in the cluster and its luminance extents, used to add samples and merge existing clusters during rendering.…”

Section: Rendering and Sample Clusteringmentioning

confidence: 99%

Probabilistic illumination-aware filtering for Monte Carlo rendering

Doidge

Jones

2013

Vis Comput

View full text Add to dashboard Cite

Noise removal for Monte Carlo global illumination rendering is a well known problem, and has seen significant attention from image-based filtering methods. However, many state of the art methods breakdown in the presence of high frequency features, complex lighting and materials. In this work we present a probabilistic image based noise removal and irradiance filtering framework that preserves this high frequency detail such as hard shadows and glossy reflections, and imposes no restrictions on the characteristics of the light transport or materials. We maintain perpixel clusters of the path traced samples and, using statistics from these clusters, derive an illumination aware filtering scheme based on the discrete Poisson probability distribution. Furthermore, we filter the incident radiance of the samples, allowing us to preserve and filter across high frequency and complex textures without limiting the effectiveness of the filter.

show abstract

Spatial Directional Radiance Caching

Cited by 14 publications

References 33 publications

Volumetric Vector-Based Representation for Indirect Illumination Caching

Volumetric Vector-Based Representation for Indirect Illumination Caching

Spherical Gaussian‐based Lightcuts for Glossy Interreflections

Probabilistic illumination-aware filtering for Monte Carlo rendering

Contact Info

Product

Resources

About