共查询到17条相似文献，搜索用时 250 毫秒
1.
线状要素化简算法的分析与评估 总被引：1，自引：0，他引：1
线状要素是地图中量最大、形式最多样的要素,它们的化简在自动制图综合中非常重要.目前对线状要素化简的算法研究较多,但其化简质量却少有研究.针对化简算法的基本要求,提出了易于操作的评估化简算法质量的6个方面:面积差、弯曲度、最大拐角比率、化简变化趋势、化简结果一致性和自相交性.通过大量实验,比较了Douglas-Peucker等算法的化简效果,最后对化简中的自相交问题提出了相应的改正措施. 相似文献
2.
3.
4.
本文以1:50万军事交通图数据库为基础,探讨并研究了数据库支持下的自动制图综合的理论,方法和实施过程:重点研究了地图内容的选取、线状要素的化简和重迭要素的移位问题;尤其是对图形要素的移位,做了较为详细的分析,提出了检查线状要素之间图形重迭的方法及自动移位的具体措施,并给出了用于程序运行的一些详细算法。 相似文献
5.
6.
在地理信息系统（GIS）中,为了使地图线状要素数据的可视化有较高的质量,就需要对线状要素进行光滑处理。如何使得折线光滑后,让原始点更多地保留下来,是衡量该类地图数据精度的重要依据。本文提出了一种折线光滑处理的三点算法,该方法拟合精度高且算法简单,具有较强的实用性,可用于自动化制图、GIS等地图线状要素的绘制中。 相似文献
7.
8.
9.
一种顾及空间关系约束的线化简算法 总被引：1，自引：1，他引：0
线要素化简在制图表达与综合领域一直是研究的热点和难点之一。然而,经典化简算法多针对单独线要素进行处理,缺乏对该线要素与周边线要素之间整体空间关系的考虑,并且,存在计算结果生硬(D-P算法)、局部极值点缺失,特别是在曲度较大之处出现相交异常(L-O算法)等问题。为此,本文提出一种顾及空间关系约束的线化简算法,建立线要素全局化简方法(LGSM)和矢量位移、面积位移等5类评价指标。采用等高线、河流和道路3类线要素实际数据进行了试验,充分检验了本文算法的优越性,其处理结果符合开方根模型规律,降低了曲线复杂度,在保证全局空间关系不变条件下,不仅更好地保持了曲线整体形状特征,而且光滑美观、精度高。 相似文献
10.
提出一种基于模拟退火思想的线状要素Morphing方法,针对同名线状要素在大小比例尺下的两种表达,首先利用约束Delaunay三角网提取小比例尺地图上线状要素的弯曲特征点,然后采用模拟退火技术在特征点与大比例尺线状数据顶点之间建立全局最优匹配,匹配结果将两线状要素分割成多对对应线段,最后针对每一对对应线段采用常规线性插值方法进行Morphing插值。模拟算例和实际数据实验证明,该方法较好地顾及了线状要素尺度变换过程中的弯曲化简、删除、夸大、典型化等综合操作,变换结果能有效地保持原线状要素的结构特征,提高了Morphing变换的精度。 相似文献
11.
基于遗传算法的线要素自动化简模型 总被引：4，自引：1，他引：4
线划要素是地图上大量存在的最基本的地图要素，作为自动综合的一个重要方面，它的化简受到了极大的关注。在分析总结现有线划要素化简方法的基础上，依据遗传算法的基本原理和方法，建立了地图上线划要素的化简模型，并讨论了基于遗传算法的线要素自动化简方法中的关键问题，给出了具体的操作步骤和实验结果。结果表明，利用遗传算法对线要素进行化简能够比较好地保持线要素的整体形状，同时还对点具有很高的压缩率。 相似文献
12.
13.
In this article we present a heuristic map simplification algorithm based on a novel topology‐inferred graph model. Compared with the existing algorithms, which only focus either on geometry simplification or on topological consistency, our algorithm simplifies the map composed of series of polylines and constraint points while maintaining the topological relationships in the map, maximizing the number of removal points, and minimizing error distance efficiently. Unlike some traditional geometry simplification algorithms, such as Douglas and Peucker's, which add points incrementally, we remove points sequentially based on a priority determined by heuristic functions. In the first stage, we build a graph to model the topology of points in the map from which we determine whether a point is removable or not. As map generalization is needed in different applications with different requirements, we present two heuristic functions to determine the priority of points removal for two different purposes: to save storage space and to reduce computation time. The time complexity of our algorithm is which is efficient enough to be considered for real‐time applications. Experiments on real maps were conducted and the results indicate that our algorithm produces high quality results; one heuristic function results in higher removal points saving storage space and the other improves the time performance significantly. 相似文献
14.
15.
《制图学和地理信息科学》2013,40(4):276-290
Two basic strategies have been identified for handling multiple representations of line features in digital databases. Either a finite number of scale-dependent representations of cartographic lines can be explicitly stored, or a scale-independent database is generated from which subsequent scale representations can be extracted as needed. These two strategies parallel differences in hierarchical and non-hierarchical line simplification operators. Non-hierarchical line-simplification can produce the most geometrically accurate simplification at any scale, while hierarchical operators are often associated with scale-independent databases. In this research, hierarchical and non-hierarchical line simplification operators are evaluated by comparing both the points retained by these different algorithms and the overall quality of the graphic portrayal for sample lines of different complexity and at different scales. Visual inspection of the results did not reveal any discernable difference at any scale for any line. Subsequent numerical analyses shows some differences but overall little geometric quality is lost by using a hierarchical operator as opposed to a non-hierarchical one and given the greater flexibility of scale representations that is possible, hierarchical methods appear to be more satisfactory. 相似文献
16.
The article is composed of two sections. In the first section, the authors describe the application of minimum line dimensions which are dependent on line shape, width and the operational scale of the map. The proposed solutions are based on the Euclidean metric space, for which the minimum dimensions of Saliszczew’s elementary triangle (Elementary triangle – is the term pertaining to model, standard triangle of least dimensions securing recognizability of a line. Its dimensions depend on scale of the map and width of the line representing it. The use of a triangle in the simplification process is as follows: triangles with sides (sections) on an arbitrary line and bases (completing the sides) are compared with lengths of the shorter side and the base of the elementary triangle.) were adapted. The second part of the article describes an application of minimum line dimensions for verifying and assessing generalized data. The authors also propose a method for determining drawing line resolution to evaluate the accuracy of algorithm simplification. Taking advantage of the proposed method, well-known simplification algorithms were compared on the basis of qualitative and quantitative evaluation. Moreover, corresponding with the methods of simplified data accuracy assessment the authors have extended these solutions with the rejected data. This procedure has allowed the identification of map areas where graphic conflicts occurred. 相似文献
17.
影像匹配是在两幅或多幅具有重叠度的影像中通过特定的算法提取影像间同名点的过程,是低空摄影测量数据处理中最为关键的步骤,匹配质量与效率直接影响到后续数据处理的成功与否,关系到测绘产品生成质量。本文系统阐述了低空摄影测量影像匹配的研究现状与展望。对影像匹配的分类进行总结和归纳,大体上,影像匹配可划分为两大类,即基于灰度和基于特征的匹配。重点针对基于特征的影像匹配,从点、线、面等特征提取算法及特征描述符和相似性测度与策略等方面进行了详细阐述。此外,列举最新的基于深度学习的影像匹配算法,对低空平台搭载的多样化传感器数据融合可能涉及的影像匹配方法进行了展望。 相似文献