共查询到18条相似文献，搜索用时 618 毫秒
1.
《武汉大学学报(信息科学版)》2015,(9)
基于传统离散Fréchet距离,提出了一种线状要素几何相似性度量方法。推导了基于递归迭代方法计算离散曲线Fréchet距离的计算公式,因传统Fréchet距离仅用一个点对之间的距离来度量相似性存在较大误差,提出了一种基于离散Fréchet距离识别曲线上点与点之间最短路径的方法,通过最短路径计算两条曲线间平均Fréchet距离,以平均Fréchet距离作为两曲线间的相似值。针对传统Fréchet距离不能解决一条曲线的部分与另一条完整曲线之间的相似匹配,基于平均Fréchet距离,提出了"部分-整体"Fréchet距离计算方法。将上述距离应用于地图数据匹配、合并及等高线内插中,取得了较好的效果。 相似文献
2.
3.
4.
5.
《武汉大学学报(信息科学版)》2016,(7)
等高线是获取数字高程模型(DEM)常用的数据源之一,但内插方法对DEM生成精度有显著的影响。基于形态学重建和测地距离变换运算,提出一种等高线数据生成DEM的内插方法。形态学重建用于获取与空间一点对应的最邻近的上等高线和下等高线的高程值,测地距离变换用于获取该点到上下两条等高线的测地距离;使用沿流水线的线性内插获取该点的高程值。实验表明,在只使用等高线数据生成DEM的情况下,本文提出的内插方法获取的DEM精度更高。 相似文献
6.
在基于启发式内插等高线算法的基础上提出了一种局部内插方法。首先利用Douglas-Peucker算法提取等高线的特征点,根据特征点判断等高线之间的相似性程度,找出导致等高线出现异常的特征点;然后将相似性程度很低的两条等高线自动分解为若干简单等高线再进行内插。有效地解决了局部弯曲很大、马鞍型地貌等复杂等高线的内插问题。算法已经在以Microstation为平台的数字制图系统中实现并逐渐实用化。 相似文献
7.
在基于启发式内插等高线算法的基础上提出了一种局部内插方法。首先利用Douglas—Peucker算法提取等高线的特征点,根据特征点判断等高线之间的相似性程度,找出导致等高线出现异常的特征点;然后将相似性程度很低的两条等高线自动分解为若干简单等高线再进行内插。有效地解决了局部弯曲很大、马鞍型地貌等复杂等高线的内插问题。算法已经在以Microstation为平台的数字制图系统中实现并逐渐实用化。 相似文献
8.
陶丽娟 《测绘与空间地理信息》2017,(4)
作者通过多年的实际生产经验,总结了1∶10 000地形图数据中等高线内插的几种途径及方法,简要地叙述了操作步骤及注意事项,这几种方法大大地节省了在立体中徒手采集等高线的时间,增加了图面修整等高线的美观性,且提高了生产效率。 相似文献
9.
等高线内插在地图自动综合、地图数字化、三维地形重建等过程中都具有重要意义。许多等高线内插算法在等高线急剧变化以及闭合等高线处存在问题。在分析已有等高线内插算法优缺点的基础上,提出了一种等高线内插算法。该算法以等高线上的节点为圆心,建立与相邻等高线之间的内切圆来探测相邻等高线之间的空间关系,并获取等高线间的辅助线,进而内插出等高线,一方面弥补了已有等高线内插方法中的问题,另一方面有效提高了等高线内插的速度和质量。通过与其他内插算法之间的实验对比分析,验证了本方法的科学性和先进性。 相似文献
10.
本文介绍了一种高效的基于摄影测量数据库的数字测图系统，该系统由数据采集、图形编辑和处理、绘图数据处理以及作为主体的数据库管理等四个子系统组成。用户可在国产解析测图仪ＡＰＳ—１和经过数字化改造的模拟测图仪器上进行数据采集，通过交互式图形编辑和摄影测量处理以形成１：５万摄影测量数据库数据，并输出线划地形图，具有对该数据库数据的检查、验收功能。此外，本文还研究了等高线内插的若干算法，形成了较为实用的等高线内插软件包。 相似文献
11.
针对高线图中陡坡区域特征的自动识别问题,在应用Delaunay三角网与线性插值法生成等高线图的基础上,改进了基于最大角原则生成约束Delaunay三角网的算法,对等高线图进行了三角剖分,根据等高线之间约束三角形的几何参数,计算了等高线图坡面单元坡度,识别出坡度较高区域。进一步地,给出了一种扩张算法对相连陡坡单元进行划分形成陡坡区域,计算了各个陡坡区域中心坐标、面积与平均坡度。通过对12组有256个坐标高程值的数据构建约束D-TIN并生成三维地形图对识别结果进行了评价,识别正确率达0.903,平均识别时间为33ms。实验表明,对于不同数据生成的不同等级等高线图的识别结果均有较高的效率与准确率。 相似文献
12.
等高线须以相似的光滑曲线逼近实际地貌形态,并综合地形在一定限度内的地势起伏,其智能化控制对地貌表达具有重要的实用价值。绘图员绘制曲线时能凭经验捕捉到数据点所包含的几何形状信息,而张力样条函数和三次B样条曲线在节点插值时,严格要求二阶参数连续,不符合人的经验直觉,是节点对参数曲线连接光滑度的过分限制。根据人工绘制等高线的规则,提出将三次Beta样条曲线作为基于人工绘制约束的等高线插值的数学模型,通过引入形状控制参数放松对曲线的光滑性的要求,增加了控制等高线形状的自由度,把C2连续的三次B样条松弛成为G2连续的Beta样条,实验结果表明插值的等高线符合地形综合度要求。 相似文献
13.
14.
Void filling and anomaly replacement in conjunction with auxiliary sources of data have been widely used to improve the quality of existing problematic high-resolution digital elevation models. However, the traditional interpolation methods used for this purpose have always failed to eliminate the discrepancies between different data-sets. In this paper, an improved ANUDEM method is presented for DEM interpolation, which incorporates the idea of topographic correction using high correlation of topological structure between contour lines (CLs) from multi-scale digital elevation models (DEM). Firstly, the terrain topological structure is extracted from the CLs of a low-resolution DEM. The topographic surface correction is then undertaken based on the extracted structure, which recovers the topographic information of the sharp depressions and eminences to fit the high-resolution representation. Finally, the breaklines of the terrain surface are distilled and integrated into the denser DEM generation. The experiments undertaken confirmed the superiority of the proposed method over the other DEM interpolation methods. It is shown that the proposed method can provide results with a higher accuracy, as well as a better visual quality. 相似文献
15.
16.
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. 相似文献
17.
《The Cartographic journal》2013,50(2):208-212
AbstractTerrain data obtained from satellite imagery or by scanning existing contour maps is in raster mode. Such data may be compressed by detecting and storing the critical points of contour lines. When hand digitising a contour map, a trained digitiser operator would usually select points which visually appear to be critical points. Existing interpolation techniques often fail to restore the critical points, including turning points, to their original positions. This article illustrates the use of splines composed of quadratic Bézier curves with monotone curvature for rendering contour lines which are represented only by their turning and end points, such that the positions of the turning points are preserved. 相似文献