基于二叉树结构的地形分块实时漫游的研究

Real-time Cruising in Terrain Blocks Based on Binary Triangle Trees

介绍了以多分辨地形模型、二元三角树、钻石三角形、强制分割为基础的限制二叉树实时优化配置格网(ROAM)算法。并以此为基础,在地形分块间的接边中运用二元三角树分割的内在联系,巧妙地消除了块与块间的拼接缝。实验结果表明该方法较好地实现了地形分块后的三维地形实时漫游。

This paper introduces a kind of algorithm called restricted biadtree on constructing the terrain hierarchys based on grid data,binary triangle trees,multi-resolution terrain,diamond triangles and force-splitting,by which the article prefers a simple and efficient way to deal with the'cracks' among the terrain blocks dividing from larger terrain.The experiment results show that this way can achieve good performance on real-time cruising in the terrain which divided as blocks.