期刊文献+

TB级地形数据实时漫游核心算法研究 被引量:12

Research on kernel algorithm of real-time rendering based on TB lever terrain data
原文传递
导出
摘要 TB级数据时代已经到来,如何有效地在普通PC机上实现TB级地形数据漫游,已逐渐成为GIS(地理信息与系统)学术界的研究热点。海量数据组织管理是3维地形数据漫游的核心机制,传统四叉树、八叉树等数据结构,一定程度上解决绘制瓶颈问题,但是结构复杂,很难适应TB级地形场景实时、稳定的漫游需求。通过实施多级缓冲机制、采用动态LOD(levels of detail)与显存调度技术,以及引入多核CPU并行计算策略,最终构建出一套与数据大小无关的实时地形绘制算法。通过对1GB、10GB、200GB、500GB级等海量数据进行实验,平均绘制速率可达到30帧/s以上,比一般算法高出2~3倍,从而验证本文算法的实用性。 With the availability of terrain data of the TB level, how to render terrain data of TB magnitude based on ordinarily computer efficiently, is becoming a hot topic in GIS academia . Organization and management of massive data is the core mechanism for 3D terrain rendering. The traditional data structures as quadtree, octree and so on are not effective, which cannot support real-time displaying and roaming of large-scale terrain scene. According to the mechanism of multi- level buffer, implementation dynamic dispatching of LOD, graphics memory dispatching and multi-core CPU parallel computing strategy, this paper has good results. Finally, this paper puts forward the solution, a real-time Terrain Rendering Algorithm which has no concern with data size. It is verified by experiment on massive data of IGB, 10 GB, 200 GB, 500 GB and so on, the rendering rate can reach to 30 frame/s. It is faster than most existing algorithms. The experiment result shows the practicability of the real-time terrain rendering algorithm.
作者 左志权 陈媛
出处 《中国图象图形学报》 CSCD 北大核心 2010年第9期1411-1415,共5页 Journal of Image and Graphics
基金 国家自然科学基金项目(40771177) 国家高技术研究发展计划(863)基金项目(2009AA12Z126)
关键词 地形可视化 动态调度 多级缓冲 CPU多核技术 并行计算 terrain visualization dynamic dispatching multi-level buffer multi-core CPU parallel computing
  • 相关文献

参考文献10

二级参考文献49

  • 1吴恩华.图形处理器用于通用计算的技术、现状及其挑战[J].软件学报,2004,15(10):1493-1504. 被引量:141
  • 2涂超,毋河海,王新生.大规模地形快速渲染算法的研究[J].昆明理工大学学报(理工版),2002,27(1):1-5. 被引量:3
  • 3赵友兵 潘志庚 石教英.视点相关的地形LOD模型的动态生成算法 [EB/OL].http://www.cad.zju.edu.cn/home/zhaoyb/ paper/ 1998 terrainloD.pdf.,.
  • 4Clark J H. Hierarchical geometric models for visible surface algorithm [ J ]. Communications of the ACM, 1976,19 (10) :547 - 554.
  • 5Schroder W, Zarge J, Lorensen W. Decimation of triangle meshes [J]. Computer Graphics, 1992,26(2): 65-70.
  • 6Hoppe H, De Rose T, Duchamp T, et al. Mesh optimization[A]. In: Proceedings of the SIGGRAPH [ C ] , Anaheim, California, USA, 1993 : 19 - 26.
  • 7Hamann B. A data reduction scheme for triangulated surface [ J]. Computer Aided Geometry Design, 1994, 11 (2) : 197 - 214.
  • 8Hoppe H. Progressive meshes [ A ]. In: Proceedings of the SIGGRAPH [ C ]. New Orleans, Louisiana, USA, 1996 : 99 - 108.
  • 9Garland M, Heckbert P S. Surface simplification using quadric error metric[ A]. In: Proceedings of the SIGGRAPH [ C ]. Los Angeles, California, USA, 1997 : 209 - 216.
  • 10Perter Linstrom, David Koller, William Ribarsky, et al. Real-time,continuous level of detail rendering of height fields [ A ]. In: Proceedings of SIGGRAPH [C], New Orleans, Louisiana, USA, 1996:109 - 118.

共引文献82

同被引文献75

引证文献12

二级引证文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部