Cache-oblivious mesh layouts
- Univ. of North Carolina, Chapel Hill, NC (United States)
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
We present a novel method for computing cache-oblivious layouts of large meshes that improve the performance of interactive visualization and geometric processing algorithms. Given that the mesh is accessed in a reasonably coherent manner, we assume no particular data access patterns or cache parameters of the memory hierarchy involved in the computation. Furthermore, our formulation extends directly to computing layouts of multi-resolution and bounding volume hierarchies of large meshes. We develop a simple and practical cache-oblivious metric for estimating cache misses. Computing a coherent mesh layout is reduced to a combinatorial optimization problem. We designed and implemented an out-of-core multilevel minimization algorithm and tested its performance on unstructured meshes composed of tens to hundreds of millions of triangles. Our layouts can significantly reduce the number of cache misses. We have observed 2-20 times speedups in view-dependent rendering, collision detection, and isocontour extraction without any modification of the algorithms or runtime applications.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 878195
- Report Number(s):
- UCRL-JRNL-211774; TRN: US0602283
- Journal Information:
- ACM Transaction on Graphics, Vol. 24, Issue 3; ISSN 0730-0301
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multi-core and Many-core Shared-memory Parallel Raycasting Volume Rendering Optimization and Tuning
Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning