基于三角形二叉树的实时大规模地形渲染算法  

Real-time Algorithm for Large-scale Terrain Rendering Based on Triangle Bintree

作　　者：林继承[1] 万旺根[1] 周俊玮[1] 谭小辉[1] 

机构地区：[1]上海大学通信与信息工程学院,上海200072

出　　处：《计算机工程》2009年第2期268-270,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2007AA01Z319);信息产业部电子信息产业发展基金资助项目(2005688)

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

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

分 类 号：TN911.73[电子电信—通信与信息系统]