polar split tree as a search tool in telecommunication

Tree search algorithms are vital for the search methods in structured data. such algorithms deal with nodes which can be taken from a data structure. one famous tree data structure is split tree. in this paper, to compute the split tree in polar coordinates, a method has been introduced. assuming that the algorithm inputs (in form of points) have been distributed in the form of a circle or part of a circle, polar split tree can be used. for instance, we can use these types of trees to transmit radio and telecommunication waves from host stations to the receivers and to search the receivers. since we are dealing with data points that are approximately circular distributed, it is suggested to use polar coordinates. furthermore, there are several researches by search algorithms for the central anchor which leads to the assignment of a virtual polar coordinate system. in this paper, the structure of cartesian split tree will be explained and the polar split tree will be implemented. then, by doing nearest neighbor search experiments, we will compare the polar split tree and polar quad tree in terms of searching time and amount of distance to the closest neighbor and in the end, better results will be achieved.