| dc.contributor.author | Karras, Tero | en_US |
| dc.contributor.editor | Carsten Dachsbacher and Jacob Munkberg and Jacopo Pantaleoni | en_US |
| dc.date.accessioned | 2013-10-28T10:23:56Z | |
| dc.date.available | 2013-10-28T10:23:56Z | |
| dc.date.issued | 2012 | en_US |
| dc.identifier.isbn | 978-3-905674-41-5 | en_US |
| dc.identifier.issn | 2079-8679 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/EGGH/HPG12/033-037 | en_US |
| dc.description.abstract | A number of methods for constructing bounding volume hierarchies and point-based octrees on the GPU are based on the idea of ordering primitives along a space-filling curve. A major shortcoming with these methods is that they construct levels of the tree sequentially, which limits the amount of parallelism that they can achieve. We present a novel approach that improves scalability by constructing the entire tree in parallel. Our main contribution is an in-place algorithm for constructing binary radix trees, which we use as a building block for other types of trees. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data types | en_US |
| dc.title | Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees | en_US |
| dc.description.seriesinformation | Eurographics/ ACM SIGGRAPH Symposium on High Performance Graphics | en_US |
