Parallel SAH k-D Tree Construction

dc.contributor.authorChoi, Bynen_US
dc.contributor.authorKomuravelli, Rakeshen_US
dc.contributor.authorLu, Victoren_US
dc.contributor.authorSung, Hyojinen_US
dc.contributor.authorBocchino, Robert L.en_US
dc.contributor.authorAdve, Sarita V.en_US
dc.contributor.authorHart, John C.en_US
dc.contributor.editorMichael Doggett and Samuli Laine and Warren Hunten_US
dc.date.accessioned2013-10-28T10:21:24Z
dc.date.available2013-10-28T10:21:24Z
dc.date.issued2010en_US
dc.description.abstractThe k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations between rays and the primitives. The highest quality k-D tree can be obtained using greedy cost optimization based on a surface area heuristc (SAH). While the high quality enables very fast ray tracing times, a key drawback is that the k-D tree construction time remains prohibitively expensive. This cost is unreasonable for rendering dynamic scenes for future visual computing applications on emerging multicore systems. Much work has therefore been focused on faster parallel k-D tree construction performance at the expense of approximating or ignoring SAH computation, which produces k-D trees that degrade rendering time. In this paper, we present two new parallel algorithms for building precise SAH-optimized k-D trees, with different tradeoffs between the total work done and parallel scalability. The algorithms achieve up to 8x speedup on 32 cores, without degrading tree quality and rendering time, yielding the best reported speedups so far for precise-SAH k-D tree construction.en_US
dc.description.seriesinformationHigh Performance Graphicsen_US
dc.identifier.isbn978-3-905674-26-2en_US
dc.identifier.issn2079-8687en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/HPG10/077-086en_US
dc.publisherThe Eurographics Associationen_US
dc.titleParallel SAH k-D Tree Constructionen_US
Files