搜索结果: 1-6 共查到“地图制图技术 TIN”相关记录6条 . 查询时间(0.085 秒)
Updating Algorithms for Constraint Delaunay TIN
Updating Algorithm Constraint Delaunay TIN Integral Ear Elimination Influence Domain Re-Triangulation Polymorphism
<
2015/10/12
Present algorithms for D-TIN are far insufficient for the dynamic updating of CD-TIN in different applications. This paper,
based on improvement to present insertion and deletion algorithms for D-TI...
Radial Spatial Division Based On and Restrained Edge Mosaic In Constructed Tin
TIN Algorithm Time complexity
<
2015/7/14
To insert restrained edges into TIN is of great necessity in many fields. At present, for the need of mass data processing, it is
expected that the time efficiency of the algorithm be higher and high...
An Original Way of Building a TIN with Complex Urban Structures
TIN, CAD Euler Operators Quad-Edge data structure
<
2015/6/1
Geographical Information System (GIS) software often models a Digital Terrain Model (DTM) by using triangulations (TINs).
Computer Aided Design (CAD) is then used to model complex city structures an...
Investigating Performance Of Airborne Lidar Data Filtering With Triangular Irregular Network (TIN) Algorithm
Airborne Lidar Filtering TIN Algorithm DEM
<
2014/9/29
Digital Elevation Model (DEM) is an important topographic product and essential demand for many applications. Traditional methods for creating DEM are very costly and time consuming because of land su...
基于点删除的TIN简化算法改进
三角网格模型 TIN 三角网简化
<
2009/11/23
三角网格模型的简化在三维建模过程中占有很重要的地位。本文通过系统研究目前常用的三角网简化算法，归纳总结出了各主要算法的优缺点与适用范围。文中重点选择了一种适用性比较广的基于点删除的TIN简化算法，并将它应用于实际的三维地形模型简化当中，在实际工作中检验它的实用性。根据三维地形数据量大、精度要求具层次感的特点，对原算法做了一些修改，在保证简化模型细节损失在误差控制范围内的情况下，使得算法简化效率更高...
利用凸壳建TIN的算法研究
凸壳 格雷厄姆方法 Delaunay三角网 不规则三角网
<
2009/9/25
首先阐述了如何利用凸壳建TIN的原理和方法,并对相关算法进行了综合和改进;然后基于“分而治之”的思想提出了一种格网数据筛选法,用来提高凸壳建TIN的效率;最后通过实例测试进行比较和验证.在三角网优化过程中,采用LOP优化原则,使得建TIN结果满足最小角最大的性质,当平面点集满足D-三角网构网条件时,所得三角网为D-三角网.