Interactive indirect illumination using voxel cone tracing

Crassin, Cyril; Neyret, Fabrice; Saínz, Miguel; Green, Simon; Eisemann, Elmar

doi:10.1145/1944745.1944787

Cited by 56 publications

(39 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These methods can render caustics, unlike eye-path tracingbased methods (e.g., cone tracing [27,28]). …”

Section: Real-time Global Illuminationmentioning

confidence: 99%

Modified filtered importance sampling for virtual spherical Gaussian lights

Tokuyoshi¹

2016

Comp. Visual Media

View full text Add to dashboard Cite

This paper proposes a modification of the filtered importance sampling method, and improves the quality of virtual spherical Gaussian light (VSGL)-based real-time glossy indirect illumination using this modification. The original filtered importance sampling method produces large overlaps of and gaps between filtering kernels for high-frequency probability density functions (PDFs). This is because the size of the filtering kernel is determined using the PDF at the sampled center of the kernel. To reduce those overlaps and gaps, this paper determines the kernel size using the integral of the PDF within the filtering kernel. Our key insight is that these integrals are approximately constant, if kernel centers are sampled using stratified sampling. Therefore, an appropriate kernel size can be obtained by solving this integral equation. Using the proposed kernel size for filtered importance samplingbased VSGL generation, undesirable artifacts are significantly reduced with a negligibly small overhead.

show abstract

“…These methods can render caustics, unlike eye-path tracingbased methods (e.g., cone tracing [27,28]). …”

Section: Real-time Global Illuminationmentioning

confidence: 99%

Modified filtered importance sampling for virtual spherical Gaussian lights

Tokuyoshi¹

2016

Comp. Visual Media

View full text Add to dashboard Cite

show abstract

“…color and normal. Crassin et al [2011] compute ambient occlusion and indirect lighting by cone tracing in a sparse voxel octree. The cone tracing is performed by taking steps along the cone axis, with a step length corresponding to the cone radius, and accumulating quadrilinearly filtered voxel data.…”

Section: Previous Workmentioning

confidence: 99%

“…Both construction and traversal speed has reached impressive heights, which has enabled ray traced effects on top of a rasterized image in real time [Crassin et al 2011]. At high resolutions, SVOs are still much too memory expensive, however, and therefore their applicability has been limited to effects such as rough reflections and ambient occlusion where a low resolution is less noticeable, except at contact.…”

Section: Introductionmentioning

confidence: 99%

High resolution sparse voxel DAGs

2013

View full text Add to dashboard Cite

Figure 1: The EPICCITADEL scene voxelized to a 128K 3 (131 072 3 ) resolution and stored as a Sparse Voxel DAG. Total voxel count is 19 billion, which requires 945MB of GPU memory. A sparse voxel octree would require 5.1GB without counting pointers. Primary shading is from triangle rasterization, while ambient occlusion and shadows are raytraced in the sparse voxel DAG at 170 MRays/sec and 240 MRays/sec respectively, on an NVIDIA GTX680. AbstractWe show that a binary voxel grid can be represented orders of magnitude more efficiently than using a sparse voxel octree (SVO) by generalising the tree to a directed acyclic graph (DAG). While the SVO allows for efficient encoding of empty regions of space, the DAG additionally allows for efficient encoding of identical regions of space, as nodes are allowed to share pointers to identical subtrees. We present an efficient bottom-up algorithm that reduces an SVO to a minimal DAG, which can be applied even in cases where the complete SVO would not fit in memory. In all tested scenes, even the highly irregular ones, the number of nodes is reduced by one to three orders of magnitude. While the DAG requires more pointers per node, the memory cost for these is quickly amortized and the memory consumption of the DAG is considerably smaller, even when compared to an ideal SVO without pointers. Meanwhile, our sparse voxel DAG requires no decompression and can be traversed very efficiently. We demonstrate this by ray tracing hard and soft shadows, ambient occlusion, and primary rays in extremely high resolution DAGs at speeds that are on par with, or even faster than, state-of-the-art voxel and triangle GPU ray tracing.

show abstract

“…Voxel-based global illumination techniques (e.g. [Thiedemann et al 2011] or [Crassin et al 2011]) can perform an approximate light transport even for dynamic objects interactively. Since voxels are normally not aligned to the geometry, they may lead to objectionable artifacts such as light leaks or re-rasterization problems and are therefore very problematic for high-quality lightmap generation.…”

Section: Related Workmentioning

confidence: 99%

Fast light-map computation with virtual polygon lights

Luksch

Tobler

Habel

et al. 2013

Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games

View full text Add to dashboard Cite

Scene illuminated from 9 light sources rendered with a 16MP light map computed from 5,300 virtual lights in 30s. AbstractWe propose a new method for the fast computation of light maps using a many-light global-illumination solution. A complete scene can be light mapped on the order of seconds to minutes, allowing fast and consistent previews for editing or even generation at loading time. In our method, virtual point lights are clustered into a set of virtual polygon lights, which represent a compact description of the illumination in the scene. The actual light-map generation is performed directly on the GPU. Our approach degrades gracefully, avoiding objectionable artifacts even for very short computation times.

show abstract

Interactive indirect illumination using voxel cone tracing

Cited by 56 publications

References 1 publication

Modified filtered importance sampling for virtual spherical Gaussian lights

Modified filtered importance sampling for virtual spherical Gaussian lights

High resolution sparse voxel DAGs

Fast light-map computation with virtual polygon lights

Contact Info

Product

Resources

About