.png){kind=icon}
返回
Cache-oblivious mesh layouts
.png){kind=icon}
OA
AI
DOI：10.1145/1073204.1073278.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.8K
被引数:
3.6W
机构
暂无机构信息
引用论文
分享收藏Regulation of the dauBAR operon and characterization of d-amino acid dehydrogenase DauA in arginine and lysine catabolism of Pseudomonas aeruginosa PAO1.png)
MicrobiologyOAAI
MicrobiologyIF0
OAAI分享收藏
查看更多内容