一种基于梯形剖分的多边形布尔运算方法

借鉴计算几何学的理论方法,提出一种基于多边形梯形剖分思想的实现方法.首先利用扫描线技术将多边形分解为梯形面片集,以便将多边形的布尔运算转化为梯形面片间的布尔运算;这些梯形面片以扫描行为单元进行组织,梯形之间的布尔运算被限定在相同的扫描行内,可有效简化核心计算过程;在完成梯形单元布尔运算并得到结果梯形集后,通过边界追踪完...     

一种基于圆形窗口的多边形裁剪新算法

本文在相关文献提出的圆形窗口裁减算法基础上,提出了一种圆形窗口裁剪多边形的有效算法.该算法的基本思想是,建立单线性链表数据结构来存储多边形的顶点以及多边形与圆的交点,使用一种免解二次方程的算法来求交点的坐标.该算法与其他同类算法相比,具有较简单的数据结构和较快的运行速度.     

RaPC:一种基于栅格化思想的多边形裁剪算法及其误差分析

传统的基于矢量计算的多边形裁剪算法的时间复杂度介于O(Nlog N)~O(N2)之间,且计算过程与特定的复杂数据结构耦合紧密,难以进行底层优化和细粒度并行化。在满足一定误差要求的前提下,采用栅格化处理思想可以实现多边形快速裁剪。本文在已有多边形裁剪算法特征的基础上,提出了一种基于栅格化处理思想的多边形裁剪算法——RaPC算法,并对其误差进行了分析和讨论。试验结果显示,RaPC算法的计算效率随网格单元增大呈幂函数规律降低;当网格大小恒定时,RaPC算法效率随多边形顶点数量呈线性增长,计算时间复杂度为O(N);在处理小数据集时Vatti算法表现出了较高效率,但是在处理包含大量顶点的多边形叠加时,RaPC算法更为高效;RaPC算法的面积误差与网格大小直接相关,提高网格空间分辨率可以有效地降低面积误差。RaPC算法在处理包含大量顶点的多边形叠加分析时比Vatti算法更为高效。     

一种任意简单多边形求差算法

提出一种基于线段操作的简单多边形求差算法。该算法的主要过程为:应用基于单调链的扫描线求交算法,求取交点,该过程减少了求交过程中的比较次数,从而提高了求交效率。基于线段操作的结果多边形连接算法,该过程利用基础的计算几何理论,寻找构成结果多边形的边,得到两个多边形的差。实验表明该算法思路简单,数据结构简单,易于编程实现,对于简单多边形求差问题具有普适性。     

简单矢量数据多边形裁剪问题的图模型

无拓扑信息的矢量数据多边形裁剪问题是解决GIS叠置分析的基础。本文借鉴GIS中弧段结点模型的思想，建立描述两多边形集合间裁剪问题的图模型，以解决现有算法实现在处理大数据量裁剪时暴露的问题。本模型运用图中定义的顶点和边分别表示结点和弧段，使集合间实体的关联性得以增强，结果区域边界的重组过程得到简化。针对海量数据的存取特性，设计并实现了该模型的数据组织方式及其构建算法。最后以大数据量GIS叠置分析为例, 将本文实现与Vatti算法实现加以比较，实验表明，本实现在进行大数据量的两多边形集合裁剪时效率较高；同时，程序具有合理调配其内存空间中栈和堆资源使用的能力，这使其健壮性强于后者。     

浅议带有内边界的多边形裁剪算法的追踪过程

任意多边形的裁剪算法在地图制图过程中和GIS空间数据处理中具有重要意义。本文依照Weiler-Atherton算法,在不带内边界的无拓扑关系任意多边形裁剪算法基础上,论述了带内边界的无拓扑关系任意多边形裁剪算法的步骤和裁剪子区域多边形的追踪过程,为研究更为复杂的任意多边形裁剪算法提供了思路,使Weiler-Atherton算法应用更为广泛。     

以节点操作实现多边形求交的算法

根据多边形之间的交点状态确定与交点相关的节点信息,以节点操作为核心求解两多边形之间的交集。在此基础上,考虑重叠边、边边相交于边节点等情形,通过遍历交点来完成交集多边形边界的构建,从而提出一种多边形求交运算的改进算法。该算法结构简单,具有较快的计算速度和较高的效率,适合于地理信息系统中的空间叠置分析、缓冲区分析应用,对于地图制图中区域要素的截取操作也具有重要的参考价值。     

基于单调链的Red/Blue扫描线求交算法

提出了一种基于单调链的Red／Blue平面扫描线算法。该算法针对GIS中线段之间具有连接关系的特性，将平面连接线段集分解为一组单调链，通过对单调链的粗扫描过滤和对线段的精扫描求交，减少了扫描过程中的冗余计算，提高了线段集求交点的效率。实验证明，该算法对于处理具有连接关系的线段集的求交点问题具有很高的效率。     

两个简单多边形求交的算法

采用了双向链表这种数据结构,对两简单多边形的顶点及交点进行存储,在对交点进行插入时,可直接插入链表中,避免了利用单向链表或数组进行存储时对点的重复查找。通过遍历两个顶点、交点混合表,可得到两多边形的交及多边形的顶点,从而得到两多边形的交集。相对其他类似的算法,该算法具有较快的计算速度和较高的效率。     

基于单调链和STR树的简单要素模型多边形叠置分析算法

针对简单要素类叠置分析的特点,利用STR(sort-tile-recursive)树索引改进算法能够将尽量多的多边形节点存储在STR树的叶节点中,减少在空间数据库中检索多边形时的磁盘读取次数。算法对多边形边界进行关于坐标轴的单调链分割,并在多边形求交过程中引入平面图的概念,利用平面图元素与各个多边形的拓扑关系来组织叠加后的多边形。该算法能有效减少求交点的时间,在线段求交中加入对连续出入点特殊数据的处理。同时该算法使用单调链减少多边形求交过程的比较次数,与其他使用双链表或单链表的算法相比具有占用空间少及处理速度快的特点。     

Global and local indicators of spatial association between points and polygons: A study of land use change

The existing indicators related to spatial association, especially the K function, can measure only the same dimension of vector data, such as points, lines and polygons, respectively. We develop four new indicators that can analyze and model spatial association for the mixture of different dimensions of vector data, such as lines and points, points and polygons, lines and polygons. The four indicators can measure the spatial association between points and polygons from both global and local perspectives. We also apply the presented methods to investigate the association of temples and villages on land-use change at multiple distance scales in the Guoluo Tibetan Autonomous Prefecture in Qinghai Province, PR China. Global indicators show that temples are positively associated with land-use change at large spatial distances (e.g., >6000 m), while the association between villages and land-use change is insignificant at all distance scales. Thus temples, as religious and cultural centers, have a stronger association with land-use change than the places where people live. However, local indicators show that these associations vary significantly in different sub-areas of the study region. Furthermore, the association of temples with land-use change is also dependent on the specific type of land-use change. The case study demonstrates that the presented indicators are powerful tools for analyzing the spatial association between points and polygons.     

综合线面特征分布的点目标多尺度聚类方法

考虑空间数据分布的复杂性与不连续性,提出了一种点目标聚类方法。算法利用全要素Voronoi图准确识别与表达点目标与线面实体的空间相关性;根据点目标位置分布特征计算面积阈值来控制聚类的粒度,同时以空间尺度变化下面积阈值的恒定作为判断尺度收敛的条件,实现点目标的多尺度划分,时间复杂度为O(nlogn)。经试验验证,聚类尺度随点目标分布特征自适应收敛,算法无须自定义参数,能够有效地发现受线面目标约束的任意形态点目标集群,对异常值处理稳健。     

Temporal Interpolation of Spatially Dynamic Polygons

In this study we compare two methods of interpolating simple metrics from polygons that change over time. Conventional methodology involves computing values of the metrics at points in time where the polygon is observed, and interpolating between these observed values to estimate values at other points in time. An alternative method applies interpolation techniques to the locations of vertices composing polygons are interpolated between observations and metrics are computed from the interpolated polygon shapes. We conducted a Monte Carlo simulation of both techniques using simulated polygons composed of varying numbers of vertices, which were allowed to move randomly over varying numbers of discrete time periods. We observed differences in the success of the two methods when applied to three metrics: Area, Perimeter, and Area/Perimeter Ratio. We found the two techniques to perform differently depending upon the metric being interpolated. Full results are presented and possible reasons why the techniques succeeded or failed under various conditions are discussed.     

大范围地理空间信息点对点坐标转换设计与实现

介绍了大范围地理空间信息点对点坐标转换的思路,重点论述了该技术的关键,即在充分记录多点定位图形的原始构成信息后,将其分解为离散点,以点方式进行坐标转换,最后根据图形的原始信息来恢复图形。     

GIS中缓冲区自动生成问题研究

缓冲区分析(Buffer Analysis)是地理信息系统(GIS)重要的空间分析功能之一。地理信息系统中的缓冲区生成分点、线、面三种,其中线状目标缓冲区生成是关键和基础。本文将线状目标缓冲区的生成分为每个线状目标缓冲区多边形独立生成过程和所有线状目标缓冲区多边形重叠合并过程两个阶段,并分别给出了相应的矢量算法。     

An efficient solution for building polygonal objects

Polygonal object is a fundamental type of geometric data in vector GIS. The key step of cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are sho     

An efficient solution for building polygonal objects

Polygonal object is a fundamental type of geometric data in vector GIS. The key step cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are shown in a single scan. Experiments show that the two algorithms together offer a robust and efficient solution for building polygonal objects from intersected arcs.     

利用骨架线端点匹配进行面状要素渐变变换

面向空间数据连续地图综合问题,提出了一种基于骨架线端点匹配的面状要素渐变方法,通过在两个关键表达之间进行尺度内插,实时、动态地派生任意中间比例尺地图数据。首先,对面状要素在大小比例尺下的两重表达分别进行约束Delaunay三角网剖分并提取各自的骨架线特征;然后,使用最优子序双射优化技术对骨架端点进行匹配获得多边形边界上相对应的特征点序列;最后,在剖分边界的基础上进行分段常规线性内插,获得面状要素介于始末尺度之间的多尺度表达。实验结果表明,该算法充分顾及了空间数据弯曲结构特征,对于光滑边界面状要素的渐变变换具有良好的渐变效果,可用于空间数据的连续地图综合和多尺度表达。     

Detecting vehicle traffic patterns in urban environments using taxi trajectory intersection points

Abstract

Detecting and describing movement of vehicles in established transportation infrastructures is an important task. It helps to predict periodical traffic patterns for optimizing traffic regulations and extending the functions of established transportation infrastructures. The detection of traffic patterns consists not only of analyses of arrangement patterns of multiple vehicle trajectories, but also of the inspection of the embedded geographical context. In this paper, we introduce a method for intersecting vehicle trajectories and extracting their intersection points for selected rush hours in urban environments. Those vehicle trajectory intersection points (TIP) are frequently visited locations within urban road networks and are subsequently formed into density-connected clusters, which are then represented as polygons. For representing temporal variations of the created polygons, we enrich these with vehicle trajectories of other times of the day and additional road network information. In a case study, we test our approach on massive taxi Floating Car Data (FCD) from Shanghai and road network data from the OpenStreetMap (OSM) project. The first test results show strong correlations with periodical traffic events in Shanghai. Based on these results, we reason out the usefulness of polygons representing frequently visited locations for analyses in urban planning and traffic engineering.     

Evaluating the Relationships between Fire Induced Canopy Mortality and Pre‐fire Multispectral Patterns

Abstract

Statistical tools were used to evaluate the relationships between observed fire effects and characteristics identifiable in pre‐fire multispectral and terrain data. Random points were placed within field delimited polygons representing areas of high and low canopy mortality. Each point was then used to extract Landsat TM based pre‐fire spectral characteristics and DEM derived terrain characteristics. The values for these random points were subjected to a multivariate discriminant analysis to ascertain whether specific spectral bands, indices, terrain characteristics, or specific combinations of these, could be effectively associated with the observed fire effects. Data values for high and low mortality points were found to be significantly different for all the pre‐fire data sets. The normalized difference vegetation index (NDVI) and tasseled cap greenness values provided the highest magnitude of direct differentiation between high and low mortality points. Discriminant analysis revealed that NDVI had the highest correspondence to degree of future canopy mortality, while the combined effect of the pre‐fire spectral response provided a prediction of observed fire effects with 87% accuracy, and the addition of terrain data improved accuracy to 90%.