Method of Extracting Intersection Polygons Based on Centerline Junctions

被引:0
|
作者
Cai, Lei [1 ,2 ]
Yin, Yong [3 ]
Mao, Qifei [3 ]
Yang, Jiannan [3 ]
机构
[1] Beijing Inst Surveying & Mapping, Beijing 100038, Peoples R China
[2] Beijing Key Lab Urban Spatial Informat Engn, Beijing 100038, Peoples R China
[3] Chinese Acad Surveying & Mapping, Beijing 100036, Peoples R China
关键词
intersection extraction; centerline; topology; nearest points; polygon split;
D O I
10.18494/SAM5252
中图分类号
TH7 [仪器、仪表];
学科分类号
0804 ; 080401 ; 081102 ;
摘要
Intersection polygons are an important component of road data. To address the challenge of extracting the microstructure of roads, we propose a method of extracting intersection polygons based on centerline junctions. The method involves the following steps: (1) topological preprocessing of the road centerline to extract dangling nodes and converting road polygon data into line rings, (2) matching the nearest line ring within a certain threshold range of dangling nodes to obtain splitting points, (3) calculating the set of splitting points associated with the line rings and dividing the line rings to obtain boundary arcs, (4) extracting the boundary arcs associated with the current intersection from the intersection nodes of the road centerline, and (5) calculating the primary nearest point set and the secondary nearest point set in turn, and using the secondary nearest point set to extract the resulting intersection polygons. Experimental results indicate that the method can effectively generate the required intersection polygons at road intersections
引用
收藏
页码:4441 / 4453
页数:14
相关论文
共 50 条
  • [21] DERIVATION OF ALL FIGURES FORMED BY INTERSECTION OF GENERALIZED POLYGONS
    YAMIN, M
    BELL SYSTEM TECHNICAL JOURNAL, 1972, 51 (07): : 1595 - +
  • [22] THE INTERSECTION SEARCHING PROBLEM FOR C-ORIENTED POLYGONS
    TAN, XH
    HIRATA, T
    INAGAKI, Y
    INFORMATION PROCESSING LETTERS, 1991, 37 (04) : 201 - 204
  • [23] On intersection of maximal orthogonally k-starshaped polygons
    Oleg, T
    GEOMETRIAE DEDICATA, 1999, 78 (03) : 271 - 278
  • [24] AN OPTIMAL ALGORITHM FOR THE INTERSECTION RADIUS OF A SET OF CONVEX POLYGONS
    JADHAV, S
    MUKHOPADHYAY, A
    BHATTACHARYA, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 652 : 92 - 103
  • [25] AN ALGORITHM FOR COMPUTING THE UNION, INTERSECTION OR DIFFERENCE OF 2 POLYGONS
    MARGALIT, A
    KNOTT, GD
    COMPUTERS & GRAPHICS, 1989, 13 (02) : 167 - 183
  • [27] Voronoi Centerline-Based Seamline Network Generation Method
    Yuan, Xiuxiao
    Cai, Yang
    Yuan, Wei
    REMOTE SENSING, 2023, 15 (04)
  • [28] On Intersection of Maximal Orthogonally k-Starshaped Polygons
    Topală Oleg
    Geometriae Dedicata, 1999, 78 : 271 - 278
  • [29] ON SOME UNION AND INTERSECTION PROBLEMS FOR POLYGONS WITH FIXED ORIENTATIONS
    WIDMAYER, P
    WU, YF
    SCHLAG, MDF
    WONG, CK
    COMPUTING, 1986, 36 (03) : 183 - 197
  • [30] Privacy-preserving Judgment of the Intersection for Convex Polygons
    Yao, Yifei
    Ning, Shurong
    Tian, Miaomiao
    Yang, Wei
    JOURNAL OF COMPUTERS, 2012, 7 (09) : 2224 - 2231