利用有序数据结构实现Shear-Warp加速算法  

Real-time shear-warp algorithm based on sorted volumetric data structure

作　　者：汤敏[1] 

机构地区：[1]南通大学电气工程学院,江苏南通226007

出　　处：《计算机工程与设计》2008年第5期1213-1214,1217,共3页Computer Engineering and Design

摘　　要：提出一种有序数据结构,在不影响算法效果的前提下,改进并加速Shear-Warp算法的运行速度。将体数据每个层片编码成以体素值为序的有序数组,依据不透明度函数确定不透明体素所对应的体素值范围。通过对有序数组的截取,快速定位不透明体素,跳过所有的透明体素,提高绘制速度。在普通配置计算机上验证该算法,绘制过程一般在数秒内即可完成。该算法思路明晰、操作便捷,在不影响图像质量的前提下显著提高绘制速度,满足实时性的要求。A novel sorted volumetric data structure is proposed to speed up the Shear-Warp algorithm. First, each slice of the volume is transferred into an array indexed by the value of voxels, then the value ranges of non-transparent voxels are decided according to the opacity transfer function. By marching through the sorted arrays, transparent voxels are rapidly located and then skipped, therefore the speed of the Shear-Warp algorithm is accelerated noticeably. The method is implemented in common-configuration personal computer and the rendering process is always completed in several seconds. The proposed algorithm is simple and easy to realize and the volume rendering process is improved without affecting image quality remarkably.

关 键 词：SHEAR-WARP算法 数据结构 体绘制 科学计算可视化 医学图像 

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