八叉树编码体数据的快速体绘制算法  

Fast Volume Rendering Algorithm of Octree Encoded Volume

作　　者：宋涛[1] 欧宗瑛[1] 王瑜[1] 李冠华[1] 刘斌[1] 

机构地区：[1]大连理工大学精密与特种加工教育部重点实验室,大连116024

出　　处：《计算机辅助设计与图形学学报》2005年第9期1990-1996,共7页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家"八六三"高技术研究发展计划(863306ZD13036)

摘　　要：提出一种基于并行投影ShearWarp分解的射线模板快速RayCasting体绘制算法.体数据采用有效的八叉树存储和表达方案.八叉树的适应性均一化分级策略使得算法在简化了不必要的处理过程的同时,为构建用于RayCasting算法的射线模板和后续的交叉计算提供了有力的应用基础.针对体绘制中八叉树编码体数据构造基本的交叉运算如节点单元定位、区域定位和邻接节点单元搜索的需要,相应地提出了简单而且有效的方法.这些方法是非递归的,在减少比较运算的同时不需要构建中间结果列表,进而减少了对内存的占用和避免了繁重的交叉计算.所提出的体绘制算法能在标准PC平台下快速实现超大型数据集的处理和高质量的人体内部结构图像的绘制.This paper proposes a novel template-based raycasting scheme using Shear-Warp factorization for expediting parallel viewing of volumetric datasets. The volume coding scheme based on an efficient octree data structure is presented and the octree blocks are adaptively chosen to minimize unnecessary access process. The algorithm exploits the uniform shape, orientation and size of the “nonempty” octree blocks by building templates for ray/block intersections in the case of RayCasting. The volume stored in octrees requires basic tree traversal operations such as point location, region location, and neighbor searches. This paper presents simple and efficient methods for performing searching and locating operations that are inherently non-recursive and reduces the number of comparisons with poor predictive behavior. The methods are table-free, thereby reducing memory accesses and avoiding the costly intersection computation. The high quality human body interior images of a large dataset can be generated by the proposed approach on a conventional PC platform.

关 键 词：快速体绘制 八叉树 Shear-Warp分解 射线模板 

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