作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (20): 202-204. doi: 10.3969/j.issn.1000-3428.2009.20.072

• 图形图像处理 • 上一篇    下一篇

基于改进四叉树分割和结点存储的LOD算法

罗景馨,唐 琎   

  1. (中南大学信息科学与工程学院,长沙 410075)

  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-10-20 发布日期:2009-10-20

LOD Algorithm Based on Improved Quadtree-split and Node Storage

LUO Jing-xin, TANG Jin   

  1. (School of Information Science and Engineering, Central South University, Changsha 410075)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-10-20 Published:2009-10-20

摘要: 多层次细节(LOD)算法作为目前使用最多的地形数据简化算法,对提升渲染速度加快场景可视化有着重要作用,而其中以基于四叉树的LOD算法应用最为广泛。通过对以往算法的研究,提出一种对四叉树的分割和结点存储结构同时进行改进的LOD算法。该算法通过减少误差判断次数加快了四叉树的生成速度,同时改变传统的结点存储方式,降低了数据的冗余存储。

关键词: 数字高程模型, 多层次细节, 四叉树, 多分辨率

Abstract: At present, as the most widely used in terrain data segmentation, Level Of Detail(LOD) plays an important role to increase the speed of terrain rendering and scene visualization. Applying the most comprehensive LOD algorithm is based on quadtree. By the study of existing algorithm, this paper introduces a LOD algorithm based on improved quadtree-split and node storage. In order to expedite the speed of quadtree generation, the times of error judgment is dwindled down. And at the same time, a new node storage structure means much less redundant data stored than traditional way.

Key words: Digital Elevation Model(DEM), Level Of Detail(LOD), quadtrees, multi-resolution

中图分类号: