首页 | 官方网站   微博 | 高级检索  
     

基于改进四叉树分割和结点存储的LOD算法
引用本文:罗景馨,唐琎.基于改进四叉树分割和结点存储的LOD算法[J].计算机工程,2009,35(20):202-204.
作者姓名:罗景馨  唐琎
作者单位:中南大学信息科学与工程学院,长沙,410075
基金项目:国家自然科学基金资助项目"NSFC重大专项--高速公路车辆智能驾驶中的关键科学问题研究" 
摘    要:多层次细节(LOD)算法作为目前使用最多的地形数据简化算法,对提升渲染速度加快场景可视化有着重要作用,而其中以基于四叉树的LOD算法应用最为广泛。通过对以往算法的研究,提出一种对四叉树的分割和结点存储结构同时进行改进的LOD算法。该算法通过减少误差判断次数加快了四叉树的生成速度,同时改变传统的结点存储方式,降低了数据的冗余存储。

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

LOD Algorithm Based on Improved Quadtree-split and Node Storage
LUO Jing-xin,TANG Jin.LOD Algorithm Based on Improved Quadtree-split and Node Storage[J].Computer Engineering,2009,35(20):202-204.
Authors:LUO Jing-xin  TANG Jin
Affiliation:(School of Information Science and Engineering, Central South University, Changsha 410075)
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.
Keywords:Digital Elevation Model(DEM)  Level Of Detail(LOD)  quadtrees  multi-resolution
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号