Take octahedron as an example, the aperture 4 hexagonal discrete global grids (A4HDGGs) is analyzed in this paper. The two adjacent triangle patches (up and down) in the platonic polyhedron are merged into one quadrilateral to create a twodimensional coordinate system, and the hierarchical location coding on A4HDGGs is therefore put forward. Firstly, the coding characteristics of A4HDGGs in different positions are analyzed. Secondly, a searching algorithm for A4HDGG, called A4-2D-coordinates, is given in details. Finally, the experimental analysis is developed. The effi ciency of neighbor-fi nding, children-fi nding, and parent-fi nding in this algorithm have been validated by the experimental results to improve respectively by 900 times, 120 times and 120 times compared with traditional Vince algorithm.