利用路段连接图识别道路网中的格网模式  

Grid Pattern Recognition in Road Networks Using Link Graph

作　　者：李豪 郭黎[1] 王云阁 姜晶莉 LI Hao;GUO Li;WANG Yunge;JIANG Jingli(Institute of Geographical Spatial Information,Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]信息工程大学地理空间信息学院,河南郑州450001

出　　处：《武汉大学学报（信息科学版）》2022年第1期126-132,共7页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金(41471314)。

摘　　要：提出一种基于路段连接图的格网模式识别方法。该方法以路段连接对作为研究的基本单元,以节点路段为点,路段的连接为边用路段连接图表达道路网。将在道路网中识别格网转化为在路段连接图中搜索格网回路。提出了描述路段连接对几何与连接关系的5个参量,用于筛选图中符合格网特点的节点和边。设计了图搜索的约束条件,使用广度优先遍历搜索连接关系图中的回路,完成了格网模式的提取。试验结果表明,该方法能够有效地识别格网模式。Objectives:The road network is the skeleton of a city and the road pattern refers to the shape of roads that can be clearly named. Identifying road patterns helps to understand the structures of cities and find more potential knowledge. However, urban road networks are complicated, and it is very difficult to identify the road structure. Methods: A link-graph-based method is proposed for recognizing the grid pattern in road networks. This method uses the link graph to represent road networks, in which nodes represent road segments and links represent intersections. It converts recognizing the grid pattern in road networks into searching for loops in the link graph. Five parameters are defined to select nodes and links that would match the grid conditions in the graph. The breadth-first search algorithm is used to search the loop in the link graph. Results: By mapping links and nodes in the link graph back to road segments, we can identify the grid pattern in road networks. This method can still work in more complicated road networks.Conclusions: The result shows that the proposed method can effectively recognize the grid pattern in road networks. Other road patterns can be further identified through analysis of the characteristics of the road connection.

关 键 词：路段连接图 格网模式 广度优先搜索 图搜索 格网回路 

分 类 号：P208[天文地球—地图制图学与地理信息工程]