Parallel sah k-D tree construction

Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Sung, Robert L. Bocchino, Sarita V. Adve, John C. Hart

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The 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 8? 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.

Original languageEnglish (US)
Title of host publicationHigh-Performance Graphics 2010 - ACM SIGGRAPH / Eurographics Symposium Proceedings, HPG 2010
EditorsSamuli Laine, Warren Hunt, Michael Doggett
PublisherAssociation for Computing Machinery
Pages77-86
Number of pages10
ISBN (Print)9783905674262
StatePublished - Jun 25 2010
Event2nd ACM SIGGRAPH / Eurographics on High-Performance Graphics, HPG 2010 - Saarbrucken, Germany
Duration: Jun 25 2010Jun 27 2010

Publication series

NameHigh-Performance Graphics - ACM SIGGRAPH / Eurographics Symposium Proceedings, HPG
ISSN (Print)2079-8679
ISSN (Electronic)2079-8687

Other

Other2nd ACM SIGGRAPH / Eurographics on High-Performance Graphics, HPG 2010
CountryGermany
CitySaarbrucken
Period6/25/106/27/10

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Parallel sah k-D tree construction'. Together they form a unique fingerprint.

  • Cite this

    Choi, B., Komuravelli, R., Lu, V., Sung, H., Bocchino, R. L., Adve, S. V., & Hart, J. C. (2010). Parallel sah k-D tree construction. In S. Laine, W. Hunt, & M. Doggett (Eds.), High-Performance Graphics 2010 - ACM SIGGRAPH / Eurographics Symposium Proceedings, HPG 2010 (pp. 77-86). (High-Performance Graphics - ACM SIGGRAPH / Eurographics Symposium Proceedings, HPG). Association for Computing Machinery.