共查询到19条相似文献,搜索用时 171 毫秒
1.
Voronoi图及其生成是计算几何的重要内容。针对传统栅格加权Voronoi图的权重界定局限性,以及栅格数据下Voronoi图生成的计算效率问题,本文研究了基于雷利法则的生长元规模权重和栅格欧氏距离变换权重作为综合权重条件下,规避单图幅背景栅格与每一生长元之间的距离计算,根据生长元各自距离变换图幅构建栅格加权Voronoi图,即雷利Voronoi图(Reilly Voronoi diagram,RVD)的地图代数生成方法。经试验验证,该方法生成的Voronoi图不仅完善了传统的权重因素,而且避免了因背景栅格与生长元的距离运算、判断而产生的大量计算,证明了该方法的切实可行性。 相似文献
2.
网络最短路径的地图代数栅格算法 总被引:4,自引:1,他引:3
在阐述网络分析和最短路径算法的现状的基础上,以地图代数为理论支撑,介绍了地图代数对于网络元素的表达,探讨另外一种途径的网络最短路径分析—基于栅格数据的最短路径分析,重点讨论了基于地图代数的网络数据模型、栅格路径距离计算方法,在此基础上论述了求取最短路径的栅格方法的具体过程。最后,通过算例证明栅格途径的网络分析有其独特的优势。 相似文献
3.
4.
5.
6.
在越野通道分析中,利用栅格的思想,将矢量地形数据栅格化,将影响通行的因素转化为相应栅格的属性,使用迷宫算法可以有效地进行最短路径分析.但迷宫算法具有一定的局限性,需要对其进行优化.利用以直代曲和样条模型的思想,即直线距离总比曲线距离短,最短路径是由一系列样条曲线组成,通过分析,在迷宫算法所得路径的基础上,提出了一种优化算法.实验结果表明,利用迷宫算法结合优化算法可以较好地解决越野通道分析中的最短路径问题. 相似文献
7.
将行人的生理因素与GIS路径分析有机结合起来,根据生理学研究进展,建立了步行体能消耗计算模型,并提出了基于坡度转换的等效水平距离计算原则,从而将三维空间距离转换为等体能消耗平面距离,实现了顾及地形起伏的最优路径算法。实验结果表明,该算法具有兼顾坡度与距离关系的优势,提高了路径分析方法的有效性。 相似文献
8.
扫描细化算法的地图自动矢量化研究 总被引:1,自引:0,他引:1
栅格地图自动矢量化是地理信息采集的重要方式,但目前的主流自动矢量化软件的处理结果却不尽如人意,需要进行大量的后期编辑处理。本文根据栅格线体的形态特征设计了通过对栅格线体的序贯推扫获取待定像元,再从待定像元处进行截断扫描获取截断处的中心像元,最后再反连该中心像元及上一中心像元的扫描细化算法。该算法的细化结果受线体边缘条件的影响小、中心特征像元较少、细化精度较高。设计了针对于扫描细化算法计算结果中细化线体像元被分为了特征点与普通点的自动追踪矢量化算法,减少了坐标转换量的同时还使矢量线体结点较少、拟合光滑后更加趋于栅格线体中心、在交点处线体不相互打断,大大提高了自动矢量化及其后处理工作的效率。文章还分析了栅格区划图的自动矢量化及后处理方法。 相似文献
9.
10.
11.
Multi‐criteria evaluation (MCE) procedures are widely used in raster‐based geographic information systems (GIS) to perform a variety of land use siting applications. Many of the criteria used in an MCE analysis are based on spatial relationships or situation characteristics. Situation factors measure the accessibility that each raster cell is to resources or land uses that generate spatial externalities for the activity being sited. This accessibility can be measured either in terms of distance to the nearest target cell containing resources or the overall level of resource availability as measured by a spatial interaction model. This paper examines the spatial structure of these situation factors to identify the set of critical target cells for which distance estimates are most sensitive. Critical target cells are especially important in the case of positive externalities in which an activity would be inclined to locate near these cells to use or consume the resources there. Critical target cells are useful for evaluating the utility of the final site selection with respect to resource/activity ratios. 相似文献
12.
Harri Antikainen 《Transactions in GIS》2013,17(1):96-108
The conventional raster‐based least‐cost path technique, in which the connectivity graph is constructed by treating each raster cell as a node and linking each node to its adjacent neighbors, has been widely used to determine optimum paths in space. Unfortunately, paths calculated with this method are subject to distortions that stem from the imposed node‐link structure. Due to the distortions, the calculated paths may be longer than the true optimum paths in continuous space, and because of this, they may also look highly unrealistic when displayed on a map. This study examines how the quality of the raster‐based paths can be improved by using larger connectivity patterns on the one hand, and placing nodes on the sides of the cells of a raster instead of at their centers, on the other. In addition, the utility of the quadtree structure is examined. The different methods are evaluated against three different datasets using the cost distance of the calculated paths and processing times as evaluation criteria. The results indicate that raster‐based paths can be improved by using the evaluated techniques, although the degree of improvement is also dependent on the properties of the underlying cost raster. 相似文献
13.
针对障碍存在情况下距离变换研究较少的问题,提出了一种基于元胞自动机的绕障欧氏距离变换方法。以南海为例,基于海陆分布数据和目标点数据,以最短绕障路径长度为元胞状态,设计了包含距离算子的元胞状态转换规则。通过元胞自动机模拟距离扩散计算过程,得到绕障距离变换结果,并分析了绕障效果和精度。结果表明:本文方法动态直观地展示了绕障距离变换过程,能够自动计算绕过障碍的最短距离;具有更新机制,能够根据邻域的变化修正状态值;为绕障距离变换问题提供了一种近似的解决途径,错误率低于3.96%,可应用于航线设计、海上救助等领域。 相似文献
14.
15.
16.
Identifying a route that avoids obstacles in continuous space is important for infrastructure alignment, robotic travel, and virtual object path planning, among others, because movement through space is not restricted to a predefined road or other network. Vector and raster GIS (geographic information system) solution approaches have been developed to find good/efficient routes. On the vector side, recent solution approaches exploit spatial knowledge and utilize GIS functionality, offering significant computational advantages in finding an optimal solution to this path routing problem. Raster‐based shortest path techniques are widely applied in route planning for wayfinding, corridor alignment, robotics and video gaming to derive an obstacle avoiding path, but represent an approximation approach for solving this problem. This research compares vector and raster approaches for identifying obstacle‐avoiding shortest paths/routes. Empirical assessment is carried out for a number of planning applications, highlighting representational issues, computational requirements and resulting path efficiency. 相似文献
17.
Voronoi图是计算几何学中一个重要数据结构,在诸多领域具有广泛的应用。栅格扫描算法符合计算机离散特征,优化了欧氏距离算法,是最优的栅格Voronoi图生成算法之一。但是,由于栅格单元距离与欧氏距离的差异,在扫描过程中部分单元的归属不可避免地产生一定的误差,使栅格Voronoi图的应用受到一定限制。本文针对传统扫描算法存在的误差缺陷,提出了一种基于横-纵扫描的栅格Voronoi图改进生成算法。首先,深入分析了传统扫描算法产生误差缺陷的原因和区域分布特征;然后,以3×3邻域为模板,在一个正常周期的水平(横向)扫描后,增加一个周期竖直(纵向)扫描,即通过横-纵两个周期扫描实现Voronoi图的准确生成;最后,应用不同的栅格数据进行了试验对比,结果表明:改进后的算法既具备扫描算法效率上的优势,同时解决了原算法扫描的误差缺陷,在高效生成的同时把误差限制在一个格网以内。 相似文献
18.
19.
多边形骨架线与形心自动搜寻算法研究 总被引:7,自引:3,他引:7
针对GIS中的应用,分析了传统的多边形骨架线与形心提取算法的不足之处,提出了一种基于约束Delaunay三角网结构的多边形主骨架线与形心的自动搜索算法,详细描述了该方法的基本思想,并在实验结果基础上分析了该算法的特点。 相似文献