测绘学报 ›› 2021, Vol. 50 ›› Issue (12): 1671-1682.doi: 10.11947/j.AGCS.2021.20200493

• 位置服务与地理空间信息处理 • 上一篇    下一篇

复杂建筑物最短邻近线多边形聚合法

王勇1, 罗安1, 王慧慧2, 曹元晖2, 刘纪平1,2   

  1. 1. 中国测绘科学研究院, 北京 100036;
    2. 武汉大学资源与环境科学学院, 湖北 武汉 430079
  • 收稿日期:2020-09-30 修回日期:2021-04-22 发布日期:2022-01-08
  • 通讯作者: 罗安 E-mail:luoan@casm.ac.cn
  • 作者简介:王勇(1976—),男,博士,研究员,研究方向为多源地理信息融合处理与分析挖掘。
  • 基金资助:
    国家重大研发计划(2017YFB0503502;2017YFB0503601);中国测绘科学研究院基本科研业务费(AR2011);自然资源事务专项(A2101)

A method of polygon aggregation for complex buildings based on shortest adjacent lines

WANG Yong1, LUO An1, WANG Huihui2, CAO Yuanhui2, LIU Jiping1,2   

  1. 1. Chinese Academy of Surveying and Mapping, Beijing 100036, China;
    2. School of Resource and Environmental Sciences, Wuhan University, Wuhan 430079, China
  • Received:2020-09-30 Revised:2021-04-22 Published:2022-01-08
  • Supported by:
    The National Key Research and Development Plan of China (Nos. 2017YFB0503502;2017YFB0503601);The fundamental research funds of CASM (No. AR2011);The Special Project on Natural Resources Affairs (No. A2101)

摘要: 建筑物多边形聚合一般是以相离的空间拓扑关系为基础,但是随着数据来源的多源化,复杂建筑物内部多边形的空间拓扑关系多样化甚至不一致,导致难以对此类复杂建筑物进行聚合,而智慧城市中建筑物多尺度可视化要求快速准确地提取复杂建筑物轮廓形状。为此,本文提出一种基于加密顶点间最短邻近线的建筑物多边形聚合方法。首先,基于聚合距离递归搜索邻近多边形以确定聚类范围,便于对地图数据分区处理;然后,对每个聚类区域,按照多边形边线的坐标点顺序,采用线性插值方法为多边形的每条边线生成加密点;在加密多边形边线顶点后,通过网格索引搜索和构建各点与邻近建筑物多边形的最短邻近线,并删除3类异常情况,形成有效最短邻近线集合;随后,按照一定顺序合并有效最短邻近线,形成最短邻近线组,并进一步过滤掉3类特殊情况,确定建筑物多边形的聚合区域;最后,顺时针按最小旋转角原则进行递归搜索,提取包含内环和外环的建筑物多边形外围轮廓。试验证明,该方法能快速探测建筑物多边形之间的邻近聚合区域,实时准确地提取复杂建筑物实体的外轮廓线,处理结果的整体轮廓接近真实情况,为复杂建筑物可视化提供条件。

关键词: 复杂建筑物, 聚合, 拓扑关系, 邻近线

Abstract: The aggregation of buildings is generally based on the disjoint in spatial topological relationships. However, with the diversification of data sources, the spatial topological relationships between polygons inside large buildings also become diversified and even inconsistent, making it difficult to aggregate building polygons, while the multi-scale visualization of buildings in the smart city requires rapid and accurate extraction of the contour shapes of complex buildings. For this reason, this paper proposes an aggregation method of buildings based on the shortest adjacent line between vertexes interpolated. First, recursively search for adjacent polygons based on the aggregation distance to determine the clustering regions, which is convenient for processing the map data in every region. Then, for each clustered region, encrypt vertices for each polygon using a linear interpolation method according to the order of the points on it; after that, search and construct the shortest adjacent line between each vertice and the adjacent polygon through the grid index, and delete the three types of shortest adjacent lines which are abnormal; then, merge the effective shortest adjacent lines in a certain order to form the shortest adjacent line group, and further filter out three kinds of special cases, so as to determine the aggregation area of adjacent polygons; finally, the recursive search is performed clockwise according to the minimum rotation angle, and the contour of polygons including the inner ring and the outer ring is extracted. Experiments show that this method can quickly detect the aggregation area between the adjacent polygons. Experiments in this paper show that this method can quickly detect the adjacent aggregation areas between building polygons and accurately extract the outer contour lines of complex building entities in real-time. The overall contours extracted are close to the actual situation, which provides conditions for building visualization.

Key words: complex buildings, aggregation, topological relationship, adjacent line

中图分类号: