A heuristic strategy is presented to solve the point location problem in spherical triangulation mesh. Firstly, a spherical mesh with regular subdivision connectivity is constructed to partition the spherical domain into some small regions. Then the region, which contains the query point p, is found according to the position of p and selected as the search area for locating p. During the point location, the barycentric coordinates are used to extract local heuristic information about the location of p so as to find the shortest path from the start triangle to the target one containing p. In comparison with traditional algorithms, it is found that the heuristic strategy has better time and space performances.