Title: | Efficient acceleration structure layout for 64-bit many-core architectures |
Authors: | Shevtsov, Maxim Soupikov, Alexei |
Citation: | WSCG ’2010: Poster Proceedings: 18th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS, p. 53-56. |
Issue Date: | 2010 |
Publisher: | Václav Skala - UNION Agency |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/WSCG2010/Papers_2010/!_2010_Poster-proceedings.pdf http://hdl.handle.net/11025/1116 |
ISBN: | 978-80-86943-86-2 |
Keywords: | vykreslování;struktura zrychlení;kd strom;sledování paprsku;proximitní vyhledávání |
Keywords in different language: | rendering;acceleration structure;kd tree;ray tracing;proximity search |
Abstract: | A lot of rendering solutions use an acceleration structure to reduce the complexity of solving geometric proximity search problems. Although acceleration structures are well studied, data exceeding 32 bit address space require an acceleration structure with special properties, such as compact memory layout, efficient traversal capability, memory address space independence, parallel construction capability and 32/64 bit efficiency. We propose a specific memory layout for a kd-tree and methods of processing that data structure handling massive models with the highest efficiency possible. The components of that are easily applied to other hierarchical acceleration structure types as well. |
Rights: | © Václav Skala - UNION Agency |
Appears in Collections: | WSCG '2010: Poster Paper Proceedings |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Shevtsov.pdf | 766,01 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/1116
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.