Abstract: This paper presents an algorithm for large-scale terrain rendering. It splits the terrain into several patches, and uses triangle bintrees to represent terrain meshes. At run time, it updates terrain meshes by forced split and forced merge operations, which can take the advantage of frame-to-frame coherency and automatically avoid cracks. Experimental result shows that this algorithm can efficiently improve the performance of ROAM algorithm and can be used in real-time walkthroughs in large-scale terrain at high frame rates.

Key words: terrain rendering, ROAM algorithm, triangle bintree, forced split, forced merge

摘要： 提出一种大规模地形渲染算法，对大规模地形进行分块，用三角形二叉树表示地形网格，在实时漫游中，通过强制分割和强制合并实时更新网格，充分利用帧与帧之间的连贯性并自动避免裂缝。实验结果表明，该算法可以有效提高ROAM算法性能，能以较高帧速实现大规模地形的实时漫游。

关键词: 地形渲染, ROAM算法, 三角形二叉树, 强制分割, 强制合并

CLC Number: 

• TN911.73