摘要： 直接体绘制是三维数据可视化的重要方法。在实际应用中体数据规模庞大，如何降低计算工作量以获得更高的绘制速度是一个亟待解决的问题。文章针对该问题提出了一种运行于集群系统之上的基于稀疏矩阵的并行Splatting体绘制算法，该算法利用稀疏矩阵对体数据结构进行优化，通过实验获得了令人满意的结果。
关键词:
直接体绘制,
Splatting算法,
稀疏矩阵
Abstract: The direct volume rendering is the important method of visualization of three-D data. Because the scale of volume data is very big in application, it is urgent how to decrease the computation workload to get higher speed of rendering. This paper proposes a parallel Splatting volume rendering algorithm based on sparse matrix which runs in cluster system. This algorithm uses sparse matrix to optimize volume data structure and gets satisfied results from the experiments.
Key words:
Direct volume rendering,
Splatting algorithm,
Sparse matrix
中图分类号:
魏继增;孙济洲;李小图. 基于稀疏矩阵的并行体绘制算法[J]. 计算机工程, 2007, 33(10): 187-189,.
WEI Jizeng; SUN Jizhou; LI Xiaotu. Parallel Volume Rendering Algorithm Based on Sparse Matrix[J]. Computer Engineering, 2007, 33(10): 187-189,.