13496

Fast, Memory-Efficient Construction of Voxelized Shadows

Viktor Kampe, Erik Sintorn, Ulf Assarsson
Chalmers University of Technology
Chalmers University of Technology, 2015

@article{kampe2015fast,

   title={Fast, Memory-Efficient Construction of Voxelized Shadows},

   author={K{"a}mpe, Viktor and Sintorn, Erik and Assarsson, Ulf},

   year={2015}

}

Download Download (PDF)   View View   Source Source   

732

views

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. 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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: