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 条
  • [31] Algorithms for computing intersection and union of toleranced polygons with applications
    Cazals, F
    Ramkumar, GD
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 1997, 11 (04): : 263 - 272
  • [32] A classification method of simple polygons based on dihedral group
    Xu, Jia
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2012, 24 (07): : 896 - 900
  • [33] EXTRACTING POLYGONS OF VISIBLE CADASTRAL BOUNDARIES USING DEEP LEARNING
    Tareke, Bedru
    Koeva, Mila
    Persello, Claudio
    IGARSS 2023 - 2023 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM, 2023, : 915 - 918
  • [34] On the intersection of distance-j-ovoids and subpolygons of generalized polygons
    De Bruyn, Bart
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3023 - 3031
  • [35] The symplectic volume and intersection pairings of the moduli spaces of spatial polygons
    Kamiyama, Yasuhiko
    TORIC TOPOLOGY, 2008, 460 : 209 - 219
  • [36] Welding Wires Centerline Detection Method Based on Image Gradient Segmentation
    Yang, Zeyu
    Yi, Dirong
    2020 IEEE 3RD INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND SIGNAL PROCESSING (ICICSP 2020), 2020, : 290 - 294
  • [37] ON SOME UNION AND INTERSECTION PROBLEMS FOR POLYGONS WITH FIXED ORIENTATIONS.
    Widmayer, P.
    Wu, Y.F.
    Schlag, M.D.F.
    Wong, C.K.
    Computing (Vienna/New York), 1986, 36 (03): : 183 - 197
  • [38] PolyCard: A learned cardinality estimator for intersection queries on spatial polygons
    Ji, Yuchen
    Amagata, Daichi
    Sasaki, Yuya
    Hara, Takahiro
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2025,
  • [39] A mimetic method for polygons
    Perot, J. Blair
    Chartrand, Chris
    JOURNAL OF COMPUTATIONAL PHYSICS, 2021, 424
  • [40] Centerline calculation for extracting abdominal aorta in 3-D MRI images
    Babin, Danilo
    Vansteenkiste, Ewout
    Pizurica, Aleksandra
    Philips, Wilfried
    2012 ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY (EMBC), 2012, : 3982 - 3985