基于三角网的"种子法"多边形生成

将传统上广泛使用的“种子法”和“矢量求交法”的思想相结合 ,提出了一种基于约束Delaunay三角网结构的多边形生成算法。详细描述了该方法的基本思想 ,在实验基础上分析了算法的特点。     

基于特征边重构的建筑物化简方法

针对轮廓模糊建筑物多边形的化简问题,提出一种基于特征边重构的建筑物化简方法。该方法定义了建筑物的主方向和控制其整体结构的特征边,以保持建筑物的规则形态。首先利用统计加权方法计算建筑物的主方向,基于主方向对建筑物执行直角化操作。然后按照特征边的定义检测直角化建筑物的特征边,将特征边组合并抽象出几种局部结构,建立重组规则。最后通过判别特征边组合的空间关系,选择合适的结构重组规则来化简建筑物。结合真实数据进行多组试验,结果表明该方法有效还原了建筑物的直角特征,面积和形状保持良好,适用性强。     

Pattern based map comparisons

Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, pattern based map comparison techniques address the question of structural similarity, although with these approaches the comparison problem becomes open ended, since there is an unlimited number of ways to characterise a pattern. Two types of pattern based technique are used here to analyse the test sets of maps. The first, a fuzzy polygon based matching technique, focuses on the meso-scale aspects of pattern. It is based on the areal intersection of land use polygons on the two maps being compared. The areal intersection, areal complement, and polygon size values are fuzzified into an appropriate set of categories, a set of fuzzy inference rules is applied to derive memberships in local matching categories, and finally the local matching category memberships are defuzzified to yield local matching values for each land use polygon on the reference map. The second approach, fractal analysis, captures macro-scale or global qualities of the maps. Two measures are calculated here: the radial dimension and the cluster size—frequency dimension. The polygon matching approach provides only limited insight when applied to the case of the map set representing differences in classification. It proves much more effective when applied to the problem of change detection, revealing areas where the pattern has changed and giving local measures of the degree of change. The approach is particularly useful in the case where there is a considerable degree of random change at the pixel level, as changes in the underlying pattern are extracted from the noise, while pixel based approaches largely detect the noise.     

多边形骨架线与形心自动搜寻算法研究

针对GIS中的应用，分析了传统的多边形骨架线与形心提取算法的不足之处，提出了一种基于约束Delaunay三角网结构的多边形主骨架线与形心的自动搜索算法，详细描述了该方法的基本思想，并在实验结果基础上分析了该算法的特点。     

一种单线与多面要素间的拓扑关系描述方法

本文将线要素与多面要素的拓扑关系分解为简单面要素与其相关线组之间的局部拓扑关系;并将局部拓扑关系细化为线面基本拓扑关系,用度量关系对线面基本拓扑关系进行描述,提出了一种描述单线与多面要素之间拓扑关系的方法,可应用于线与多面要素数据库的建立、数据存储和查询。实验证明了其有效性。     

Using an Energy Minimization Technique for Polygon Generalization

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.     

顾及邻近五点的建筑物多边形化简方法

针对传统的建筑物化简算法无法准确保持建筑物局部细节几何特征,容易产生尖锐凸角等问题,提出了一种基于邻近五点的建筑物多边形化简方法。通过将多边形边界上的邻近五点定义为基本处理单元,实现对建筑物边界Z形平行、Z形不平行、U形平行、U形不平行的4类几何模式划分,进行渐进式化简,并针对化简过程中产生的尖角顾及角度约束对其削尖。对某地区部分1∶1万实际建筑物多边形数据进行试验,结果表明,所提算法在保持建筑物基本几何形态特征的基础上,能够尽可能地避免尖角的产生,化简结果更加符合人类的视觉认知。     

Modeling Dynamic Polygon Objects in Space and Time: A New Graph-based Technique

The analysis of dynamic spatial systems requires an explicit spatio-temporal data model and spatio-temporal analysis tools. Event-based models have been developed to analyze discrete change in continuous and feature-based spatial data. In this paper, a spatio-temporal graph model is described that supports the analysis of continuous change in feature-based polygon spatial data. The spatio-temporal graph edges, called temporal links, track changes in polygon topology through space and time. The model also introduces the concept of a spatial-interaction region that extends a model's focus beyond short-term local events to encompass long-term regional events. The structure of the spatio-temporal graph is used to classify these events into five types of local polygon events and two types of spatial-interaction region events. To illustrate its utility, the model is applied to the ecological question of how patch size influences longevity in underwater plant communities in Chesapeake Bay, USA. Both a short-term local analysis and a longer-term regional analysis showed that patches of plants, or groups of patches, larger than one to two hectares in size were more likely to persist than smaller patches or groups of patches. Overall, the spatio-temporal graph model approach appears applicable to a variety of spatio-temporal questions.     

拓扑多边形自相交判断及纠正方法

提出了一种解决地形图处理中拓扑多边形自相交问题的方法。首先在原多边形内部构建新多边形,通过判定新多边形的顶点是否为原多边形内点实现了多边形自相交的判断。最后利用三种方式对存在自相交的多边形进行纠正。基于VC＋＋6.0实现相关功能,并以实例验证了这一方法的稳定性和可行性。     

用栅格填充法建立多边形文件

栅格填充法建立多边形文件,是基于栅格象元“蔓延”算法,从“内点”出发自动搜索多边形轮廓边的地理数据处理方法。该法能适应任意复杂(具有“飞地”或“空洞”等情况)的多边形。该软件已成功地应用于作者研制的关系型地理数据库软件系统(RGDBS)。本文简述了该法的基本原理和有关算法。     

基于约束点的无拓扑多边形数据压缩算法

分析了常规压缩算法(如Douglas-Peucker算法)压缩无拓扑多边形数据会产生公共边界不一致现象,认为出现此现象的原因是多边形公共边界的压缩起始点选择不一致,进而提出了一种新的基于约束点的无拓扑多边形数据压缩算法。算法原理包括:首先将多边形公共边界的两个端点作为约束点处理,使得多边形从约束点处逻辑上分成几段;然后利用常规压缩算法进行分段压缩,使每一多边形公共边界的压缩初始点一致,从而保证了无拓扑多边形数据的一致性压缩;最后大量试验验证了此算法的有效性。     

凹边形地标参照的主方向关系推理方法

空间推理是地球空间信息、人工智能、自然语言处理等相关领域的热点研究内容。主方向关系的表达与推理是空间推理的重要组成部分。针对空间方向关系矩阵对凹边形对象方向关系表达、推理的不足,研究依据目标对象与凹边形地标方向关系表达的不确定性,提出了凹边形地标参照的外部性主方向关系与内部性主方向关系推理方法。利用凹边形三等分仿射变换矩阵、自适应分割算法实现凹边形地标外部性、内部性参照对象表达;基于向量三角形法则与方向关系谓词,以方向关系的逻辑和、逻辑差合成代数运算推理2个地标、1个地标参照下目标对象与参照对象之间的主方向关系。通过实验与算例验证,证明凹边形地标参照下目标对象与参照对象的主方向关系推理可行性。     

Automatic placement of GIS vector map annotation in area feature by long-diagonal

IntroductionMap is a graphics expression of spatial infor-mation. Map language includes map symbolwhose basic languageis graphics ,and map anno-tation as nature language (letters) . Map annota-tion plays an i mportant role in computer aidedcartography and GIS.It is a complementarityformap graphics and makes the map hold richer in-formation[1].Map annotation is one of the international ar-duous problemsin automatic map generalization.With the development of computer technology ,the automatic …     

Automatic placement of GIS vector map annotation in area feature by long-diagonal

This paper discusses the placement of Chinese annotation from point of view of graphics. Area Feature is classified as simple polygon, complex polygon and special polygon. For simple ones, annotations are placed along the longest edge. For complex ones, firstly the polygon are simplified according to close points, then the longest diagonal is gotten by comparing length, lastly, annotations are placed along long-diagonal. For special ones, the polygon are partitioned into several parts by a certain rule for getting their sub-diagonals, then their annotation are placed by means of the second.     

局域差分GPS的数学模型

局域差分GPS中,用户到基准站的距离对定位精度有着决定性影响。利用基准站生成用户误差改正数,其算法很多。文中针对局域差分GPS的数学模型空间相关性,介绍几种常用的内插方法,如加权平均法、线性内插法、低次曲面模型法及三角形内插法,并分析各种方法的内插系数和内插质量因子。利用局域差分GPS进行定位时,只有当用户站位于基准站构成的多边形网内时,才可能得到较高的精度。     

引入结点度的线/面拓扑关系细分方法与应用

针对线/面细分拓扑关系研究存在的不足,提出了一种基于结点度的线/面细分拓扑关系描述与计算方法。该方法在定义线/面单元交线并分析其特点的基础上,引入结点度来区分线/面单元交线细分类型。根据单元交线端点在线/面目标组成图形结构中结点度的不同,及线目标在度为3和4的交线端点处是否有相连线段、相连线段位于多边形的边界上、内部或外部4个谓词推导出了21种有意义的线/面交线细分拓扑关系类型。在此基础上分析比较了本文方法与现有方法的异同与优势,举例说明本文方法在复杂线/面细分拓扑关系描述中的应用。最后用Visual C#语言编程实现了该方法,并将其应用到线状道路/面状河流目标间的数据质量检查与修正中,验证可行性。     

射线法判断点与包含简单曲线多边形关系的完善

点与多边形关系的判断问题一直是计算机图形学中的基本问题之一,目前判断点与多边形关系的射线法只考虑多边形边界全部由直线组成,而在实际应用中,多边形边界经常包含简单曲线。本文以圆弧为例,在分析已有射线法基础上,提出对射线法的完善算法,解决了点与包含圆弧的复杂多边形关系的正确判定。     

长对角线法实现GIS中矢量地图面状地物汉字注记的自动配置

从图形学角度探讨了面状要素自动注记的问题，认为对于GIS矢量地图中大量的复杂面状图形可以通过简化后构建其简单多边形，进而获取简单多边形内的最长对角线作为注记配置的基准线，提出了一种简单快速的地图面状地物汉字注记自动配置的新算法。     

Delaunay三角网内插多边形算法研究

针对Delaunay三角网内插多边形的实用性,提出了一种Delaunay三角网快速内插多边形算法,该算法先将多边形的边作为约束数据入网,然后对多边形内部三角形进行清空处理.在影响区域及多边形内部三角形确定上,提出了一种快速解决方法,大大提高了算法的执行效率.     

Delaunay三角网内插多边形算法研究

针对Delaunay三角网内插多边形的实用性,提出了一种Delaunay三角网快速内插多边形算法,该算法先将多边形的边作为约束数据入网,然后对多边形内部三角形进行清空处理。在影响区域及多边形内部三角形确定上,提出了一种快速解决方法,大大提高了算法的执行效率。