Fast, Memory-Efficient Construction of Voxelized Shadows
| Autor: | Dan Dolonius, Erik Sintorn, Viktor Kämpe, Ulf Assarsson |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer science
business.industry Working memory Approximation algorithm 020207 software engineering 02 engineering and technology Directed acyclic graph Frame rate Data structure Computer Graphics and Computer-Aided Design Set (abstract data type) 03 medical and health sciences 0302 clinical medicine Compressed data structure Memory management Signal Processing 0202 electrical engineering electronic engineering information engineering Memory footprint Computer vision Computer Vision and Pattern Recognition Artificial intelligence business 030217 neurology & neurosurgery Software |
| Zdroj: | IEEE Transactions on Visualization and Computer Graphics. 22:2239-2248 |
| ISSN: | 1077-2626 |
| DOI: | 10.1109/tvcg.2016.2539955 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|