共查询到16条相似文献，搜索用时 390 毫秒
1.
2.
3.
在对比几种典型的地形简化算法的基础上,探索建立一种基于数据分块且适合海量三维地形的局部自适应最优化简化模型(LSOSTM模型).该简化模型以四又数模型为基础,针对海量地形进行分层分块组织,构造地形四叉树;根据视点以及局部地形粗糙程度动态地改变地形四叉树节点的分裂或合并状态,实时调整不同地形四叉树节点的显示层次;利用"包围盒"法来判断地形四叉树节点是否需要被绘制;使用广度优先遍历方法解决不同分辨率地形四叉树节点拼接造成的裂缝问题.基于LSOSTM模型构建一个演示系统,实现海量地形数据流畅漫游. 相似文献
4.
高速网上3维海量地形数据的实时交互浏览的实现 总被引：13，自引：2，他引：13
针对高速网上3维海量地形数据传输和显示特点，提出了一套海量地形数据处理、存储方法，包括数据的预处理和数据的存储结构，数据存储有利于高速网络访问；并根据人的视觉生理特征，提出了一种多分辨率地形表示模板形成，较好地处理了实时交互游览地形的真实感和巨大数据需求之间的冲突。设计了一种适合网络实时传输海量地形数据的传输协议，使系统充分利用网络带宽同时又不浪费带宽。通过在中国高速互联试验网络NFSCNet上的大量演示，表明所提出的技术方案是切实可行的，证明了高速网对3维海量地形实时交互浏览的必要性和可行性。 相似文献
5.
NASA World Wind海量离散地形显示技术研究 总被引：1，自引：0，他引：1
虚拟数字地球需要解决大范围海量地形快速显示问题。本文在对World Wind海量地形显示机理和地形数据LOD分层组织深入研究基础上,提出了基于ArcMap的离散地形分层切割流程,开发了与World Wind三维地形显示数据模型匹配的分层切割软件,对海量离散地形按不同分块大小和层次切割后的显示效率和效果进行了分析,结果表明World Wind能实现不同尺度地形数据的快速三维可视化。 相似文献
6.
7.
《测绘科学技术学报》2018,(4)
多波束测深数据具有海量特性,在使用过程中常需对其进行抽稀处理。针对现有抽稀算法的结果无法兼顾舰船航行安全与海底地形真实表达的问题,提出一种新的多波束测深数据抽稀算法。在根据海底地形复杂程度的不同实现地形复杂程度分类的基础上,针对平坦、一般和复杂3类不同复杂程度的地形区域提出不同的抽稀策略,使得抽稀过程顾及航行安全"取浅"原则的同时能够保留海底真实地形特征。与常用抽稀算法网格最浅点法和不规则三角网法进行对比实验,结果表明:本文算法抽稀结果在海底地形表达真实性上明显优于网格最浅点法,同时能够避免不规则三角网法抽稀时可能出现数据空白区域的问题,抽稀结果能够满足后期海图制图和海底地形构建的数据需求。 相似文献
8.
《测绘文摘》2011,(1):16-18
CH20110100基于数据分层分块的海量三维地形四叉树简化模型=A Model for Massive 3D Terrain Si mplification Based on Data Block Partition and Quad-tree/刘扬,宫阿都,李京(北京建筑工程学院测绘与城市空间信息学院)∥测绘学报.-2010,39(4).-410~415在对比几种典型的地形简化算法的基础上,探索建立一种基于数据分块且适合海量三维地形的局部自适应最优化简化模型(LSOSTM模型)。该简化模型以四叉数模型为基础,针对海量地形进行分层分块组织,构造地形 相似文献
9.
地形简化算法利用少量有效的地形信息表达整体地形,能很好地解决海量地形数据与计算机硬件之间的矛盾,同时满足多尺度地形应用需求。针对现有地形简化算法难以兼顾局部地形起伏与地形整体特征的问题,提出一种基于质心Voronoi图的地形自适应简化算法。首先,利用质心Voronoi图的特点,以地形起伏度作为密度函数生成质心Voronoi图;然后,利用分布在地形起伏较大区域的质心Voronoi图种子点及大多分布在地形特征线上的Voronoi区域顶点重构地形;最后,通过原始地形与重构地形的特征线验证地形简化的效果,并与三维道格拉斯-普克（3D DouglasPeucker,3D DP）算法进行精度对比。实验结果表明,从简化地形中提取的山脊线、山谷线、等高线等地形特征线与原始地形的重叠度均较高,算法能较好地保持地形整体特征;且在相同的简化级别下,算法的简化误差小于3D DP算法,具有较高的地形简化精度。 相似文献
10.
赵慧中 《测绘与空间地理信息》2010,33(5)
3维可视化是GIS、计算机仿真、虚拟现实等领域中的关键技术之一,而基于多层次细节的实时优化自适应网格动态地形渲染算法(ROAM)凭借其简单性和可扩展性成为解决海量高程数据地形可视化的常用方法。本文详细剖析了ROAM算法的原理及其特点,并给出了该算法的一个具体的实现过程。 相似文献
11.
12.
13.
CHEN JunSUN MinZHCXJ Qiming Professor National Laboratory for Information Engineering in Surveying Mapping Remote Sensing WTUSM Luoyu Road Wuhan China 《地球空间信息科学学报》1999,2(1):9-15
The research work has been seldom done about cloverleaf junction expression in a 3-dimensional city model (3DCM). The main reason is that the cloverleaf junction is often in a complex and enormous construction. Its main body is bestraddle in air,and has aerial intersections between its parts. This complex feature made cloverleaf junction quite different from buildings and terrain, therefore, it is difficult to express this kind of spatial objects in the same way as for buildings and terrain. In this paper,authors analyze spatial characteristics of cloverleaf junction, propose an all-constraint points TIN algorithm to partition cloverleaf junction road surface, and develop a method to visualize cloverleaf junction road surface using TIN. In order to manage cloverleaf junction data efficiently, the authors also analyzed the mechanism of 3DCM data management, extended BLOB type in relational database, and combined R-tree index to manage 3D spatial data. Based on this extension, an appropriate data structur 相似文献
14.
The research work has been seldom done about cloverleaf junction expression in a 3-dimensional city model (3DCM). The main reason is that the cloverleaf junction is often in a complex and enormous construction. Its main body is bestraddle in air, and has aerial intersections between its parts. This complex feature made cloverleaf junction quite different from buildings and terrain, therefore, it is difficult to express this kind of spatial objects in the same way as for buildings and terrain. In this paper, authors analyze spatial characteristics of cloverleaf junction, propose an all-constraint points TIN algorithm to partition cloverleaf junction road surface, and develop a method to visualize cloverleaf junction road, surface using TIN. In order to manage cloverleaf junction data efficiently, the authors also analyzed the mechanism of 3DCM data management, extended BLOB type in relational database, and combined R-tree index to manage 3D spatial data. Based on this extension, an appropriate data structure for cloverleaf junction in 3DCM is proposed. 相似文献
15.
月面形貌的3维可视化算法 总被引：1，自引：0，他引：1
基于大范围地形可视化算法研究的基础上,对平面geometry clipmaps算法进行改进,利用GPU的顶点着色器实现平面地形向球面地形的投影变换,并综合利用球面视域裁剪、球面视点控制等技术,使geometry clipmaps算法适用于球面海量地形数据的3维可视化;收集处理月球全球影像和形貌高程数据,对算法进行验证,实现月球表面形貌的实时动态3维可视化.试验表明:绘制算法可不受数据量大小的限制、绘制效率高、效果逼真,但存在两极变形较大的缺点.Abstract： Based on the study of visualization arithmetic of large area terrain, plane geometry clipmaps algorithm is improved. Projection transformation from plane landform to sphere landform was realized by using GPU vertex shader. In that improved algorithm, methods such as sphere vision field culling and sphere viewpoint control are used.That makes geometry clipmops algorithm more effective in 3D visualization of massive sphere terrain data. The whole moon image and DEM data are collected and disposed, which are used to verify the capability of that algorithm, realizing dynamic and real time 3D visualization of moon surface. The experiments show that the graphic algorithm isn't limited by data quantity, which is of high efficiency and reality simulation, but the two-pole distortion is serious. 相似文献