返回
gkDtree: A group-based parallel update kd-tree for interactive ray tracing
DOI:10.1016/j.sysarc.2011.06.003.png)
摘要
En 中文
This paper proposes a new group-based acceleration data structure called gkDtree for interactive ray tracing of dynamic scenes. The main idea of the gkDtree is to construct the acceleration structure with a multi-level hierarchy, and to integrate a parallelization approach to result in a faster update and a more efficient tree traversal. A gkDtree can be viewed as a set of kd-trees, each of which is a local acceleration structure corresponding to a group. For a gkDtree, a scene is divided into several groups based on a scene graph. The local acceleration structure of each group involving only dynamic primitives is rebuilt. To achieve higher parallelization, dependencies among groups in different levels are removed before rebuilding occurs in parallel. To enhance the scalability of parallelization, a simple and fast load-balancing scheme is introduced. Furthermore, we apply a variety of accurate SAH (surface area heuristic) algorithms into tree generation for both static and dynamic groups. The experimental results show that a gkDtree has a real-time update performance. It has an update performance that is up to 166 times faster than a kd-tree for our test scenes in a six-core hardware system environment. Furthermore, the results also show that tree traversal performance of a gkDtree is competitive with that of a kd-tree. (c) 2011 Elsevier B.V. All rights reserved.
Keyword:
Ray tracing
Kd-tree
Dynamic scene
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
引用论文
Census data aggregation decisions can affect population‐level inference in heterogeneous populations
A Case of ST Segment Elevation Myocardial Infarction Within 24 h of a Third Dose of COVID-19 mRNA Vaccine一例接种第三剂COVID-19 mRNA疫苗24小时内发生的ST段抬高型心肌梗死
The Economic Impact of HIV/AIDS on the Construction Sector: Supply Side Implications for Housing Policy艾滋病对建筑行业经济影响的供给面含义及住房政策影响

