Sort-First Parallel Volume Rendering
Sort-First Parallel Volume Rendering
复制标题
DOI：
10.1109/tvcg.2010.116
复制
发表时间：
2011-08
影响因子：
5.2
通讯作者：
B. Moloney;M. Ament;D. Weiskopf;Torsten Möller
中科院分区：
文献类型：
--
作者：
B. Moloney;M. Ament;D. Weiskopf;Torsten Möller
排序优先分布已被研究和使用远低于排序后分布的并行体绘制，特别是当数据太大，无法完全复制。我们证明，排序第一的分布不仅是一个可行的方法进行数据可扩展的并行体绘制，但更重要的是，他们允许一系列的渲染算法和技术，是不是有效的排序最后的分布。这些算法中的几个进行了讨论，其中两个是在并行环境中实现的：一个新的改进的早期射线终止的变体，以加快渲染时发生体积遮挡和体积阴影技术，产生更真实和信息量更大的图像的基础上半角度切片。还提出了分配负载平衡的计算和细分数据集的加载部分的改进方法。我们对一个典型的GPU集群与分布式内存的详细测试结果表明，我们的排序优先渲染算法优于排序后渲染在许多情况下。
Sort-first distributions have been studied and used far less than sort-last distributions for parallel volume rendering, especially when the data are too large to be replicated fully. We demonstrate that sort-first distributions are not only a viable method of performing data-scalable parallel volume rendering, but more importantly they allow for a range of rendering algorithms and techniques that are not efficient with sort-last distributions. Several of these algorithms are discussed and two of them are implemented in a parallel environment: a new improved variant of early ray termination to speed up rendering when volumetric occlusion occurs and a volumetric shadowing technique that produces more realistic and informative images based on half angle slicing. Improved methods of distributing the computation of the load balancing and loading portions of a subdivided data set are also presented. Our detailed test results for a typical GPU cluster with distributed memory show that our sort-first rendering algorithm outperforms sort-last rendering in many scenarios.