Search method for nearest service point

The invention aims to provide a search method for a nearest service point. The search method comprises the following steps: step 1), collecting spatial data of a whole region including an interest point and all service points around the interest point, respectively extracting central points within each service point range, and extracting central points within an interest point range; step 2), building a triangulated irregular network based on the central points of each service point; step 3), building a Thiessen polygon on the basis of the triangulated irregular network, and dividing the whole region into a plurality of sub regions, wherein the central points of various service point are respectively located in the corresponding sub regions; step 4), performing space intersection on the central points of the interest point and the whole region after the Thiessen polygon is built, and obtaining the nearest service point of the interest point; and step 5), storing the Thiessen polygon of the whole region, when