计算机工程与科学2011，Vol.33Issue(3)：57-61,5.DOI:10.3969/j.issn.1007-130X.2011.03.011
基于满二叉树分块策略的大规模数据场纹理映射体绘制算法
Texture_Based Volume Rendering Using Full Binary Tree Partitioning for Large Datasets
摘要
Abstract
In order to break through the limitation of GPU memory for the traditional texture_based volume rendering, an effective technique utilizing 3D texture partitioning based on full binary tree is presented for rendering large-scale volume datasets interactively on general purpose GPU . Using the Fragment Programming capability of commodity graphics cards, the texture data is transferred to a 1D color lookup table and a working set of dynamic texture datasets equivalent to the volume dataset size.The working set manages the boundaries between blocks with the help of abstract partitioning and inherited attributes. The experimental results show that this method is efficient for rendering large-scale volume datasets at an interactive rate on general purpose PCs.关键词
满二叉树/纹理分块/体绘制/三维纹理映射/GPGPUKey words
full binary tree/ texture partitioning/ volume rendering/ 3D texture mapping/ GPGPU分类
信息技术与安全科学引用本文复制引用
孙安玉,江贵平..基于满二叉树分块策略的大规模数据场纹理映射体绘制算法[J].计算机工程与科学,2011,33(3):57-61,5.基金项目
国家自然科学基金资助项目(30970866) （30970866）
