共查询到19条相似文献，搜索用时 812 毫秒
1.
采用"联合Delaunay三角网"来提取成组等高线的弯曲,在弯曲处利用平三角形连接法进行局部地形结构线的连接,并建立起地形结构线的树状结构。运用方根模型确定谷地选取的数量指标,并提出了一种新的数学模型以确定谷地选取的质量指标,完成等高线群的自动综合。研究和实验表明,该方法充分顾及了地貌形态特征,谷地选取合理,概括程度适当,并完全避免了相邻等高线相交,综合效果较好。 相似文献
2.
胡启明 《测绘与空间地理信息》2017,(4)
地形与地貌是数字地形分析中重要的自然地理要素,数字高程模型中蕴含着丰富的地形地貌信息,从中提取地形特征线信息是当前地学研究的热点之一。目前,很多学者使用不同的方法来研究地形特征线的提取,但是仍然存在着许多不足之处。本文对这些方法进行了介绍,对各种方法的研究现状展开综述并分析了优点和不足,最后对特征线提取方法存在的主要问题进行总结和展望。 相似文献
3.
4.
在地图水系自动综合中河流选取需要建立对不同河流重要性程度的有效判别。由于河流汇水区域直接反映河流的作用空间,因而其面积大小成为关键性的量化指标。目前基于河流的汇水区域自动提取方法主要从河流单一要素出发,按“空间均衡竞争”思想平分河流之间的区域,由于未考虑地形因素使得提取的汇水区域往往存在偏差,而传统基于DEM的汇水区域提取虽然考虑了地形,但没有与河流目标建立显性的对应关系。河流是一种天然的沟谷地性线,与山脊线具有对生互补的空间耦合关系,本文提出了一种等高线簇与河网双要素协同的河流汇水区域提取方法,该方法对河流与等高线的目标集合构建约束Delaunay三角网(CD-TIN)并将三角形分类,对不同类型的三角形分别采用骨架线提取规则与梯度向量引导的分水线搜索规则提取分水线段,连接形成网络结构并依此计算各河段的汇水区域。实验结果表明,本算法能更准确地提取河流汇水区域,从而为河流综合选取提供有效支持。 相似文献
5.
6.
传统三角形剖分方法只考虑三角网的形态最优,忽略了地形特征线的影响,导致构建的地形模型不能真实反映地形特征。文章提出既顾及特征线又满足三角形形态最优的TIN模型的构建方法。在研究了有关三角形形态理论的基础上,设计了数据结构,对如何利用该方法进行三角形剖分做了具体研究。实例证明,利用该方法进行三角形剖分,构建的TIN三角网模型既能满足三角形形态最优,又能避免特征线穿越三角形,能够真实反映地形特征。该三角形剖分方法对于地形较复杂区域的TIN模型构建具有很好的适用性。 相似文献
7.
基于Delaunay三角网提取的骨架线是地图综合中广泛应用的一种空间剖分结构。改进了一种基于约束Delaunay三角网的地图目标群间骨架线提取算法,从程序设计的角度详细描述了算法的数据结构和控制流程。按照三角网中三角形包含约束边的数目,将三角形分为0、1、2、3四类,将0类、2类和单连通的1类三角形视为骨架线追踪的起点或终点,将双连通的1类作为中间通道,对整个三角网进行遍历。针对三角网中的环路、3类三角形等特殊情况,在改进的算法中提出了相应的处理方法。该算法成功地用于等高线的内插和街区地图目标群的邻近分析,验证了算法的可行性和健壮性。 相似文献
8.
地形建模中不规则三角网构建的优化算法研究 总被引：5，自引：0，他引：5
对利用数字线划图（DLG）重建地形三维模型进行了研究，提出了基于三角形拓扑关系的自动联结三角网算法，并构造了复杂地形的三维数据模型。基于此模型，设计实现了构网优化算法，实现了复杂地形的自动三维重建。试验证明，本文提出的构网优化算法是稳健、高效的。 相似文献
9.
基于机载激光雷达（LiDAR）点云生产高质量的数字高程模型（DEM）,需要地形特征线的约束。本文针对现有断裂线提取算法仅仅考虑了地表的局部变化,错提取率高的现状,从人工解译的角度出发,引入地形开度（topographic openness）作为一种定量描述地表整体变化的地形特征,提出了基于地形开度的断裂线自动提取算法。首先将原始地面点按高程采样成距离图像,然后通过地形开度算子获取地表的主体结构变化,最后结合形态学算子和边缘提取算子提取断裂线种子点并跟踪断裂线矢量。试验结果表明,该算法无需人工干预,能够快速提取较完整的断裂线。 相似文献
10.
11.
针对高线图中陡坡区域特征的自动识别问题,在应用Delaunay三角网与线性插值法生成等高线图的基础上,改进了基于最大角原则生成约束Delaunay三角网的算法,对等高线图进行了三角剖分,根据等高线之间约束三角形的几何参数,计算了等高线图坡面单元坡度,识别出坡度较高区域。进一步地,给出了一种扩张算法对相连陡坡单元进行划分形成陡坡区域,计算了各个陡坡区域中心坐标、面积与平均坡度。通过对12组有256个坐标高程值的数据构建约束D-TIN并生成三维地形图对识别结果进行了评价,识别正确率达0.903,平均识别时间为33ms。实验表明,对于不同数据生成的不同等级等高线图的识别结果均有较高的效率与准确率。 相似文献
12.
使用一种含有边拓扑关系的TIN数据结构,从三角网的拓扑关系角度利用这种结构中的边拓扑关系设计了三角形定位、Voronoi图生成和等值线生成的算法.这些算法避免了在三角形中拓扑关系查询时的不必要的搜索.更重要的是,在算法的编写过程中,如果避免一些不必要的搜索,则意味着算法更加清晰,并减少了出错的机率.经过上机验证,三种算法都获得了正确、满意的结果. 相似文献
13.
An approach is outlined for the construction of a digital terrain model based on elevations assigned to nodes of an irregular (non-rectangular) grid. More specifically, this grid consists of a series of non-intersecting, non-equilateral triangles whose apices are prominent points of local relief or points located on structure lines, and whose sides represent portions of structure lines or arbitrarily selected line segments. Such an irregular model provides for a better approximation of basic terrain structure than those constructed from traditional, geometrically regular networks. Operation of algorithms for the plotting of contour lines from such a model is described. Translated from: Geodeziya i kartografiya, 1986, No. 2, pp. 34-38. 相似文献
14.
15.
The contour line is one of the basic elements of a topographic map. Existing contour line simplification methods are generally applied to maps without topological errors. However, contour lines acquired from a digital elevation model (DEM) may contain topological errors before simplification. Targeted at contour lines with topological errors, a progressive simplification method based on the two‐level Bellman–Ford algorithm is proposed in this study. Simplified contour lines and elevation error bands were extracted from the DEM. The contour lines of the elevation error bands were initially simplified with the Bellman–Ford (BF) algorithm. The contour lines were then segmented using the vertices of the initial simplification result and connected curves with the same bending direction were merged into a new curve. Subsequently, various directed graphs of the merged curves were constructed and a second simplification was made using the BF algorithm. Finally, the simplification result was selected based on the similarity between several simplification results and adjacent contour lines. The experimental results indicate that the main shapes of the contour groups can be maintained with this method and original topological errors are resolved. 相似文献
16.
《The Cartographic journal》2013,50(2):144-156
AbstractIsolines have proved to be a highly effective way of conveying the shape of a surface (most commonly in the form of height contours to convey geographical landscape). Selecting the right contour interval is a compromise between showing sufficient detail in flat regions, whilst avoiding excessive crowding of lines in steep and morphologically complex areas. The traditional way of avoiding coalescence and confusion across steep regions has been to manually remove short sections of intermediate contours, while retaining index contours. Incorporating humans in automated environments is not viable. This research reports on the design, implementation and evaluation of an automated solution to this problem involving the automatic identification of coalescing lines, and removal of line segments to ensure clarity in the interpretation of contour information. Evaluation was made by subjective comparison with Ordnance Survey products. The results were found to be very close to the quality associated with manual techniques. 相似文献
17.
基于Delaunay三角网的等高线树生成方法 总被引：1，自引：1，他引：0
研究如何利用Delaunay三角网构建等高线树,提出一种新的等高线树生成方法。该方法充分利用Delaunay三角网在领域分析中的优势,通过两次利用Delaunay三角网来判明等高线的空间关系进而达到统一被图廓截断的等高线以生成等高线树的目的。本文将等高线作为约束边构建约束型Delaunay三角网,利用Delaunay三角网查找具有邻接关系的等高线,在此基础上结合邻近等高线的高程关系判明、识别,最终统一被截断的等高线;然后对统一后的等高线再次利用Delaunay三角网查找具有邻接关系的等高线对,利用等高线对的高程关系判断出其为父子关系或兄弟关系,据此将等高线插入到相应的位置,逐步生长成等高线树。同时给出了基于Delaunay三角网的等高线树生成方法的算法设计及试验结果。 相似文献
18.
This paper discusses the rules representing relief with contour lines and methods for automatically constructing relation of contour lines. Mean-while, the improvement of existent methods for extracting the topographic characteristic points and lines is described. On the basis of this analysis, we propose a series of practicable progressive graphic simplification ideas of contour lines and concrete algorithms for the exception’s handling. In this way, graphic generalizations of contour lines at different scales are integrated into one model that is convenient to implement, and in which contour lines’ intersection in generalization can be controlled. 相似文献
19.
This paper discusses the rules representing relief with contour lines and methods for automatically constructing relation of contour lines.Meanwhile,the improvement of existent methods for extracting the topographic characteristic points and lines is described.On the basis of this analysis,we propose a series of practicable progressive graphic simplification ideas of contour lines and concrete algorithms for the exception's handling.In this way,graphic generalizations of contour lines at different scales are integrated into one model that is convenient to implement,and in which contour lines' intersection in generalization can be controlled. 相似文献