Cache‐Efficient Layouts of Bounding Volume Hierarchies
- 1 September 2006
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 25 (3) , 507-516
- https://doi.org/10.1111/j.1467-8659.2006.00970.x
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Out-of-core compression for gigantic polygon meshesACM Transactions on Graphics, 2003
- Towards a theory of cache-efficient algorithmsJournal of the ACM, 2002
- A survey of graph layout problemsACM Computing Surveys, 2002
- External memory algorithms and data structuresACM Computing Surveys, 2001
- How to Pack TreesJournal of Algorithms, 1999
- Efficient collision detection using bounding volume hierarchies of k-DOPsIEEE Transactions on Visualization and Computer Graphics, 1998
- Digital halftoning with space filling curvesACM SIGGRAPH Computer Graphics, 1991
- Heuristics for ray tracing using space subdivisionThe Visual Computer, 1990
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Improved Computational Methods for Ray TracingACM Transactions on Graphics, 1984