Cache-efficient layouts of bounding volume hierarchies

Computer Graphics Forum

Volumn 25, Issue 3, 2006, Pages 507-516

  Yoon, Sung Eui ^a   Manocha, Dinesh ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; COLLISION AVOIDANCE; COMPUTER GRAPHICS; RAY TRACING; TREES (MATHEMATICS);

BOUNDING VOLUME HIERARCHIES (BVH); CACHE PARAMETERS; POLYGONAL MODELS; BOUNDING VOLUME HIERARCHIES; COLLISION DETECTION; COMPUTATION ALGORITHM; MEMORY HIERARCHY; PROBABILISTIC MODELING; SPATIAL LOCALITY; SPATIAL PARTITIONING;

CACHE MEMORY; BENCHMARKING;

EID: 33748538254     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2006.00970.x     Document Type: Article

References (35)

1. [ABF04] ARGE L., BRODAL G., FAGERBERG R.: Cache oblivious data structures. Handbook on Data Structures and Applications (2004).
2. [ABFC*03] ALSTRUP S., BENDE M. A., FARACH-COLTON E. D. D., M., RAUHE T., THORUP M.: Efficient tree layout in a multilevel memory hierarchy. Computing Research Repository (CoRR) (2003).
3. [AV88] AGGARWAL A., VITTER J. S.: The input/output complexity of sorting and related problems. Commun. ACM 31 (1988), 1116-1127.
4. [CM95] COLEMAN S., MCKINLEY K.: Tile size selection using cache organization and data layout. SIGPLAN Conference on Programming Language Design and Implementation (1995), 279-290.
5. [Dee95] PEERING M. F.: Geometry compression, In SIGORAPH 95 Conference Proceedings (Aug. 1995), Cook R., (Ed.), Annual Conference Series, ACM SIGGRAPH, Addison Wesley, pp. 13-20. held in Los Angeles, California, 06-11 August 1995.
6. [DPS02] DIAZ J., PETIT J., SERNA M.: A survey of graph layout problems. ACM Computing Surveys 34, 3 (2002), 313-356.
7. [Eri04] ERICSON C.: Real-Time Collision Detection. Morgan Kaufmann, 2004.
8. [FLPR99] FRIGO M., LEISBRSON C., PROKOP H., RAMACHANDRAN S.: Cacheoblivious algorithms. Symposium on Foundations of Computer Science (1999), 285-297.
9. [GI99] GIL J., ITAI A.: How to pack trees. Journal of Algorithms (1999).
10. [GLM96] GOTTSCHALK S., LIN M., MANOCHA D.: OBB-Tree: A hierarchical structure for rapid Interference detection. Proc. of ACM Siggraph'96 (1996), 171-180.
11. [Hav97] HAVRAN V.: Cache sensitive representation for the bsp tree. Proc. of Compugraphics (1997).
12. [Hop99] HOPPE H.: Optimization of mesh locality for transparent vertex caching. Proc. of ACM SIGGRAPH (1999), 269-276.
13. [Hub93] HUBBARD P. M.; Interactive collision detection. In Proceedings of IEEE Symposium on Research Frontiers in Virtual Reality (October 1993).
14. [IG03] ISENBURG M., GUMHOLD S.: Out-of-core compression for gigantic polygon meshes, In ACM Trans. on Graphics (Proc. of ACM SIGGRAPH) (2003), vol. 22, pp. 935-942.
15. [IL04] ISENBURO M., LINDSTROM P.: Streaming Meshes. Tech. Rep. UCRL-CONF-201992, LLNL, 2004.
16. [KHM*98] KLOSOWSKI J., HELD M., MITCHELL J., SOWIZRAL H., ZIKAN K.: Efficient collision detection using bounding volume hierarchies of k-dops, IEEE Trans. on Visualization and Computer Graphics 4, I (1998), 21-37.
17. [LP01] LINDSTROM P., PASCUCCI V.: Visualization of large terrains made easy. IEEE Visualization (2001), 363-370.
18. [LYTM06] LAUTERBACH C., YOON S.-E., TUFT D., MANOCHA D.: RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs, Tech. Rep. TR-06-010, Univ. of North Carolina at Chapel Hill, 2006, 2006.
19. [MB90] MACDONALD J. D., BOOTH K. S.: Heuristics for ray tracing using space subdivision. Visual Computer (1990).
20. [MC95] MIRTICH B., CANNY J.: Impulse-based simulation of rigid bodies. In Proc. of ACM Interactive 3D Graphics (Monterey, CA, 1995).
21. [PF01] PASCUCCI V., FRANK R. J.: Global static indexing for real-time explotation of very large regular grids. Super Computing (2001), 225-241.
22. [Sag94] SAGAN H.: Space-Filling Curves. Springer-Verlag, 1994.
23. [SCD02] SEN S., CHATTERJEE S., DUMIRN.: Towaids a theory of cache-efficient algorithms. Journal of the ACM 49 (2002), 828-858.
24. [Ter03] TERDIMAN P.: Opcode: Optimized collision detection, 2003. http://www.codercorner.com/Opcode.htm.
25. [vEB77] VAN EMDB BOAS P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. (1977).
26. [VG91] VELHO L., GOMES J. D.: Digital halftoning with space filling curves. In Computer Graphics (SIGGRAPH '91 Proceedings) (July 1991), Sederberg T. W., (Ed.), vol. 25, pp. 81-90.
27. [Vit01] VITTER J.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys (2001), 209-271.
28. [VM04] VARADHAN G., MANOCHA D.: Accurate minkowski sum approximation of polyhedral models. In Pacific Conference on Computer Graphics and Applications (2004), pp. 392-401.
29. [Wal04] WALD I.; Realtime Ray Tracing and Interactive Global Illumination. PhD thesis, Computer Graphics Group, Saarland University, 2004.
30. [WHG84] WEGHORST H., HOOPER G., GREENBBRG D.: Improved computational methods for ray tracing. ACM Transactions on Graphics (1984), 52-69.
31. [YL06] YOON S.-E., LINDSTROM P.: Mesh Layouts for Block-Based Caches. Tech, Rep, UCRL-TR-220368-DRAFT, Lawrence Livermore National Lab., 2006.
32. [YLM06] YOON S.-E., LAUTERBACH C., MANOCHA D.: R-LODs: Interactive LOD-based Rat Tracing of Massive Models. Tech. Rep. TR-06-009, Univ. of North Carolina at Chapel Hill, 2006, 2006.
33. [YLPM05] YOON S.-E., LINBSTROM P., PASCUCCI V., MANOCHA D.: CacheOblivious Mesh Layouts. Proc. of ACM SIGGRAPH (2005).
34. [YMLP05] YOON S.-E., MANOCHA D., LINDSTROM P., PASCUCCI V.: OpenCCL: Cache-Coherent Layouts of Meshes and Graphs, 2005. http://www.cs.unc.edu/geom/ COL/OpenCCL/.
35. [YSGM04] YOON S.-E., SALOMON B., GAYLE R., MANOCHA D.: Quick-VDR: Interactive View-dependent Rendering of Massive Models, IEEE Visualization (2004), 131-138.