共查询到20条相似文献，搜索用时 15 毫秒
1.
Voronoi图生成算法受到计算效率或生长源类型的限制,难以支撑线/面生长源Voronoi图的构建。本文提出一种生成线/面生长源Voronoi图的分解合并算法,其主要过程是将线/面生长源离散为特征点表达,通过特征点交叉建立最近特征点对,并以最近特征点对Voronoi子区域的交来部分地代替线/面生长源的等距离边界,算法以前后迭代离散计算的Voronoi子区域面积差分作为条件,可有选择地将部分生长源置入迭代过程,使线/面生长源Voronoi子区域逐步调整并达到精度要求。 相似文献
2.
本文提出一种基于Head-Tail信息量分割的地理要素多尺度表达模型。首先通过傅里叶变换将地理线要素转换为傅里叶描述子,并通过香农信息熵理论计算其频域信息量。然后,按Head-Tail数据分布模式确定地理要素信息量的分界点,并设计函数对各个分界点所对应的傅里叶截断频率进行估计。最后,参考传统方根模型,建立以地理要素频率信息量为基础的信息方根模型,计算与各个地图层次相对应的关键尺度,实现地理要素的层次化多尺度表达。采用等高线及海岸线的数据试验表明,本文所提出的模型能够有效根据设定的比例尺对地理要素进行化简,对不同目标比例尺的简化结果体现出了良好的区分度与层次性。同时,在保证化简结果与原地理要素面积重叠比一致的情况下,本文模型所得到的结果优于传统的简化算法。 相似文献
3.
《The Cartographic journal》2013,50(1):37-45
AbstractThis paper presents a new model for handling positional uncertainty in the process of line simplification. It considers that positional uncertainty in a simplified line is caused by (a) positional uncertainty in an initial line propagated through the process and (b) a deviation of the simplified line from the initial line. In order to describe the uncertainty in the simplified line, the maximum distance is defined as a measure. This measure is further adopted to determine parameters to a line simplification algorithm. Therefore, this model makes a step forward in the implementation of an uncertainty indicator for the line simplification. As compared existing models, the proposed uncertainty model in this paper is more comprehensive in uncertainty assessment for line simplification. 相似文献
4.
Modelling Positional Uncertainty of Line Features by Accounting for Stochastic Deviations from Straight Line Segments 总被引：1，自引：0，他引：1
Sytze de Bruin 《Transactions in GIS》2008,12(2):165-177
The assessment of positional uncertainty in line and area features is often based on uncertainty in the coordinates of their elementary vertices which are assumed to be connected by straight lines. Such an approach disregards uncertainty caused by sampling and approximation of a curvilinear feature by a sequence of straight line segments. In this article, a method is proposed that also allows for the latter type of uncertainty by modelling random rectangular deviations from the conventional straight line segments. Using the model on a dense network of sub‐vertices, the contribution of uncertainty due to approximation is emphasised; the sampling effect can be assessed by applying it on a small set of randomly inserted sub‐vertices. A case study demonstrates a feasible way of parameterisation based on assumptions of joint normal distributions for positional errors of the vertices and the rectangular deviations and a uniform distribution of missed sub‐vertices along line segments. Depending on the magnitudes of the different sources of uncertainty, not accounting for potential deviations from straight line segments may drastically underestimate the positional uncertainty of line features. 相似文献
5.
轨迹线数据实施化简处理对于缓解数据存储、传输压力以及后期的分析可视化效率具有重要意义。常规方法(如Douglas-Peucker算法)主要考虑线目标的几何形态结构,直接应用到轨迹线化简中容易丢失移动物体的运动状态特征。本研究从保持轨迹线隐含速度特征出发,提出了一种基于移动速度相似性原则的轨迹线层次化剖分与分区化简处理方法。首先,以相邻轨迹点构成的直线段为基本单元,在拓扑连接关系约束下基于速度指标对轨迹直线段进行层次化聚类,并将聚类结果组织为层次树结构;然后,以建立的层次树结构为约束条件对原始轨迹线实施分区处理,使得同一区域内轨迹线片段的中间点距首尾基准线的最大时间同步偏移距离小于设定的阈值;最后,依次连接各分区轨迹线片段首尾点导出化简结果。采用真实的车辆轨迹线作为试验数据,通过与其他多种方法进行对比分析验证了本文提出方法的有效性。 相似文献
6.
Eryong Liu 《制图学和地理信息科学》2016,43(4):321-327
This article presents a new development in measuring the positional error of line features in Geographic Information Systems (GIS), in the form of a new measure for estimating the average error variance of line features, including line segment, polyline, polygon, and curved lines. This average error measure is represented in the form of a covariance matrix derived by an analytical approach. Corresponding error indicators are derived from this matrix. The error of line features mainly results from two factors: (1) an error propagated from the original component points of line features and (2) a model error of interpolation between these points. In this study, a method of average error estimation has been derived regarding the first type error of line features that are interpolated by either linear or cubic interpolation methods. The main contribution of the research is the provision of an error measure to assess the quality of spatial data in application settings. The proposed error models for estimating average error variance of line features in a GIS are illustrated by both simulated and practical experiments. The results show that the line accuracy from a linear interpolation is better than a line interpolated using a cubic model. 相似文献
7.
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. 相似文献
8.
9.
求解任意两个简单多边形间的最大距离,在几何图形计算中,一直是一个基本问题。在对多边形自身的特性以及两多边形间关系进行深入分析的基础上,提出了一个基于折线凸包的单调性的简单多边形间最大距离的求解算法。根据封闭折线内部所具有的特性,把封闭折线拆分成两个断开的折线,使一条折线在另一条折线左边。两个多边形分别被拆分成四条折线,两个分为一组。分别求出每组中两条折线的凸包,利用凸包的单调性可以快速地找出两个距离最远的顶点,其中较大的是两个简单多边形间的最大距离。算法的时间复杂度是线性的。 相似文献
10.
鉴于常规曲线化简方法应用于河流曲线化简时难以顾及河流要素的三维特征及其拓扑结构,提出了一种顾及三维形态特征的河流曲线化简方法。该方法利用河流曲线上散点的三维特征对散点进行选取进而实现河流曲线化简。在三维Douglas-Peucker（3D D-P）算法的基础上提出一种三维散点排队法,根据散点的三维特征对河流曲线的离散点集进行排队,并通过初始排队、"3合1"队列合并及约束点位置调整3个过程建立散点队列,然后根据压缩比从队列尾部删除相应比例的点数获得散点综合结果,将综合后的散点按照河流曲线的原始次序重构出化简后的河流曲线。实验结果表明,该方法既能最大程度地保留河流的三维形态特征,又能保证河流曲线之间的拓扑结构一致性。 相似文献
11.
《制图学和地理信息科学》2013,40(3):263-279
Snakes are iterative energy-minimizing splines controlled by both internal constraint forces (internal energy) and external forces (external energy). This paper investigates the use of snakes for the resolution of conflicts in polygonal subdivisions (i.e., polygon maps or polygon mosaics) resulting from the violation of metric constraints which exist if a polygonal object is too small, too narrow, or too close to another polygon. Such metric conflicts are denoted as size and proximity conflicts. In the generalization of polygonal subdivisions, internal energy reflects the resistance of an object to deformation and external energy describes the need for generalization. This paper suggests the usage of a snakes-based algorithm which is triggered in such a way that it achieves the translation, a local and global increase (or decrease) of polygons, or an arbitrary combination of these transformations, depending on the conflicts encountered. Hence, size and proximity conflicts within a group of polygons can be solved simultaneously and holistically. Furthermore, snakes support the propagation of a change of a polygon's geometry to all adjacent neighbors. The proposed algorithm has been implemented in a prototype system that also supports a variety of other polygon generalization algorithms. The main difficulties identified are the intricate setup and fine-tuning of the snakes parameters and the computer resources required by the algorithm. However, the experiments showed that the proposed algorithm is a valuable method for the automated generalization of polygonal subdivisions. 相似文献
12.
数字曲线拐点的自动确定 总被引：3，自引：1，他引：3
毋河海 《武汉大学学报(信息科学版)》2003,28(3):330-335
对于由离散点表示的数字地图与GIS图形数据，本文首先利用两相邻矢量叉积乘积的原理来判定拐点所在的折线边；然后利用曲线光滑原理，在已确定的折线边的两个端点之间，建立一条光滑加密了的S形曲线，把后者看作是原始折线的精确曲线，对它进行曲线段凹向改变点(拐点)的定位计算。对于离散数据来说，此处不是采用通常的数值微分方法，而是多次应用矢量叉积乘积的原理，求出最或然拐点，并看作是理论拐点。为了简化计算量，探讨了如何避免为求拐点而进行光滑加密的辅助计算过程。对此，研究分析了拐点在折线边上的移动规律与其前后的曲线转角之间的相关关系，借此可直接根据原始离散数据作简单计算，在足够精确的程度上得出拐点的位置。 相似文献
13.
一种河口湾海岸线渐进化简方法 总被引：2，自引：2，他引：0
形态复杂的河口湾海岸线自动化简是当前线要素化简研究的难点之一。在现有研究基础上,结合地理特征影响下河口湾海岸线形态特点及海图综合约束,提出一种河口湾海岸线渐进化简方法。该方法以约束Delaunay三角网为支撑构建河口湾骨架线二叉树模型,结构化表达河口湾海岸线形态特征;基于此模型,通过叶子流路渐进取舍、"退化"充分化简细小弯曲或弯曲细小部分,通过局部夸大消除河口湾内视觉冲突等,实现河口湾海岸线化简。试验结果表明,该方法充分化简目标尺度下不可视的局部细节,顾及河口湾海岸线整体形态特征保持,在几何层次、地理层次上都具有一定优越性,适于多种形态河口湾海岸线化简应用。 相似文献
14.
制图综合中建筑物多边形的合并与化简 总被引：2，自引：0，他引：2
讨论了数字环境下顾及建筑物矩形几何特征的多边形自动综合算法,针对多边形之间的拓扑邻近与视觉邻近两种空间关系,提出了基于矢量和基于栅格的两种建筑物多边形合并方法。关于建筑物形状的化简,本文提出了矩形差分方法,并在此基础上建立了建筑物多边形化简的层次化途径。 相似文献
15.
基于QTM的线状图形自动化简算法探讨 总被引：3，自引：1，他引：3
全球网格是由形成地球表面剖分的一系列区域所组成,八面体四分三角网(QTM)是其中一种具有层次性的网格。本文依据数据点在规则网格中的分布规律,提出了一种在QTM数据结构支持下的线状图形化简算法。该算法以经过每级QTM网格的数据点的平均值为标准,能自动地对比较平缓的线段进行较粗选点,而对相对复杂的线段进行较密选点。本文以及Dutton算法都能克服DouglasPeucker算法中难以客观和合理确定阈值的困难,但是本算法比Dutton算法简单,且具有更高的化简率,能更好地保留了线状图形的弯曲特征。 相似文献
16.
17.
Wolf-Dieter Rase 《Journal of Geographical Systems》2001,3(2):199-213
The interpolation of continuous surfaces from discrete points is supported by most GIS software packages. Some packages provide
additional options for the interpolation from 3D line objects, for example surface-specific lines, or contour lines digitized
from topographic maps. Demographic, social and economic data can also be used to construct and display smooth surfaces. The
variables are usually published as sums for polygonal units, such as the number of inhabitants in communities or counties.
In the case of point and line objects the geometric properties have to be maintained in the interpolated surface. For polygon-based
data the geometric properties of the polygon boundary and the volume should be preserved, avoiding redistribution of parts
of the volume to neighboring units during interpolation. The pycnophylactic interpolation method computes a continuous surface
from polygon-based data and simultaneously enforces volume preservation in the polygons. The original procedure using a regular
grid is extended to surface representations based on an irregular triangular network (TIN).
Received: 5 October 2000 / Accepted: 20 December 2000 相似文献
18.
针对多尺度匹配中同名实体位置偏差较大,无法直接通过面积重叠法获得候选匹配的问题,本文提出了一种基于最小外包矩形（MBR）组合优化算法的多尺度面实体匹配方法。本文方法的基本思想是通过MBR组合优化和简要的形状特征来筛选1∶1、1∶N和M∶N候选匹配,然后构建多因子人工神经网络模型来评估候选匹配。试验选取浙江省舟山市1∶2000岛礁基础数据和1∶10 000陆地基础数据中的居民地与设施面进行匹配算法的验证。结果表明,本文方法相对于基于面积重叠-神经网络的匹配方法表现出显著的优势,对存在位置偏移的匹配数据准确率和召回率分别达到了达到96.5%,达到89.0%,且能够识别所有匹配类型。 相似文献
19.
Paulo Raposo 《制图学和地理信息科学》2013,40(5):427-443
A new method of cartographic line simplification is presented. Regular hexagonal tessellations are used to sample lines for simplification, where hexagon width, reflecting sampling fidelity, is varied in proportion to target scale and drawing resolution. Tesserae constitute loci at which new sets of vertices are defined by vertex clustering quantization, and these vertices are used to compose simplified lines retaining only visually resolvable detail at target scale. Hexagon scaling is informed by the Nyquist–Shannon sampling theorem. The hexagonal quantization algorithm is also compared to an implementation of the Li–Openshaw raster-vector algorithm, which undertakes a similar process using square raster cells. Lines produced by either algorithm using like tessera widths are compared for fidelity to the original line in two ways: Hausdorff distances to the original lines are statistically analyzed, and simplified lines are presented against input lines for visual inspection. Results show that hexagonal quantization offers advantages over square tessellations for vertex clustering line simplification in that simplified lines are significantly less displaced from input lines. Visual inspection suggests lines produced by hexagonal quantization retain informative geographical shapes for greater differences in scale than do those produced by quantization in square cells. This study yields a scale-specific cartographic line simplification algorithm, following Li and Openshaw's natural principle, which is readily applicable to cartographic linework. Open-source Java code implementing the hexagonal quantization algorithm is available online. 相似文献
20.
在保证多边形之间拓扑关系完整的基础上,分别使用垂距限值法和Douglas-Peucker算法对多边形形状进行了简化,同时从多边形常规参数以及相似度等方面对简化后多边形的质量进行了评价。实验结果表明Douglas-Peucker算法的简化效果较好。 相似文献