An algorithm of searching degenerate quadtree grid cells along a path
Xuesheng Zhao · Journal of Henan Polytechnic University · 2013
Nowadays,most-grid-cell searching algorithms are limited to finding neighbor cells only,cannot search cells along a path.In order to overcome this deficiency,an algorithm of searching spherical Degenerate Quadtree Grid cells along a path is presented in this paper in details.The principle of this algorithm is searching grid cells along a path according to gnomonic projection,the direction of two intersecting directed line segments and cell adjacent searching algorithm.In the end,an experiment has been done.The experiment results illustrate that the searching results of this algorithm matching well with the path,and the searching rate basically stable at 60,000 cells per second,the efficiency is comparative to that of adjacent searching.It could be used in global scale data operations.