A Heuristic Algorithm for Rapid Gridding of Road Network
To improve map matching efficiency for intelligent transport systems,gives a pretreatment method for map.The method draws on the concept of balanced binary tree,creates a mathematical model,with the cupidity arithmetic,proposes a heuristic algorithm for rapid gridding of road network.For the complex road network with practical applications,tests the above methods to verify the feasibility of algorithm and validity of the model,and also verifies the effectiveness of the methods.