Subdivision of polygon parcel in land-use data generalization

In land-use data generalization, the removal of insignificant parcel with small size is the most frequently used operator. Traditionally for the generalization method, the small parcel is assigned completely to one of its neighbors. This study tries to improve the generalization by separating the insignificant parcel into parts around the weighted skeleton and assigning these parts to different neighbors. The distribution of the weighted skeleton depends on the compatibility between the removed object and its neighbor, which considers not only topological relationship but also distance relationship and semantic similarity. This process is based on the Delaunay triangulation model. This paper gives the detailed geometric algorithms for this operation.     

Analyzing the effects of scale and land use pattern metrics on land use database generalization indices

The generalization index system is one of the critical issues for computer-aided land use database generalization. This paper studies the scale and land use pattern effects on land use database generalization indices and estimates the thresholds of these indices based on a typical land use database sample. The index system of land use database generalization is discussed and constructed from macro and micro perspectives. Six land use pattern metrics, namely, land use diversity index, land use dominance index, land use homogeneity index, land use fragmentation index, the index of land use type dominance, and the index of land use type fragmentation, are designed to characterize land use patterns and are introduced into the analysis of land use pattern effect on land use database indices. The analysis framework of the scale and land use pattern effects on the land use database indices are proposed by employing statistical techniques. Based on the land use database samples at multiple spatial scales collected in various land use regions across China, the study generates rules for both scale and land use pattern effects on the indices, including map area proportion of land use types, total map load, parcel map load, and minimum parcel area. The thresholds of these indices in land use database generalization are produced at the scales of 1:50,000, 1:100,000, 1:250,000, and 1:500,000. An experimental generalization at county level demonstrates how to determine the generalization index values considering scale and land use pattern, and how to evaluate the generalization results using our macro indices.     

地籍空间实体及其时空拓扑关系

从地籍实体及其静态空间关系的推导出发,讨论了地籍变更的几种类型,创造性地应用地籍实体变更事件驱动地籍空间实体及其拓扑关系的变更,并把地籍变更情况下时空发生的变化归结为碎分和复合进行处理。     

地图目标移位的面目标变形约束及其处理(英文)

The displacement operator is an important and still a hot topic in map generalization. In the generalization product, symbols must be unambiguous and easily perceived and readily understood, which makes space competition among features an important obstacle in the process of map objects displacement. Space conflict between objects, through propagation process, may be spread and more objects may drift into it. In order to maintain symbols equilibrium and spatial relationship between objects, some unimportant symbols or parts of symbols should be distorted under constraints according to visual graphic resolution thresholds to figure out space competition among map features. Three constraints including position, legibility and characteristics are important for the maintenance of symbols equilibrium and spatial relationship, which are discussed in this paper. The skeleton is introduced to represent area objects figure characteristic, in which an area object can be separated to parts hierarchically according to their importance in the construction. Then, the finite element method is applied to the map objects’ displacement and distortion, in which a strategy for the parameters of finite element method is discussed. Supported by the National Science Foundation of China (No.40401050), the Leading Academic Discipline Project of Shanghai Educational Committee (No.J50104), the Science Foundation of Shanghai Education Department (07ZZ09).     

支持地图综合的面状目标约束Delaunay三角网剖分

针对多边形面状目标的综合问题,建立了二维空间中约束Ｄｅｌａｕｎａｙ三角网剖分结构,融入多边形的环、岛屿、边界、顶点的描述,通过形式化条件检索,在该结构上提取二维空间中各种感兴趣的由剖分三角形组成的区域,用于支持地图综合中邻近多边形的搜索、多边形弯曲部位的识别、冲突关系探测、多边形合并等操作。并对基于骨架线的图结构建立、分枝宽度计算等几何问题进行了详细讨论,指出了其在诸如双线河中轴化、街道中轴线网络模型建立、多边形合并中的邻近关系分析、面状目标注记自动定位领域的支持作用。     

Accurate area determination in the cadaster: case study of Slovenia

This paper discusses methodological problems of accurate area determination in the cadaster. The paper contrasts the ambiguous legal definition of the parcel boundary and parcel area in relation to the theoretically well-defined geodetic parcel boundary and the geodetic parcel area on the reference ellipsoid. To align with the real world, parcel area must account for terrain elevation. Various approximate methods for area determination which can be used in the cadaster are tested. A highly accurate method for parcel area computation is proposed, based on an equal-area projection. Considering the geodetic parcel area as a reference, the achievable accuracy of different methods is evaluated. For this analysis, the coordinates of the parcel boundary points are treated as error-free. Finally, the relevance of various systematic errors is discussed in relation to the statistical uncertainty of the parcel area, which could be gained by an a real-time kinematic GNSS survey. A case study is presented for the territory of Slovenia, its georeferencing rules, land demarcation pattern, and characteristics of its topography. Based on the results of this study, some general recommendations for the parcel area determination are given.     

一种改进的图斑合并算法

从计算几何的角度提出了一种改进的图斑合并(聚合和融合)方法。图斑聚合采用缓冲区合并的思想,可以有效地合并"桥梁"区域,并保持图斑的自然弯曲形态;图斑融合通过骨架线剖分小图斑,以共享边和地类为共同作用因子,将小图斑逐个合并到原始图斑的拓扑相邻图斑中。此算法有效地维持了图斑边界的自然弯曲,并顾及了图上显示地类的父类整体变化情况。     

不确定性引导下的地形简化方法研究

提出一种不确定性引导下的地形简化方法。该方法利用地统计方法中特有的方差统计量对简化结果的不确定性进行量化评估,并以此作为优化目标进行地形简化操作。实验部分,从高程精度、地表基本形态以及骨架保留度三方面对新方法的有效性进行验证。结果表明:与传统的特征简化方法相比,新方法在控制地形简化的不确定性的前提下很好地保持了地形简化精度以及原始地表的骨架结构。     

以直角方式转折的面状要素图形简化方法

讨论了面状要素图形轮廓简化的一些规则以及面的空间知识获取方法,结合以直角方式转折的面状要素图形轮廓的特点,重点讨论了其图形渐进式简化方法。     

道路综合中基于骨架分割的道路密度分析(英文)

This paper proposes an algorithm for road density analysis based on skeleton partitioning. Road density provides metric and statistical information about overall road distribution at the macro level. Existing measurements of road density based on grid method, fractal geometry and mesh density are reviewed, and a new method for computing road density based on skeleton partitioning is proposed. Experiments illustrate that road density based on skeleton partitioning may reveal the overall road distribution. The proposed measurement is further tested against road maps at 1:10k scale and their generalized version at 1:50k scale. By comparing the deletion percentage within different density interval, a road density threshold can be found, which indicate the need for further operations during generalization. Proposed road density may be used to examine the quality of road generalization, to explore the variation of road network through temporal and spatial changes, and it also has future usage in urban planning, transportation and estates evaluation practice. Supported by the National 863 Program of China(No.2007AA12Z225), the Natural Science Foundation of China(No.40771168).     

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.     

不动产登记中的房产与地籍测绘数据整合

房产和地籍测绘数据作为不动产登记数据库不可或缺的组成部分,两者数据的整合是数据库建设的重要工作之一。此外,不动产单元与旧有各类登记单位的关联也依赖于测绘数据的整合。本文给出了一种可行的房产与地籍测绘数据整合路径,可解决面实体匹配和地物解释差异问题,并引入幢编号点要素数据。依赖于幢编号、自然幢、宗地三者的拓扑关系,以宗地为单位,整合房产与地籍测绘数据,建立自然幢和宗地的对应关系,并利用测绘数据生成登记要素数据。最后,给出了关于日常数据整合工作的若干建议。     

Observational Scale and Modeled Potential Residential Loss from a Storm Surge

Two geographically related questions with regard to hurricane-induced storm-surge impacts were investigated: (1) What observational scale of analysis is appropriate? (2) Is the effect of observational scale on model results predictable? These two research questions were investigated in the context of storm surge-induced impacts to single-family residential structures in Florida. The study was conducted for 21 coastal counties in Florida at five spatial scales of analysis: parcel, block, block group, tract, and county. The research findings reveal a monotonically decreasing relationship between predicted standardized residential loss (the ratio of predicted loss at scale X and the predicted loss at parcel scale) and the observational scale of analysis. This monotonic relationship was consistent for most Florida counties, primarily due to the notable spatial distribution of housing units and proximity to the coastline.     

地籍管理系统中宗地图斑匹配方法研究

地籍管理系统中利用图层叠加进行数据统计,为宗地审批、地类核定等业务提供审核依据.直接利用地籍调查的外业测量数据或数字化数据生成宗地图斑与计算机底图进行叠加匹配,由于测量误差的影响,造成宗地界址点的测量数据与计算机底图相关联的重合点数据不一致,会出现统计数据精确程度低,数据冗余大等问题.本文针对上述问题介绍了一种宗地图斑叠加匹配方法,使叠加前后的图斑的对应点能更好的吻合,有效的避免了地籍实体的多值性,提高了统计数据的精度,降低了冗余度.     

曲线弯曲深度层次结构的二叉树表达

地图综合要顾及目标的几何特征、语义特征和拓扑特征，其中地理意义是控制综合算子系统、参量调整的决定性因素。就线状要素而言，单从角度、距离、矢高等几何特征出发设计的曲线化简算法只能算作对曲线坐标串的几何压缩，不是真正意义上的地图综合。由于曲线的弯曲特征在表达线状地物地理特征上具有重要意义，对弯曲特征的识别、结构描述及操作分析成为目前线要素制图综合的研究热点。本文基于约束Delaunay三角网模型提出一种方法描述曲线弯曲特征在深度上的层次结构，对曲线上的矢量点构建三角网，在三角网覆盖区域里，由外向内进行三角形的“剥皮”操作，根据“剥皮”操作，根据“剥皮”进行过程中遇到的特征三角形构建二叉树，实现大弯曲套小弯曲层次结构的表达。该方法基于Gestalt对称性、连续性原则、对二叉树结点进行考察，可提取认知意义上的真正弯曲。本文同时给出了弯曲特征二叉树在多边形（闭合曲线）综合化简中的算法设计及实验结果。     

四维宗地建模及其核心操作算法

传统地籍是基于某一时刻的土地二维剖分,不支持立体产权管理和时空权属查询,需要探索四维（三维空间+时间）地籍。四维宗地是四维地籍的登记客体,是宗地在四维空间的扩展,其创建、分割、合并与注销等操作是四维地籍最常用、最基本的功能。结合城市发展现状和地籍管理需求,分析时态产权特征,用UML建模四维宗地数据模型和基于拓扑数据模型的四维宗地操作算法。研究内容包括:①提出四维宗地数据模型;②提出基于"拉伸"的四维宗地创建算法以及基于分段时间的共享拓扑基元处理方法;③提出四维宗地的分割、合并算法。研究结果表明:四维宗地的构建为追踪产权的时空变化提供了理论借鉴和技术支持,也使得地籍管理向四维地籍迈进了一步。     

基于CDT骨架线的地图目标邻近冲突识别

制图综合过程中随着比例尺的缩小,不可避免地产生邻近冲突。为了在数字环境下自动地解决这类冲突,首先需要实现这些冲突的自动识别。文中提出一种基于CDT骨架线的地图目标邻近冲突识别方法。该方法首先基于CDT提取地图目标之间空白区域的骨架线;然后沿着每一条骨架线弧段所穿过的三角形路径搜索相邻地图目标之间的冲突区域(宽度小于阈值的三角形集合);最后,从冲突涉及的地图目标、发生冲突的空间位置以及冲突严重程度3个方面给出所识别冲突的定量化描述,从而为邻近冲突的解决提供依据。     

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

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

地籍宗地面积处理的原理与方法

探讨以地图数字化为基础的地理信息系统建库中地籍宗地数字化的面积处理问题,阐述宗地面积平差的原理,并导出了相应的条件方程,讨论宗地面积处理的各种和实现,提出宗地面积处理的分级平差方法;最后通过实例分析,认为宗地面积的平差处理有助于实现GIS数据采集和建库过程中实施质量控制,保证地理信息基础数据的质量可靠性,为系统的数据开发应用奠定基础。     

Weighted merge context for clustering and quantizing spatial data with self-organizing neural networks

This publication presents a generalization of merge context, named weighted merge context (WMC), which is particularly useful for clustering and quantizing spatial data with self-organizing neural networks. In contrast to merge context, WMC does not depend on a predefined (sequential) ordering of the data; distance is evaluated by recursively taking neighboring observations into account. For this purpose, WMC utilizes a weight matrix that describes the neighborhood relationships between observations. This property distinguishes WMC from existing approaches like contextual neural gas (NG) or the GeoSOM, which force spatially close observations to be represented by similar prototypes, but neglected the similarity of the observations’ neighborhoods. For practical studies, WMC is combined with the NG algorithm to obtain weighted merging NG (WMNG). The properties of WMNG and its usefulness for clustering and quantizing spatial data are investigated on two different case studies which utilize an simulated binary grid and a real-world continuous data set.