摘要
地形匹配问题主要研究的是如何快速、准确地求解出运载实体和地面的接触点的问题。地形匹配问题和地表绘制算法有着密不可分的关系,地形匹配问题的具体解决是以地表绘制算法中建立的基本数据结构为基础的,因此,随着先进的地表绘制算法的提出,就产生了地形匹配问题的新解决方案的需求。文章给出了一种基于先进的以三角形二叉树为其基本数据结构的地形绘制算法的地形匹配问题新求解方法,该方法无需建立特殊的数据结构,其地形匹配速度明显优于已有的方法。
The main issue of terrain matching is how to get the contact point between vehicles and terrain quickly and exactly.And there is a close relationship between terrain matching algorithm and terrain rendering algorithm.Terrain matching is based on the data structure of terrain rendering algorithm so advanced rendering algorithms bring the development of the terrain matching.This article present a new method of terrain matching based on an advanced terrain-rendering algorithm,which is based on the data structure triangle bin-tree.To rebuild special data structure for our terrain matching is not necessary and the process of this method is more efficient than others.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第16期215-217,共3页
Computer Engineering and Applications
基金
国家863高技术研究发展计划课题经费资助