地形漫游中数据块调度算法研究  

Research on block scheduling algorithm for terrain walkthrough

作　　者：姜昱明[1] 胡曼丽[1] 

机构地区：[1]西安电子科技大学计算机学院,陕西西安710071

出　　处：《计算机工程与设计》2007年第15期3743-3745,3786,共4页Computer Engineering and Design

摘　　要：在LOD(level-of-detail)算法基础上,提出处理视点相关的交互式大规模地形数据的方法。包括:分块策略对规则网格进行区域分割;通过输入的数据点构建自顶向下的四叉树结构,划分成不同的块层次;在实时漫游过程中,根据视点z轴坐标值的变化导致块层次的改变,重新调入相应数据块构造地形网格,以及当视点x,y轴坐标改变时进行块调度。实验证明了该算法的有效性。An approach for interactive view-dependent managing massive terrain data based on level-of-detail （LOD） algorithm is presented. The approach includes dividing the whole terrain into equal-size blocks, constructing an up-down quad tree by dividing the input data points into different block hierarchies, in real-time walkthrough, folding new data blocks to construct terrain grid according to the change of block hierarchy leaded by the change of the current viewpoint＇s z coordinates, and scheduling the blocks according to current viewpoint＇s x and y coordinates. The simulation proves the effectiveness of the algorithm.

关 键 词：地形漫游 细节层次 地形分块 块层次 块调度 

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