A method and system for automatically generating postal code fences based on postal code address points

Abstract

The present invention discloses a method and system for automatically generating a postal code fence based on a postal code address point, through error detection and correction of the postal code address point: checking the error of the postal code address point and correcting it; generating Thiessen polygons of the postal code address point: constructing Thiessen polygons of the postal code address point, and assigning the postal code corresponding to the postal code address point to the Thiessen polygon; generating a postal code fence: merging Thiessen polygons of the same postal code and spatially adjacent to form a postal code fence; correcting the postal code fence: checking the topological relationship of the postal code fence and correcting it. The present invention can quickly and accurately generate the spatial range of the postal area based on the current postal code address point database, and can effectively save a lot of manual demonstration work.

Description

Technical Field

[0001] The present invention relates to the technical field of postal services, and in particular discloses a method and system for automatically generating a postal code fence based on a postal code address point. Background Art

[0002] In order to manage postal services conveniently, quickly and efficiently, my country's postal administration has divided the country into many postal areas and set postal codes for each postal area according to rules to form a postal code fence. The main function of the postal code fence is to simplify the mail sorting and delivery process and improve the speed and accuracy of postal services. Through the postal code marked on the letter or parcel, the postal code fence data of the destination can be obtained, and the postal department can more easily classify, sort and distribute the mail to the corresponding postal delivery area.

[0003] However, this method of describing the postal code range through words is very complicated to use. With the rapid advancement of my country's modernization construction, the appearance of cities and rural areas is changing with each passing day. This method of using postal code books to define postal area ranges faces many problems and cannot adapt to the postal service needs of the new era. It is urgent to generate new postal code fences through new technical means to improve the efficiency and quality of postal services. However, with the rapid development of domestic urban construction in recent years, the rapid changes in urban roads and streets have caused the house number information in the postal code book to be out of touch with the actual situation, as shown in the following:

[0004] 1. The original streets and roads have been renovated, renamed, or even lost, causing some information in the postal code book to be out of date.

[0005] 2. The land use scope of organizations, residential areas, etc. corresponding to the house numbers often changes, resulting in some house numbers used in the postal code book not matching the current house number settings.

[0006] 3. Administrative division adjustments of urban street offices, communities, rural towns and administrative villages will also have a great impact on the postal code fence range in the postal code book. Some areas may be transformed from rural to urban, or replanned from cities into new administrative regions. These changes also require the redelineation of postal code fences.

[0007] Therefore, the above-mentioned defects existing in the existing postal services are technical problems that need to be solved urgently. Summary of the invention

[0008] The present invention provides a method and system for automatically generating a postal code fence based on a postal code address point, aiming to solve at least one defect existing in the above-mentioned existing postal services.

[0009] One aspect of the present invention relates to a method for automatically generating a postal code fence based on a postal code address point, comprising the following steps:

[0010] Error detection and correction of postal code address points: Check for errors in postal code address points and correct them;

[0011] Thiessen polygon generation for postal code address points: construct Thiessen polygons for postal code address points, and assign the postal code corresponding to the postal code address point to the Thiessen polygon;

[0012] Zip code fence generation: merge the spatially adjacent Thiessen polygons of the same zip code to form a zip code fence;

[0013] Zip code fence correction: Check the topological relationship of the zip code fence and correct it.

[0014] Furthermore, the steps of error detection and correction of postal code address points include:

[0015] Check for missing or malformed postal code address points and remove them;

[0016] Remove duplicate postal code address points at the same location so that there is only one postal code address point at the same location;

[0017] Generate an irregular triangulated network based on the postal code address points, and use the connection relationship of the triangulated network to construct the spatial proximity relationship of each postal code address point to obtain the spatial proximity domain of each postal code address point;

[0018] Determine whether the zip codes of the spatial neighboring domains of each zip code address point are the same and whether the zip code of the target zip code point is the same as the spatial neighboring domain. If the spatial neighboring zip codes are the same and different from the target point, change the zip code of the target point to the zip code of the spatial neighboring domain.

[0019] Furthermore, the steps of generating Thiessen polygons of the postal code address point include:

[0020] Use the Thiessen polygon generation algorithm to construct Thiessen polygons for zip code address points;

[0021] Use the work area range polygon to cut the Thiessen polygon and obtain the Thiessen polygon within the work area;

[0022] According to the inclusion relationship between the postal code address point and the Thiessen polygon, the postal code of the postal code address point contained in each Thiessen polygon is assigned to the Thiessen polygon.

[0023] Furthermore, the steps of generating the postal code fence include:

[0024] Based on the different postal codes, the Thiessen polygons are divided into multiple polygon sets with the same postal code;

[0025] Merge spatially adjacent Thiessen polygons with the same postal code into one postal code fence.

[0026] Furthermore, in the step of correcting the zip code fences, it is checked whether there is an inclusion relationship between the zip code fences. If there is an inclusion relationship, the smaller zip code fence contained inside is merged into the larger zip code fence outside.

[0027] Another aspect of the present invention relates to a system for automatically generating a postal code fence based on a postal code address point, comprising:

[0028] The first correction module is used for error detection and correction of postal code address points: checking errors in postal code address points and correcting them;

[0029] The first generation module is used for generating Thiessen polygons of postal code address points: constructing Thiessen polygons of postal code address points, and assigning the postal code corresponding to the postal code address points to the Thiessen polygons;

[0030] The second generation module is used for zip code fence generation: merging the Thiessen polygons of the same zip code and spatially adjacent to form a zip code fence;

[0031] The second correction module is used for postal code fence correction: checking the topological relationship of the postal code fence and correcting it.

[0032] Furthermore, the first correction module includes:

[0033] A deletion unit that checks for postal address points with missing or incorrectly formatted postal codes and deletes them;

[0034] A removal unit, used for removing repeated postal code address points at the same location, so that only one postal code address point exists at the same location;

[0035] The first construction unit is used to generate an irregular triangulated network according to the postal code address points, and to construct a spatial proximity relationship of each postal code address point by using the connection relationship of the triangulated network to obtain a spatial proximity domain of each postal code address point;

[0036] The judgment unit is used to judge whether the postal codes of the spatial neighboring domains of each postal code address point are the same and whether the postal code of the target postal code point is the same as the spatial neighboring domain. If the spatial neighboring postal codes are the same and different from the target point, the postal code of the target point is changed to the postal code of the spatial neighboring domain.

[0037] Furthermore, the first generation module includes:

[0038] The second construction unit is used to construct Thiessen polygons for the postal code address points by using a Thiessen polygon generation algorithm;

[0039] An acquisition unit, used for cutting Thiessen polygons using the polygons within the working area to acquire Thiessen polygons within the working area;

[0040] The assignment unit is used to assign the postal code of the postal code address point contained in each Thiessen polygon to the Thiessen polygon according to the inclusion relationship between the postal code address point and the Thiessen polygon.

[0041] Furthermore, the second generation module includes:

[0042] A split unit is used to divide the Thiessen polygon into multiple polygon sets with the same zip code according to different zip codes;

[0043] Merge unit, which is used to merge spatially adjacent Thiessen polygons with the same postal code into a single postal code fence.

[0044] Furthermore, the second correction module is specifically used to check whether there is an inclusion relationship between the postal code fences. If there is an inclusion relationship, the smaller postal code fence contained inside is merged into the larger postal code fence outside.

[0045] The beneficial effects achieved by the present invention are:

[0046] The present invention provides a method and system for automatically generating a postal code fence based on a postal code address point, which includes error detection and correction of the postal code address point: checking the error of the postal code address point and correcting it; generating Thiessen polygons of the postal code address point: constructing the Thiessen polygons of the postal code address point, and assigning the postal code corresponding to the postal code address point to the Thiessen polygons; generating a postal code fence: merging Thiessen polygons of the same postal code and spatially adjacent to form a postal code fence; and correcting the postal code fence: checking the topological relationship of the postal code fence and correcting it. The method and system for automatically generating a postal code fence based on a postal code address point provided by the present invention solve the problem of inconsistency between the postal code information in the postal code book and the data of the actual urban administrative divisions, streets, house numbers, towns, villages, etc. The postal code fence planned by the present invention can adapt to the changing characteristics of cities and rural areas; the problem of difficulty in managing, maintaining and using the postal code fence in the postal code book is solved, and the use of an electronic postal code fence instead of the text description in the postal code book is more simple and convenient; the problem of slow update, long adjustment cycle and topological errors of the manually maintained postal code fence is solved, and the postal code fence planned by the present invention can adapt to the changing characteristics of the postal business; the spatial scope of the postal area can be quickly and accurately generated based on the current postal code address point database, which can effectively save a lot of manual demonstration work. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 The figure is a flow chart of an embodiment of a method for automatically generating a postal code fence based on a postal code address point according to the present invention. DETAILED DESCRIPTION

[0048] In order to better understand the above technical solution, the above technical solution will be described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0049] like Figure 1 As shown, the first embodiment of the present invention proposes a method for automatically generating a postal code fence based on a postal code address point, comprising the following steps:

[0050] Step S100, error detection and correction of postal code address points: check errors in postal code address points and correct them.

[0051] Due to the rapid changes in cities and other reasons, there are many errors in the location data or postal codes stored in the postal code address point database, which need to be detected and repaired to ensure the accuracy of the postal code fence generated later. In this embodiment, a postal code address point error detection and correction method based on spatial neighbors is proposed. The method first constructs an irregular triangulated network for the postal code address points in the working area, and then, based on the connection relationship of the triangulated network lines, the points directly connected to each vertex are combined into a spatial neighbor data set.

[0052] If the zip code in the spatial neighbor dataset of the current point is the same as that of the current point but different from that of the current point, it is defined as a zip code error of the current point, and its zip code is corrected to the zip code of the spatial neighbor dataset. In addition, if the zip code of some zip code address points is missing or the format is incorrect, it is regarded as erroneous data and deleted directly.

[0053] Step S200, generating Thiessen polygons of the postal code address point: constructing Thiessen polygons of the postal code address point, and assigning the postal code corresponding to the postal code address point to the Thiessen polygons.

[0054] For all the zip code address points in the work area, construct Thiessen polygons. Thiessen polygons are a method of partitioning a space region. For a set of points within a given plane space, any position within the polygon where each point is located is closest to the point, and each polygon has only one point. Then, assign the zip code of each zip code address point to the corresponding Thiessen polygon to obtain the Thiessen polygon with the zip code value.

[0055] Step S300, generating a postal code fence: merging Thiessen polygons with the same postal code and spatially adjacent to each other to form a postal code fence.

[0056] Merge the spatially adjacent Thiessen polygons with the same zip code to form a zip code fence. A zip code fence is formed by merging the spatially adjacent Thiessen polygons with the same zip code.

[0057] Step S400, postal code fence correction: check the topological relationship of the postal code fence and correct it.

[0058] Zip code fences constructed using zip code address points sometimes have polygon topology relationship problems, and necessary topology corrections need to be made to remove the erroneous relationships of mutual inclusion of zip code fences.

[0059] Furthermore, the method for automatically generating a postal code fence based on a postal code address point provided in this embodiment, step S100 includes:

[0060] Step S110: Check the postal code address points with missing postal codes or incorrect formats, and delete them.

[0061] Step S120: remove repeated postal code address points at the same location, so that there is only one postal code address point at the same location.

[0062] Step S130: Generate an irregular triangulated network based on the postal code address points, and use the connection relationship of the triangulated network to construct the spatial proximity relationship of each postal code address point to obtain the spatial proximity domain of each postal code address point.

[0063] Step S140, determine whether the zip codes of the spatial neighboring domains of each zip code address point are the same and whether the zip code of the target zip code point is the same as the spatial neighboring domain. If the spatial neighboring zip codes are the same and different from the target point, change the zip code of the target point to the zip code of the spatial neighboring domain.

[0064] Preferably, the method for automatically generating a postal code fence based on a postal code address point provided in this embodiment, step S200 comprises:

[0065] Step S210: Use the Thiessen polygon generation algorithm to construct Thiessen polygons for the postal code address points.

[0066] Step S220: Use the work area range polygon to cut the Thiessen polygon to obtain the Thiessen polygon within the work area.

[0067] Step S230: according to the inclusion relationship between the postal code address point and the Thiessen polygon, the postal code of the postal code address point included in each Thiessen polygon is assigned to the Thiessen polygon.

[0068] Thiessen polygon introduction:

[0069] 1. Concept

[0070] Thiessen polygons are a type of partitioning of a spatial plane. Their characteristics are that any position within a polygon is closest to the sample point of the polygon, farthest from the sample point in the adjacent polygon, and each polygon contains and only contains one sample point. Due to the equal division characteristics of Thiessen polygons in spatial partitioning, they can be used to solve problems such as the nearest point, the minimum enclosing circle, and many spatial analysis problems, such as adjacency, proximity, and accessibility analysis. The characteristics are as follows:

[0071] 1. Each Thiessen polygon contains only one discrete point data;

[0072] 2. The distance between the point in the Thiessen polygon and the corresponding discrete point is the shortest;

[0073] 3. The distances from points on the edge of the Thiessen polygon to the discrete points on both sides are equal.

[0074] 2. Mathematical Expression

[0075] Suppose there is a set of discrete points on the plane area B (i=1, 2, 3, ..., k; j=1, 2, 3, ..., k, k is the number of discrete points), if the area B is divided into k adjacent polygons by a set of straight line segments, such that:

[0076] (1) Each polygon contains only one discrete point;

[0077] (2) If any point on region B Located at the discrete point ( ) in the polygon, inequality (1) holds:

[0078]

[0079] (3) If the point Located at the discrete point ( ), then equation (2) holds:

[0080]

[0081] 3. Establish a process

[0082] The key to establishing the Thiessen polygon algorithm is to reasonably connect the discrete data points into a triangulated network, that is, to construct a Delaunay triangulated network. The steps to establish the Thiessen polygon are:

[0083] 1. Automatically construct a triangulated network from discrete points, that is, construct a Delaunay triangulated network. Number the discrete points and the triangles formed, and record which three discrete points each triangle is composed of.

[0084] 2. Find the numbers of all triangles adjacent to each discrete point and record them. This only requires finding all triangles with the same vertex in the constructed triangulated network.

[0085] 3. Sort the triangles adjacent to each discrete point in a clockwise or counterclockwise direction so that they can be connected to generate Thiessen polygons in the next step. Let the discrete point be o, find a triangle with o as the vertex, set it as A; take another vertex of triangle A except o, set it as a, then another vertex can also be found, that is, f; then the next triangle must have of as the edge, that is, triangle F; the other vertex of triangle F is e, then the next triangle has oe as the edge; repeat this process until you return to the oa edge.

[0086] 4. Calculate the center of the circumscribed circle of each triangle and record it.

[0087] 5. According to the adjacent triangles of each discrete point, connect the centers of the circumscribed circles of these adjacent triangles to obtain Thiessen polygons. For Thiessen polygons at the edge of the triangulated network, a perpendicular bisector can be made to intersect with the outline of the figure, and together with the outline of the figure, a Thiessen polygon is formed.

[0088] Furthermore, the method for automatically generating a postal code fence based on a postal code address point provided in this embodiment, step S300 includes:

[0089] Step S310: divide the Thiessen polygons into multiple polygon sets with the same postal code according to different postal codes.

[0090] Step S320: Merge spatially adjacent Thiessen polygons with the same postal code into a postal code fence.

[0091] Preferably, in the method for automatically generating a postal code fence based on a postal code address point provided in this embodiment, in step S400, it is checked whether there is an inclusion relationship between the postal code fences. If there is an inclusion relationship, the smaller postal code fence contained inside is merged into the larger postal code fence outside.

[0092] The present invention relates to a postal code fence automatic generation system based on postal code address points, comprising a first correction module, a first generation module, a second generation module and a second correction module, wherein the first correction module is used for error detection and correction of postal code address points: checking errors of postal code address points and correcting them. The first generation module is used for Thiessen polygon generation of postal code address points: constructing Thiessen polygons of postal code address points, and assigning postal codes corresponding to postal code address points to Thiessen polygons. The second generation module is used for postal code fence generation: merging Thiessen polygons of the same postal code and spatially adjacent to form a postal code fence. The second correction module is used for postal code fence correction: checking the topological relationship of the postal code fence and correcting it.

[0093] The first correction module first constructs an irregular triangulated network for the postal code address points in the working area, and then forms a spatial neighbor data set based on the connection relationship of the triangulated network lines. Then, the situation where the postal code in the spatial neighbor data set of the current point is the same as that of the current point but different from that of the current point is defined as a postal code error of the current point, and its postal code is corrected to the postal code of the spatial neighbor data set. In addition, if the postal code of some postal code address points is missing or the format is incorrect, it is regarded as erroneous data and is directly deleted.

[0094] The first generation module constructs Thiessen polygons for all the zip code address points in the work area. Thiessen polygons are a method of partitioning a space region. For a set of points within a given plane space, any position within the polygon where each point is located is closest to the point, and each polygon has only one point. Then, the zip code of each zip code address point is assigned to the corresponding Thiessen polygon to obtain a Thiessen polygon with a zip code value.

[0095] The second generation module merges the spatially adjacent Thiessen polygons with the same postal code to form a postal code fence. The postal code fence is formed by merging the spatially adjacent Thiessen polygons with the same postal code.

[0096] The second correction module uses the postal code fence constructed using the postal code address points, which sometimes has polygonal topological relationship problems and needs to be subjected to necessary topological corrections to remove the erroneous relationship of mutual inclusion of the postal code fence.

[0097] Furthermore, the present embodiment provides a system for automatically generating a postal code fence based on postal code address points, and the first correction module includes a deletion unit, a removal unit, a first construction unit and a judgment unit, wherein the deletion unit is used to check the postal code address points with missing postal codes or incorrect formats and delete them. The removal unit is used to remove repeated postal code address points at the same location, so that there is only one postal code address point at the same location. The first construction unit is used to generate an irregular triangulated network based on the postal code address points, and use the connection relationship of the triangulated network to construct the spatial proximity relationship of each postal code address point to obtain the spatial proximity domain of each postal code address point. The judgment unit is used to determine whether the postal codes in the spatial proximity domain of each postal code address point are the same and whether the postal code of the target postal code point is the same as the spatial proximity domain. If the spatial neighbor postal codes are the same and different from the target point, the postal code of the target point is changed to the postal code of the spatial proximity domain.

[0098] Preferably, in the automatic generation system of postal code fences based on postal code address points provided in this embodiment, the first generation module includes a second construction unit, an acquisition unit and an assignment unit, wherein the second construction unit is used to use the Thiessen polygon generation algorithm to construct Thiessen polygons for the postal code address points. The acquisition unit is used to use the work area range polygon to cut the Thiessen polygons and obtain the Thiessen polygons within the work area. The assignment unit is used to assign the postal code of the postal code address point contained in each Thiessen polygon to the Thiessen polygon according to the inclusion relationship between the postal code address point and the Thiessen polygon.

[0099] Furthermore, the present embodiment provides a system for automatically generating postal code fences based on postal code address points, and the second generation module includes a splitting unit and a merging unit, wherein the splitting unit is used to divide the Thiessen polygons into multiple polygon sets with the same postal code according to different postal codes; and the merging unit is used to merge spatially adjacent Thiessen polygons with the same postal code into one postal code fence.

[0100] Preferably, in the automatic generation system of postal code fences based on postal code address points provided in this embodiment, the second correction module is specifically used to check whether there is an inclusion relationship between postal code fences. If there is an inclusion relationship, the smaller postal code fence contained inside is merged into the larger postal code fence outside.

[0101] Compared with the prior art, the method and system for automatically generating a postal code fence based on postal code address points provided in this embodiment include error detection and correction of postal code address points: checking errors in postal code address points and correcting them; generating Thiessen polygons of postal code address points: constructing Thiessen polygons of postal code address points, and assigning the postal codes of the corresponding postal code address points to Thiessen polygons; generating postal code fences: merging Thiessen polygons of the same postal code and spatially adjacent to each other to form a postal code fence; and correcting postal code fences: checking the topological relationship of postal code fences and correcting them. The method and system for automatically generating postal code fences based on postal code address points provided in this embodiment solve the problem of inconsistency between postal code information in postal code books and data such as actual urban administrative divisions, streets, house numbers, towns, and villages. The postal code fences planned using the present invention can adapt to the changing characteristics of cities and rural areas; the problem of difficulties in managing, maintaining, and using postal code fences in postal code books is solved, and the use of electronic postal code fences instead of text descriptions in postal code books is simpler and more convenient; the problem of slow update, long adjustment cycle, and topological errors in manually maintained postal code fences is solved, and the postal code fences planned using the present invention can adapt to the changing characteristics of postal services; the spatial scope of the postal area can be quickly and accurately generated based on the current postal code address point database, which can effectively save a lot of manual demonstration work.

[0102] Although preferred embodiments of the present invention have been described, additional changes and modifications may be made to these embodiments by those skilled in the art once the basic inventive concepts are known. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention. Obviously, those skilled in the art may make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A method for automatically generating a postal code fence based on a postal code address point, characterized in that: The following steps are involved: Error detection and correction of postal code address points: Check for errors in postal code address points and correct them; Thiessen polygon generation for postal code address points: construct Thiessen polygons for postal code address points, and assign the postal code corresponding to the postal code address point to the Thiessen polygon; Zip code fence generation: merge the spatially adjacent Thiessen polygons of the same zip code to form a zip code fence; Postal code fence correction: check the topological relationship of the postal code fence and correct it; The steps of generating Thiessen polygons of the postal code address point include: Use the Thiessen polygon generation algorithm to construct Thiessen polygons for zip code address points; Use the work area range polygon to cut the Thiessen polygon and obtain the Thiessen polygon within the work area; According to the inclusion relationship between the postal code address point and the Thiessen polygon, the postal code of the postal code address point contained in each Thiessen polygon is assigned to the Thiessen polygon.

2. The method for automatically generating a postal code fence based on a postal code address point as claimed in claim 1, characterized in that: The steps of error detection and correction of postal code address points include: Check for missing or malformed postal code address points and remove them; Remove duplicate postal code address points at the same location so that there is only one postal code address point at the same location; Generate an irregular triangulated network based on the postal code address points, and use the connection relationship of the triangulated network to construct the spatial proximity relationship of each postal code address point to obtain the spatial proximity domain of each postal code address point; Determine whether the zip codes of the spatial neighboring domains of each zip code address point are the same and whether the zip code of the target zip code point is the same as the spatial neighboring domain. If the spatial neighboring zip codes are the same and different from the target point, change the zip code of the target point to the zip code of the spatial neighboring domain.

3. The method for automatically generating a postal code fence based on a postal code address point as claimed in claim 1, characterized in that: The steps of generating the postal code fence include: Based on the different postal codes, the Thiessen polygons are divided into multiple polygon sets with the same postal code; Merge spatially adjacent Thiessen polygons with the same postal code into one postal code fence.

4. The method for automatically generating a postal code fence based on a postal code address point as claimed in claim 1, characterized in that: In the step of correcting the zip code fence, it is checked whether there is an inclusion relationship between the zip code fences. If there is an inclusion relationship, the smaller zip code fence contained inside is merged into the larger zip code fence outside.

5. A system for automatically generating a postal code fence based on a postal code address point, characterized in that: include: The first correction module is used for error detection and correction of postal code address points: checking errors in postal code address points and correcting them; The first generation module is used for generating Thiessen polygons of postal code address points: constructing Thiessen polygons of postal code address points, and assigning the postal code corresponding to the postal code address points to the Thiessen polygons; The second generation module is used for zip code fence generation: merging the Thiessen polygons of the same zip code and spatially adjacent to form a zip code fence; The second correction module is used for postal code fence correction: checking the topological relationship of the postal code fence and correcting it; The first generation module comprises: The second construction unit is used to construct Thiessen polygons for the postal code address points by using a Thiessen polygon generation algorithm; An acquisition unit, used for cutting Thiessen polygons using the polygons within the working area to acquire Thiessen polygons within the working area; The assignment unit is used to assign the postal code of the postal code address point contained in each Thiessen polygon to the Thiessen polygon according to the inclusion relationship between the postal code address point and the Thiessen polygon.

6. The automatic generation system of postal code fence based on postal code address points as claimed in claim 5, characterized in that: The first correction module comprises: A deletion unit that checks for postal address points with missing or incorrectly formatted postal codes and deletes them; A removal unit, used for removing repeated postal code address points at the same location, so that only one postal code address point exists at the same location; The first construction unit is used to generate an irregular triangulated network according to the postal code address points, and to construct a spatial proximity relationship of each postal code address point by using the connection relationship of the triangulated network to obtain a spatial proximity domain of each postal code address point; The judgment unit is used to judge whether the postal codes of the spatial neighboring domains of each postal code address point are the same and whether the postal code of the target postal code point is the same as the spatial neighboring domain. If the spatial neighboring postal codes are the same and different from the target point, the postal code of the target point is changed to the postal code of the spatial neighboring domain.

7. The automatic generation system of postal code fence based on postal code address points as claimed in claim 5, characterized in that: The second generation module comprises: A split unit is used to divide the Thiessen polygon into multiple polygon sets with the same zip code according to different zip codes; Merge unit, which is used to merge spatially adjacent Thiessen polygons with the same postal code into a single postal code fence.

8. The system for automatically generating a postal code fence based on a postal code address point as claimed in claim 5, characterized in that: The second correction module is specifically used to check whether there is an inclusion relationship between the postal code fences. If there is an inclusion relationship, the smaller postal code fence contained inside is merged into the larger postal code fence outside.

Images