计算可视化的一个快速三维旋转算法.pdfVIP

第 20 卷第 4 期 系 统 仿 真 学 报© Vol. 20 No. 4 2008 年 2 月 Journal of System Simulation Feb., 2008 计算可视化的一个快速三维旋转算法 赵 陌 （山东大学信息科学与工程学院，济南 250100 ） 摘 要：为了实现科学计算过程中动态对象的三维图形生成，提出了一个动态平行投影模型；在此 基础上，导出了万能平行投影公式；通过对万能平行投影公式的分析，提出了一个新的三维图形旋 转算法—投影平面自适应跟随算法（PPAF ）。分析和仿真表明，PPAF 的时空复杂度显著降低，相对 于固定投影平面算法（FPP ），计算速度可提高三倍以上，使动态对象的快速三维连续旋转成为可能。 运算实例验证和展示了算法的运算效率和图形质量。 关键词：计算可视化；三维旋转算法；平行投影；动态投影模型 中图分类号：TP391.41 文献标识码：A 文章编号：1004-731X (2008) 04-0938-06 Rapid 3D Rotation Algorithm for Visualizations of Computing Processes ZHAO Mo （School of Information Science Engineering, Shandong University, Jinan 250100, China） Abstract: In order to generate 3D graphics of moving objects in scientific computing processes, a dynamic parallel projection model was proposed. Based on this model, a general parallel projection expression-the All-purpose Parallel Projective Formula (APPF) was educed. Through the analysis of APPF, a new rotation algorithm for 3D computer graphics-the algorithm with Projective Plane Adaptively Following (PPAF) was put forward. It is proved by both analysis and simulation that the space-time complexity of PPAF reduces so greatly that the computing speed increases by more than three times compared to the algorithm with Fixed Projection Plan (FPP). Consequently, this makes it possible to realize the rapid continuous rotation of 3D graphics. These advantages are well illustrated by practical examples. Key words: computing visualization; 3D rotation algorithm; parallel projection; dynamic projective model