适用于GPU的四面体体数据规则化与可视化  

GPU-Friendly Regularization and Volume Rendering of Tetrahedral Volumetric Datasets

作　　者：叶樉[1] 李昕[1,2] 王桂珍[1] 陈海东[1] 陈为[1] 周敏[3] 

机构地区：[1]浙江大学CAD&CG国家重点实验室,杭州310058 [2]中国石油大学(华东)计算机与通信工程学院,青岛266555 [3]浙江大学医学院附属第一医院放射科,杭州310003

出　　处：《计算机辅助设计与图形学学报》2011年第6期933-940,共8页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(60873123);国家"九七三"重点基础研究发展计划项目(2010CB732504);国家"八六三"高技术研究发展计划(2009AA062700)

摘　　要：为实现三维不规则体数据场的高效绘制,提出一种适用于GPU的四面体体数据规则化和可视化算法.将以四面体为基本单元的稀疏体数据用一个有限深度的八叉树结构逼近,并将逼近误差表达为一个离散的完全空间哈希结构;然后将半规则的八叉树转换为规则的八叉树纹理(三维),并将完全空间哈希表转换为三维查找表,两者均可在绘制时快速随机取值,故可直接作为三维纹理在GPU中访问.通过这种双规则化的表示方法,可将四面体体数据的可视化转化为在GPU中并行地绘制2种三维纹理.实验结果表明,该算法在处理空间稀疏体数据时保证了较高的精度,同时减少了数据存储量.To efficiently visualize 3D irregular volumetric datasets,we present a novel approach for GPU-friendly regularization and rendering of tetrahedral volumetric datasets.The key idea is that a sparse tetrahedral volumetric data can be approximated by an octree with a limited depth,and the residual errors can be represented by a hashing table generated by the perfect spatial hashing technique.By converting the octree and the hashing table into an octree texture and a 3D lookup table respectively,a regular and array-wise representation for the underlying dataset is constructed.This dual-regularization reformulation not only allows for random access in GPU,but also makes the visualization of tetrahedral volumetric datasets be identical to rendering two 3D regular textures.Experimental results demonstrate that high quality can be achieved with much less memory consumption than previous approaches when handling sparse datasets.

关 键 词：体绘制 非规则 GPU 八叉树 完全空间哈希 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]