Fast, Memory-Efficient Construction of Voxelized Shadows

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 l...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on visualization and computer graphics
Main Authors Kampe, Viktor, Sintorn, Erik, Dolonius, Dan, Assarsson, Ulf
Format Journal Article
LanguageEnglish
Published United States 09.03.2016
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1941-0506