Efficient virtual shadow maps for many lights

Olsson, Ola; Sintorn, Erik; Kämpe, Viktor; Billeter, Markus; Assarsson, Ulf

doi:10.1145/2556700.2556701

Cited by 11 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another aspect of rendering scenes with many lights is accounting for multiple shadow sources. Shadow rendering poses a serious challenge, especially in the presence of many light sources, as both the rendering times [16] and shadow quality [17] have to be considered.…”

Section: Discussionmentioning

confidence: 99%

Hierarchical data structures in rendering scenes containing a massive number of light sources

Lamecki¹,

Kaczmarski²,

Porter-Sobieraj³

2022

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

In order to speed up the process of rendering scenes containing many light sources, spatial data structures are used, which allow the number of lights processed for each pixel to be reduced during lighting computation. Examples of algorithms using such data structures are clustered shading and hybrid lighting. Alongside the rendering time, it is important to consider memory consumption resulting from processing a large number of lights. This paper presents a novel modification of the hybrid lighting algorithm using an octree that allows for a significant reduction in the amount of memory required to store the data structure.The proposed modification uses an octree to store the information about the rendered space. Detailed analysis of the proposed algorithm, and numerical results obtained for various 3D scenes, as well as different input data, all prove that the proposed method significantly reduces the memory required to store lists of lights used by the algorithm.

show abstract

Section: Discussionmentioning

confidence: 99%

Hierarchical data structures in rendering scenes containing a massive number of light sources

Lamecki¹,

Kaczmarski²,

Porter-Sobieraj³

2022

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

show abstract

“…Light culling and selection is also used by screen‐space clustering methods, linked to tiled shading [OA11, OBA12, HMY12]. Views are then produced for each tile instead of each light in the form of a cube map that can be organized into a tiled virtual shadow map, which facilitates resolution optimizations [OSK*14, OBS*15]. Nevertheless, the method is mostly limited to light gathering, as no actual renderings are produced for the VPLs.…”

Section: Related Workmentioning

confidence: 99%

MegaViews: Scalable Many‐View Rendering With Concurrent Scene‐View Hierarchy Traversal

Kol

Bauszat

Lee

et al. 2018

Computer Graphics Forum

View full text Add to dashboard Cite

We present a scalable solution to render complex scenes from a large amount of viewpoints. While previous approaches rely either on a scene or a view hierarchy to process multiple elements together, we make full use of both, enabling sublinear performance in terms of views and scene complexity. By concurrently traversing the hierarchies, we efficiently find shared information among views to amortize rendering costs. One example application is many‐light global illumination. Our solution accelerates shadow map generation for virtual point lights, whose number can now be raised to over a million while maintaining interactive rates.

show abstract

“…These techniques do not explicitly take shadowing into account, however. In a recent paper by Olsson et al [2014], real-time shadows for hundreds of lights are shown to be feasible by carefully rendering only those parts of the shadow maps that are required and only at a resolution that gives an approximate one-to-one mapping between view samples and shadow-map samples. This latter restriction means that the shadow-casting geometry might be gravely undersampled, but the method shows promising results and is currently the best candidate in a setting where all geometry is dynamic.…”

Section: Previous Workmentioning

confidence: 99%

Fast, Memory-Efficient Construction of Voxelized Shadows

Kämpe

Sintorn

Dolonius

et al. 2016

IEEE Trans. Visual. Comput. Graphics

Self Cite

View full text Add to dashboard Cite

We present a fast and memory efficient algorithm for generating Compact Precomputed Voxelized Shadows. By performing much of the common sub-tree merging before identical nodes are ever created, we improve construction times by several orders of magnitude for large data structures, and require much less working memory. To further improve performance, we suggest two new algorithms with which the remaining common sub-trees can be merged. We also propose a new set of rules for resolving undefined regions, which significantly reduces the final memory footprint of the already heavily compressed data structure. Additionally, we examine the feasibility of using CPVS for many local lights and present two improvements to the original algorithm that allow us to handle hundreds of lights with high-quality, filtered shadows at real-time frame rates.

show abstract

Efficient virtual shadow maps for many lights

Cited by 11 publications

References 12 publications

Hierarchical data structures in rendering scenes containing a massive number of light sources

Hierarchical data structures in rendering scenes containing a massive number of light sources

MegaViews: Scalable Many‐View Rendering With Concurrent Scene‐View Hierarchy Traversal

Fast, Memory-Efficient Construction of Voxelized Shadows

Contact Info

Product

Resources

About