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     

基于建筑平面图的室内空间拓扑模型自动生成算法

针对以建筑平面图为数据源构建室内导航模型时,建筑平面图缺少拓扑信息,尤其是缺少对房间、走廊等多边形对象拓扑描述的问题,本文提出了一种自动化构建室内空间拓扑模型的算法。该算法首先根据CAD建筑平面图的基本特征,将墙线抽象为弧段,门窗抽象为点,房间抽象为多边形;然后从起始墙线出发,将该墙线顺时针或逆时针遇到的第一条墙线作为目标房间或走廊的第一条边,依次类推,直至回到起始墙线,则完成一个房间或走廊的提取;重复上述过程,直到所有墙线均被标记两次,说明所有房间或走廊提取成功,完成墙线与房间、走廊之间的拓扑连接关系自动建立。门窗与房间之间的拓扑关系则是根据门窗与墙线的拓扑关系,推导出门窗与房间之间的拓扑关系。以某大学教学楼的建筑平面图为例进行试验,试验结果表明本文算法能够有效实现室内空间拓扑模型的自动生成。     

基于拓扑关系的等高线高程自动赋值方法

地面高程信息是地理信息的重要组成部分，主要通过对地图上的等高线进行数字化来获取。等高线的数字化包括获取其特征点平面坐标和高程值两个方面。本文讨论了闭合等高线之间的拓扑关系及其表示形成，给出了根据等高线的平面位置判定其拓扑关系的算法。在此基础上，提出并实现了一种自动获取闭合等高线高程值的方法。实验表示，本文所述方法是正确可行的。     

Proximity-based grouping of buildings in urban blocks: a comparison of four algorithms

Grouping of buildings based on proximity is a pre-processing step of urban pattern (structure) recognition for contextual cartographic generalization. This paper presents a comparison of grouping algorithms for polygonal buildings in urban blocks. Four clustering algorithms, Minimum Spanning Tree (MST), Density-Based Spatial Clustering Application with Noise (DBSCAN), CHAMELEON and Adaptive Spatial Clustering based on Delaunay Triangulation (ASCDT) are reviewed and analysed to detect building groups. The success of the algorithms is evaluated based on group distribution characteristics (i.e. distribution of the buildings in groups) with two methods: S_Dbw and newly proposed Cluster Assessment Circles. A proximity matrix of the nearest distances between the building polygons, and Delaunay triangulation of building vertices are created as an input for the algorithms. A topographic data-set at 1:25,000 scale is used for the experiments. Urban block polygons are created to constrain the clustering processes from topological aspect. Findings of the experiment demonstrate that DBSCAN and ASCDT are superior to CHAMELEON and MST. Among them, MST has exhibited the worst performance for finding meaningful building groups in urban blocks.     

制图综合中建筑物多边形的合并与化简

讨论了数字环境下顾及建筑物矩形几何特征的多边形自动综合算法,针对多边形之间的拓扑邻近与视觉邻近两种空间关系,提出了基于矢量和基于栅格的两种建筑物多边形合并方法。关于建筑物形状的化简,本文提出了矩形差分方法,并在此基础上建立了建筑物多边形化简的层次化途径。     

多边形拓扑关系构建的栅格算法

矢量数据拓扑关系的自动建立是GIS软件的核心模块之一，也是技术难点之一。简要分析传统算法的优缺点，在此基础上，借鉴基栅格的种子点填充算法和矢量数据求交的栅格探测法的思想，提出建立图幅多边形与弧段所属关系的栅格算法，给出算法的各主要步骤和实现方法。分析与试验表明，新算法在特殊情况处理、多边形内点自动建立、处理效率、简化编程等方面有一定优势。     

Building footprint database improvement for 3D reconstruction: A split and merge approach and its evaluation

We present a general framework to improve a vectorial building footprint database consisting of a set of 2D polygons. The aim of this improvement is to make the database more proper to subsequent 3D building reconstruction at a large scale. Each polygon is split into several simple polygons guided by a digital elevation model (DEM). We say that this segmentation is vectorial as we produce segmentations that intrinsically have simple polygonal shapes, instead of doing a raster segmentation of the DEM within the polygon then trying to simplify it in a vectorization step. The method is based on a Mumford and Shah like energy functional characterizing the quality of the segmentation. We simplify the problem by imposing that the segmentation edges have directions present in the input polygon over which the DEM is defined. We evaluate the validity of the proposed method on a very large dataset and discuss its pros and cons based on this evaluation.     

构建结点上弧-弧拓扑关系的类方位角算法

同一结点上弧-弧拓扑关系的建立对多边形的自动生成具有重要意义,为了更好地描述同一结点上弧段间的拓扑关系,本文在考虑算法效率、可靠性和稳定性的基础上,通过引入方向夹角和类方位角概念,提出并实现了一种建立结点上弧-弧拓扑关系的类方位角算法.为检验算法的有效性,选取两个城市的道路交通网络进行了拓扑构建实验,通过与传统角度算法...     

建筑物白模多边形的自动合并

建筑物白模多边形数据可广泛应用于许多领域,但在实际应用中,由于数据太过细致,且目前使用的建筑物白模多边形数据存在拓扑关系错误,不满足生产要求,这给地图综合中建筑物群的自动合并提出了新的要求.因此提出了一种基于约束性Delaunay三角网的建筑物白模多边形自动合并方法,在保持建筑物整体结构和视觉效果的前提下减少不必要的细...     

邻接凸多边形方向关系计算及其推理

在对拓拟邻接凸多边形方向关系计算特殊性分析的基础上，提出了一个邻接凸多边形方向关系计算法和二维空间方向关系推理方法。与Voronoi图所表达的邻近拓扑关系相结合，该算法可以用于计算离散二维空间目标之间的方向关系。     

多边形自动生成的一种改进算法

本文提出了一种多边形自动生成的改进算法,对不参与组成多边形的弧段和结点进行分类处理,在搜索多边形之前,排除悬挂结点、悬挂弧段、假悬挂结点和假悬挂弧段的干扰,在搜索多边形的过程中,为弧段建立搜索标志,并对桥进行判断和排除,较好地解决了问题,提高了自动生成多边形的效率。     

A topology-preserving polygon rasterization algorithm

Conventional algorithms for polygon rasterization are typically designed to maintain non-topological characteristics. Consequently, topological relationships, such as the adjacency between polygons, may also be lost or altered, creating topological errors. This paper proposes a topology-preserving polygon rasterization algorithm to avoid topological errors. Four types of topological error may occur during polygon rasterization. The algorithm starts from an initial polygon rasterization and uses a set of preserving strategies to increase topological accuracy. The count of the four types of error measures the topological errors of the conversion. Topological accuracy is summarized as 1 minus the ratio of actual topological errors to the total number of possible error cases. When applied to a land-use dataset with a data volume of 128 MB, 127,836 polygons, and extending 1352 km², the algorithm achieves a topological accuracy of more than 99% when raster cell size is 30 m or smaller (100% for 5 and 10 m). The effects of cell size, polygon shape, and number of iterations on topological accuracy are also examined.     

简单多边形间最大距离的求解算法

求解任意两个简单多边形间的最大距离,在几何图形计算中,一直是一个基本问题。在对多边形自身的特性以及两多边形间关系进行深入分析的基础上,提出了一个基于折线凸包的单调性的简单多边形间最大距离的求解算法。根据封闭折线内部所具有的特性,把封闭折线拆分成两个断开的折线,使一条折线在另一条折线左边。两个多边形分别被拆分成四条折线,两个分为一组。分别求出每组中两条折线的凸包,利用凸包的单调性可以快速地找出两个距离最远的顶点,其中较大的是两个简单多边形间的最大距离。算法的时间复杂度是线性的。     

高分辨率遥感影像建筑物分级提取

高分辨率遥感影像建筑物信息自动提取是遥感应用研究中的一个热点问题,但由于受到成像条件不同、背景地物复杂、建筑物类型多样等多个因素的影响使得建筑物的自动提取仍然十分困难。为此,在综合考虑影像光谱、几何与上下文特征的基础上,提出了一种基于面向对象与形态学相结合的高分辨率遥感影像建筑物信息分级提取方法。该方法首先利用影像的多尺度及多方向Gabor小波变换结果提取建筑物特征点;然后采用面向对象的思想构建空间投票矩阵来度量每一个像素点属于建筑物区域的概率,从而提取出建筑物区域边界;最后在提取的建筑物区域内应用形态学建筑物指数实现建筑物信息的自动提取。实验结果表明,本文方法能够高效、高精度地完成复杂场景下的建筑物信息提取,且提取结果的正确性和完整性都优于效果较好的PanTex算法。     

Building segmentation and outline extraction from UAV image-derived point clouds by a line growing algorithm

ABSTRACT

This paper presents an approach to process raw unmanned aircraft vehicle (UAV) image-derived point clouds for automatically detecting, segmenting and regularizing buildings of complex urban landscapes. For regularizing, we mean the extraction of the building footprints with precise position and details. In the first step, vegetation points were extracted using a support vector machine (SVM) classifier based on vegetation indexes calculated from color information, then the traditional hierarchical stripping classification method was applied to classify and segment individual buildings. In the second step, we first determined the building boundary points with a modified convex hull algorithm. Then, we further segmented these points such that each point was assigned to a fitting line using a line growing algorithm. Then, two mutually perpendicular directions of each individual building were determined through a W-k-means clustering algorithm which used the slop information and principal direction constraints. Eventually, the building edges were regularized to form the final building footprints. Qualitative and quantitative measures were used to evaluate the performance of the proposed approach by comparing the digitized results from ortho images.     

GIS网络的TDN结构表示

分析了GIS网络的基本要素和网络关系，提出了完备表达网络的TDN数据结构，从时间和空间效率上进行了推演，并以试验验证了该结构的实用性。     

遥感分类栅格图的快速矢量化方法

遥感数据成为GIS愈来愈重要的一种数据源.栅格数据与矢量数据之间的快速转换是RS与GIS集成中的关键技术之一.本文通过分析遥感分类图栅格像元之间的关系,快速自动地提取矢量数据点及其连接信息,进而利用连接信息快速生成弧段,由弧段自动组建多边形并建立完整的拓扑关系.实验表明,该方法是一种由遥感分类图自动转换成GIS通用数据的高效方案.     

Cartographic reconstruction of building footprints from historical maps: A study on the Swiss Siegfried map

Extracting features from printed maps has been a challenge for decades; historical maps pose an even larger problem due to manual, inconsistent drawing or scribing, low printing quality, and geometrical distortions. In this article, a new workflow is introduced, consisting of a segmentation step and a vectorization step to acquire high‐quality polygon representations of building footprints from the Siegfried map series. For segmentation, an ensemble of U‐Nets is trained, yielding pixel‐based predictions with an average intersection over union of 88.2% and an average precision of 98.55%. For vectorization, methods based on contour tracing and orientation‐based clustering are proposed to approximate idealized polygonal representations. The workflow has been tested on 10 randomly selected map sheets from the Siegfried map, showing that the time required to manually correct these polygons drops to about 45 min per map sheet. Of this sample, approximately 10% of buildings required manual corrections. This workflow can serve as a blueprint for similar vectorization efforts.     

基于二叉树思想的任意多边形三角剖分递归算法

提出了一种基于二叉树思想的任意多边形三角剖分递归算法。该算法采用二叉树思想，确定剖分三角形的二叉树状结构，并采用递归算法实现。这算法可适用于任意形状的凹或凸多边形，也适用于包含岛屿的多边形。此外，在考虑边界点高程的基础上，可充分顾及地形特征。该算法完全适用于长距离河流流域的三维面状表达。     

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

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