Automatic Topology Maintenance Approach for High-level Road Networks
LI Fe · Wuhan Daxue xuebao. Xinxi kexue ban · 2014
This paper presents an automatic topology maintenance approach for any extracted high-level road network.Firstly,the minimum spanning tree(MST)is generated on dual graph of road networks for maintaining the whole connectivity relationship.Secondly,the breadth-first search(BFS) and shortest path algorithm are applied to connect the dangling roads and rational roads,which are used to maintain the perceptual connecting relationship of the high-level road networks.An experiment was executed to verify the effectiveness of the approach.The experimental results show that the method achieves good and effective topology maintenance results,reflecting the structural characteristic of a high-level network.Furthermore,a comparison analysis to original high-level roads before and after topology maintenance was also carried out to show the rationalities of navigation path planning.