Accelerating Time-Varying Hardware Volume Rendering Using TSP Trees and Color-Based Error Metrics
Accelerating Time-Varying Hardware Volume Rendering Using TSP Trees and Color-Based Error Metrics
复制标题
使用 TSP 树和基于颜色的误差度量加速时变硬件体渲染
DOI：
10.1145/353888.353908
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
D. Ellsworth
中科院分区：
文献类型：
--
作者：
Han;Ling;D. Ellsworth
本文描述了一种新的时变数据硬件体绘制算法。该算法使用时空分区 (TSP) 树数据结构来识别数据中具有空间或时间一致性的区域。通过利用这种一致性，当体积数据大于纹理内存容量时，渲染算法可以通过减少所需的纹理量来提高性能。这种一致性还可以通过适当地渲染平面阴影多边形而不是纹理多边形以及不渲染透明区域来提高速度。为了减少由于使用分层数据结构而引起的多边形化开销，我们使用快速增量多边形切片算法。该论文还引入了新的基于颜色的误差度量，与早期基于标量的度量相比，它可以更准确地识别相干区域。通过显示使用不同数据集和误差指标运行的实验结果，我们证明新方法可以显着提高体渲染性能。
This paper describes a new hardware volume rendering algorithm for time-varying data. The algorithm uses the Time-Space Partitioning (TSP) tree data structure to identify regions within the data that have spatial or temporal coherence. By using this coherence, the rendering algorithm can improve performance when the volume data are larger than the texture memory capacity by decreasing the amount of textures required. This coherence can also allow improved speed by appropriately rendering flat-shaded polygons instead of textured polygons, and by not rendering transparent regions. To reduce the polygonization overhead caused by the use of the hierarchical data structure, we use a fast incremental polygon slicing algorithm. The paper also introduces new color-based error metrics, which more accurately identify coherent regions compared to the earlier scalar-based metrics. By showing experimental results from runs using different data sets and error metrics, we demonstrate that the new methods give substantial improvements in volume rendering performance.