Title: When It Makes Sense to Use Uniform Grids for Ray Tracing
Authors: Hapala, Michal
Karlík, Ondřej
Havran, Vlastimil
Citation: WSCG '2011: Communication Papers Proceedings: The 19th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 193-200.
Issue Date: 2011
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2011/!_2011_WSCG-Short_Papers.pdf
ISBN: 978-80-86943-82-4
Keywords: trasování paprsku;sledování paprsku;uniformní mřížka;kd strom;hierarchické datové struktury
Keywords in different language: ray tracing;ray casting;uniform grid;kd tree;hierarchical data structures
Abstract: Commonly used hierarchical data structures such as bounding volume hierarchies and kd-trees 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 combines both approaches: first we build a uniform grid and test its performance. Second, using an estimate on the number of rays to be queried we either continue using the grid or build a hierarchical data structure instead. This way we select a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time. We evaluate the properties of this method for a set of 28 scenes.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2011: Communication Papers Proceedings

Files in This Item:
File Description SizeFormat 
Hapala.pdfPlný text3,05 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/10835

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.