Research on Offline Reverse Geocoding Algorithm Based on k-d Tree

In this paper, the offline reverse geocoding algorithm is studied. By comparing the performance of traditional search algorithm and k-d tree algorithm, and on the premise of using the same multi-scale administrative divisions as the built-in data set, it is concluded that the k-d tree algorithm can greatly improve the computational efficiency. Meanwhile, by building a simplified k-d tree model of seven data sites, the construction of k-d tree and the implementation process of search algorithm are explained in detail. This paper has a certain significance for the algorithm introduction and promotion, as well as for it’s further optimization and practical application scenarios.