Memory-scalable GPU spatial hierarchy construction

IEEE Transactions on Visualization and Computer Graphics

Volumn 17, Issue 4, 2011, Pages 466-474

  Hou, Qiming ^a,b   Sun, Xin ^b,c   Zhou, Kun ^c   Lauterbach, Christian ^d   Manocha, Dinesh ^d  

^a TSINGHUA UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c ZHEJIANG UNIVERSITY   (China)

^d University of North Carolina   (United States)

Author keywords

bounding volume hierarchy; kd tree; Memory bound

Indexed keywords

BOUNDING VOLUME HIERARCHIES; BOUNDING-VOLUME HIERARCHY; BREADTH-FIRST SEARCH; COMPLEX MODEL; CONSTRUCTION ALGORITHMS; CONSTRUCTION ORDER; CONTROL MEMORY; CPU MEMORY; DURING CONSTRUCTION; GPU ALGORITHMS; INTERACTIVE APPLICATIONS; INTERACTIVE RATES; KD-TREE; MASSIVE PARALLELISM; MEMORY ALLOCATION; MEMORY BOUNDS; MEMORY FRAGMENTATION; MEMORY USAGE; ORDER OF MAGNITUDE; OUT-OF-CORE; PEAK MEMORY CONSUMPTION; SPATIAL HIERARCHY; TWO-HIERARCHY;

ALGORITHMS; DATA TRANSFER; ITERATIVE METHODS; PROGRAM PROCESSORS;

TREES (MATHEMATICS);

EID: 79951946355     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2010.88     Document Type: Article

References (16)

1. K. Zhou, Q. Hou, R. Wang, and B. Guo, "Real-Time KD-Tree Construction on Graphics Hardware," ACM Trans. Graphics, vol. 27, no. 5, p. 126, 2008.
2. C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, and D. Manocha, "Fast BVH Construction on GPUs," Proc. Eurographics '09, 2009.
3. J. Goldsmith and J. Salmon, "Automatic Creation of Object Hierarchies for Ray Tracing," IEEE Co (Pubitemid 17598108)
4. J.D. MacDonald and K.S. Booth, "Heuristics for Ray Tracing Using Space Subdivision," The Visual Computer, vol. 6, no. 3, pp. 153-166, 1990.
5. W. Hunt, W.R. Mark, and G. Stoll, "Fast KD-Tree Construction with an Adaptive Error-Bounded Heuristic," Proc. IEEE Symp. Interactive Ray Tracing '06, pp. 81-88, Sept. 2006. (Pubitemid 351577015)
6. M. Shevtsov, A. Soupikov, and A. Kapustin, "Highly Parallel Fast KD-Tree Construction for Interactive Ray Tracing of Dynamic Scenes," Proc. Eurographics '07, pp. 395-404, 2007. (Pubitemid 47606917)
7. A. Soupikov, M. Shevtsov, and A. Kapustin, "Improving Kd-Tree Quality at a Reasonable Construction Cost," Proc. IEEE Symp. Interactive Ray Tracing '08, pp. 67-72, Sept. 2008.
8. I. Wald, "On Fast Construction of SAH-Based Bounding Volume Hierarchies," Proc. IEEE Symp. Interactive Ray Tracing '07, pp. 33- 40, Sept. 2007.
9. I. Wald, T. Ize, and S.G. Parker, "Special Section: Parallel Graphics and Visualization: Fast, Parallel, and Asynchronous Construction of BVHs for Ray Tracing Animated Scenes," Computers and Graphics, vol. 32, no. 1, pp. 3-13, 2008. (Pubitemid 351635632)
10. M. Ernst and G. Greiner, "Early Split Clipping for Bounding Volume Hierarchies," Proc. IEEE Symp. Interactive Ray Tracing '07, pp. 73-78, Sept. 2007.
11. C. Wachter and A. Keller, "Terminating Spatial Hierarchies by A Priori Bounding Memory," Proc. IEEE Symp. Interactive Ray Tracing '07, pp. 41-46, Sept. 2007.
12. C. Lauterbach, S.-E. Yoon, M. Tang, and D. Manocha, "Reduce M: Interactive and Memory Efficient Ray Tracing of Large Models," Computer Graphics Forum, vol. 27, no. 4, pp. 1313-1321, 2008.
13. L. Seiler, D. Carmean, E. Sprangle, T. Forsyth, M. Abrash, P. Dubey, S. Junkins, A. Lake, J. Sugerman, R. Cavin, R. Espasa, E. Grochowski, T. Juan, and P. Hanrahan, "Larrabee: A Many-Core x86 Architecture for Visual Computing," ACM Trans. Graphics, vol. 27, no. 3, pp. 1-15, 2008.
14. B.C. Budge, T. Bernardin, S. Sengupta, K.I. Joy, and J.D. Owens, "Out-of-Core Data Management for Path Tracing on Hybrid Resources," Proc. Eurographics '09, 2009.
15. X.-H. Sun and L.M. Ni, "Scalable Problems and Memory- Bounded Speedup," J. Parallel and Distributed Computing, vol. 19, no. 1, pp. 27-37, 1993.
16. I. Wald and V. Havran, "On Building Fast kd-Trees for Ray Tracing, and on Doing That in O(N log N)," Proc. IEEE Symp. Interactive Ray Tracing '06, pp. 61-69, Sept. 2006. (Pubitemid 351577013)