CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Fast, Memory-Efficient Construction of Voxelized Shadows

Viktor Kämpe (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Erik Sintorn (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Dan Dolonius (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Ulf Assarsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
IEEE Transactions on Visualization and Computer Graphics (1077-2626). Vol. 22 (2016), 10, p. 2239-2248.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Shadow, voxel, directed acyclic graph, real-time, Computer Science

Denna post skapades 2016-09-30.
CPL Pubid: 242737


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)


Data- och informationsvetenskap

Chalmers infrastruktur