This paper deals with algorithms to search in large Spatial data using analytical digital circle definition in a regular grid, superimposed on spatial data to generate pixels or clusters that contain different Referenced sites. The nearest clusters and the nearest sites in clusters, as a response to the request from a position in the central cluster, are the results of analytical circle application. Algorithms to draw analytical digital circle in digital geometry lead to establish serial and parallel algorithms, that integrate OpenMP primitives to facilitate searching in large spatial data. Analysis shows integration of analytical digital circle definition.