When it is More Efficient to Use Uniform Grids for Ray Tracing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00180561" target="_blank" >RIV/68407700:21230/11:00180561 - isvavai.cz</a>
Result on the web
<a href="https://www.sgs.cvut.cz/index.php?action=workshop_2011" target="_blank" >https://www.sgs.cvut.cz/index.php?action=workshop_2011</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
When it is More Efficient to Use Uniform Grids for Ray Tracing
Original language description
Commonly used hierarchical data structures such as bounding volume hierarchies and kdtrees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non uniformly populated geometry. We improve on performance using a two-step approach that selects a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů