Lightcut Interpolation (Unknown language)

How to get this document?

Download
Commercial Copyright fee: €14.50 Basic fee: €4.00 Total price: €18.50
Academic Copyright fee: €4.50 Basic fee: €2.00 Total price: €6.50

Many-light rendering methods replace multi-bounce light transport with direct lighting from many virtual point light sources to allow for simple and efficient computation of global illumination. Lightcuts build a hierarchy over virtual lights, so that surface points can be shaded with a sublinear number of lights while minimizing error. However, the original algorithm needs to run on every shading point of the rendered image. It is well known that the performance of Lightcuts can be improved by exploiting the coherence between individual cuts. We propose a novel approach where we invest into the initial lightcut creation at representative cache records, and then directly interpolate the input lightcuts themselves as well as per-cluster visibility for neighboring shading points. This allows us to improve upon the performance of the original Lightcuts algorithm by a factor of 4-8 compared to an optimized GPU-implementation of Lightcuts, while introducing only a small additional approximation error. The GPU-implementation of our technique enables us to create previews of Lightcuts-based global illumination renderings.

Table of contents conference proceedings

The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.

1
Exploring and Expanding the Continuum of OIT Algorithms
Wyman, Chris | 2016
13
SVGPU: Real Time 3D Rendering to Vector Graphics Formats
Ellis, Apollo I. / Hunt, Warren / Hart, John C. | 2016
23
Masked Software Occlusion Culling
Hasselgren, Jon / Andersson, Magnus / Akenine-Möller, Tomas | 2016
33
Watertight Ray Traversal with Reduced Precision
Vaidyanathan, Karthik / Akenine-Möller, Tomas / Salvi, Marco | 2016
41
Efficient Stackless Hierarchy Traversal on GPUs with Backtracking in Constant Time
Binder, Nikolaus / Keller, Alexander | 2016
51
Bandwidth-Efficient BVH Layout for Incremental Hardware Traversal
Liktor, Gabor / Vaidyanathan, Karthik | 2016
63
DIRT: Deferred Image-based Ray Tracing
Vardis, Konstantinos / Vasilakis, Andreas-Alexandros / Papaioannou, Georgios | 2016
75
Photon Splatting Using a View-Sample Cluster Hierarchy
Moreau, Pierre / Sintorn, Erik / Kämpe, Viktor / Assarsson, Ulf / Doggett, Michael | 2016
87
Deep G-Buffers for Stable Global Illumination Approximation
Mara, Michael / McGuire, Morgan / Nowrouzezahrai, Derek / Luebke, David | 2016
99
Lightcut Interpolation
Rehfeld, Hauke / Dachsbacher, Carsten | 2016
109
GVDB: Raytracing Sparse Voxel Database Structures on the GPU
Hoetzlein, Rama Karl | 2016
119
Local Shading Coherence Extraction for SIMD-Efficient Path Tracing on CPUs
Áfra, Attila T. / Benthin, Carsten / Wald, Ingo / Munkberg, Jacob | 2016
129
Adaptive Sampling for On-The-Fly Ray Casting of Particle-based Fluids
Hochstetter, Hendrik / Orthmann, Jens / Kolb, Andreas | 2016
139
Infinite Resolution Textures
Reshetov, Alexander / Luebke, David | 2016
151
Filtering Distributions of Normals for Shading Antialiasing
Kaplanyan, Anton S. / Hill, Stephen / Patney, Anjul / Lefohn, Aaron | 2016
163
Comparison of Projection Methods for Rendering Virtual Reality
Toth, Robert / Nilsson, Jim / Akenine-Möller, Tomas | 2016
173
A Fast, Massively Parallel Solver for Large, Irregular Pairwise Markov Random Fields
Thuerck, Daniel / Waechter, Michael / Widmer, Sven / Buelow, Max von / Seemann, Patrick / Pfetsch, Marc E. / Goesele, Michael | 2016
Feedback