Simulation of Block Road Network Planning Based on Neighboring Data Query Algorithm
The planning of urban block road networks is mainly affected by the traffic density and the spacing of trunk roads.Due to the dynamic nature of the traffic environment,the planning of the road network also needs to be continuously updated,so it is difficult to obtain the optimal travel route through the road network planning.A neigh-borhood road network planning method based on a neighborhood data query algorithm is proposed.Multiple spatial u-nits are obtained after the Voronoi diagram divides the block road network spatial data set and stores them in the road network structure.Based on the spatial averaging method,the spatial area of the block road network is divided into different areas,and the adjacent data query is used to query the target nodes of the road network.The planning expan-sion level of the road network at all levels of the block is determined,the topological tree of the block road network is established,and the optimal path node sequence of the block road network is obtained through the topological tree to realize the planning of the block road network.The experimental results show that when the research method com-pletes the road network planning,its optimal path query time,CPU overhead and road network planning time-consu-ming indicators are better than the comparison method,which verifies that the proposed method has more ideal practi-cality.
NETL
NSTL
万方数据
