CN112783891B - Method and device for matching adjacent polygonal areas based on longitude and latitude - Google Patents
Method and device for matching adjacent polygonal areas based on longitude and latitude Download PDFInfo
- Publication number
- CN112783891B CN112783891B CN202010929207.2A CN202010929207A CN112783891B CN 112783891 B CN112783891 B CN 112783891B CN 202010929207 A CN202010929207 A CN 202010929207A CN 112783891 B CN112783891 B CN 112783891B
- Authority
- CN
- China
- Prior art keywords
- preset
- area
- longitude
- latitude
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Abstract
The embodiment of the invention provides a method and a device for matching adjacent polygonal areas based on longitude and latitude, wherein the method comprises the following steps: acquiring the longitude and latitude of a target point; matching the longitude of the target point with a preset longitude regional search tree, and determining a first regional matching result; matching with a preset latitude area retrieval tree based on the latitude of the target point, and determining a second area matching result; and taking the intersection of the areas of the first area matching result and the second area matching result as the adjacent polygon area matched with the target point. The embodiment of the invention performs matching based on the preset longitude area search tree and the preset latitude area search tree, reduces the matching calculation amount, determines a first area matching result through the longitude and latitude of the target point and the preset longitude area search tree, determines a second area matching result with the preset latitude area search tree, and determines the adjacent polygon area according to the first area matching result and the second area matching result, thereby realizing the rapid matching of the adjacent polygon area according to the longitude and latitude.
Description
Technical Field
The invention relates to the technical field of intelligent position service big data, in particular to a method and a device for matching adjacent polygonal areas based on longitude and latitude.
Background
The common method for matching adjacent polygons according to the longitude and latitude is a method for directly judging whether coordinate points fall in a polygon area, and the method needs to firstly inquire the central points of the adjacent areas according to the longitude and latitude to generate an alternative area list, then carries out calculation of the coordinate points in the polygon area one by one, namely, sequentially carrying out verification calculation on one polygon and one polygon, and finally finds out a target area result, so that the verification method has larger calculation amount.
Disclosure of Invention
To solve the problems in the prior art, embodiments of the present invention provide a method and an apparatus for matching neighboring polygon areas based on longitude and latitude.
In a first aspect, an embodiment of the present invention provides a method for matching neighboring polygonal areas based on longitude and latitude, including:
acquiring the longitude and latitude of a target point;
matching with a preset longitude area retrieval tree based on the longitude of the target point to determine a first area matching result; the preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the polygon region to which the corresponding preset folding point belongs; the preset break points are points on the boundary of the polygonal area;
matching with a preset latitude area retrieval tree based on the latitude of the target point to determine a second area matching result; the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs;
and taking the intersection of the areas of the first area matching result and the second area matching result as the adjacent polygon area matched with the target point.
Further, the preset longitude region search tree stores a mapping relationship between the longitude of each preset inflection point and a polygon region to which the corresponding preset inflection point belongs, and includes:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas and ID information of the polygonal areas to which the corresponding preset break points belong;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude region retrieval tree comprises a preset inflection point longitude array and a corresponding polygon region ID information array to which the preset inflection point belongs;
correspondingly, the preset latitude region retrieval tree stores the mapping relationship between the latitude of each preset break point and the polygon region to which the corresponding preset break point belongs, and the method comprises the following steps:
loading a plurality of polygonal region information, and creating a region break point latitude list; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area and the ID information of the polygonal area to which the corresponding preset break point belongs;
sorting all preset break points in the regional break point latitude list according to the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array to which the corresponding preset breakpoint belongs.
Further, the preset longitude region search tree stores a mapping relationship between the longitude of each preset inflection point and a polygon region to which the corresponding preset inflection point belongs, and further includes:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list according to a first preset rule; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas, ID information of the polygonal areas to which the corresponding preset break points belong and geometric central points corresponding to the polygonal areas;
wherein the first preset rule is as follows:
adding the longitude of each preset turning point on the boundary of each polygonal area to a preset turning point longitude list, wherein the longitude of each preset turning point on the boundary of each polygonal area is smaller than the longitude of a geometric center point corresponding to each polygonal area;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude region retrieval tree comprises a preset inflection point longitude array and a corresponding polygon region ID information array to which the preset inflection point belongs;
correspondingly, the preset latitude region retrieval tree stores the mapping relationship between the latitude of each preset break point and the polygon region to which the corresponding preset break point belongs, and the method further includes:
loading a plurality of polygonal area information, and creating an area break point latitude list according to a second preset rule; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area, ID information of the polygonal area to which the corresponding preset break point belongs and a geometric central point corresponding to each polygonal area;
wherein the second preset rule is as follows:
adding preset break points of which the latitudes of the preset break points on the boundaries of the polygonal areas are smaller than the latitudes of the geometric center points corresponding to the polygonal areas into the area break point latitude list;
sequencing all preset break points in the regional break point latitude list according to the size of the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array to which the corresponding preset breakpoint belongs.
Further, matching with a preset longitude area search tree based on the longitude of the target point, and determining a first area matching result, including:
matching the longitude of the target point in a preset longitude area retrieval tree by using a preset longitude array of the preset longitude area retrieval tree, and if the matching is successful, taking ID information of a polygon area to which a corresponding preset turning point matched in the preset longitude array belongs as a first area matching result;
and if the matching is unsuccessful, expanding the longitude range of the target point, performing range search on a preset turning point longitude array in a longitude area retrieval tree by adopting a binary search mode, acquiring a preset turning point matched with the longitude range of the target point, and taking ID information of a polygon area to which the corresponding preset turning point matched in the preset turning point longitude array belongs as a first area matching result.
Further, matching with a preset latitude region search tree based on the latitude of the target point, and determining a second region matching result, including:
matching the latitude of the target point with a preset break point latitude array in the preset latitude area retrieval tree, and if the matching is successful, taking ID information of a polygon area to which a corresponding preset break point matched in the preset break point latitude array belongs as a second area matching result;
and if the matching is unsuccessful, expanding the latitude range of the target point, performing range search on a preset break point latitude array in a latitude region retrieval tree by adopting a binary search mode to obtain a preset break point matched with the latitude range of the target point, and taking ID information of a polygon region to which the corresponding preset break point matched in the preset break point latitude array belongs as a second region matching result.
Further, still include:
and expanding the longitude range of the target point according to the preset times and/or the preset longitude range.
Further, still include:
and expanding the latitude range of the target point according to the preset times and/or the preset latitude range.
Further, still include:
and if the determined first area matching result and the second area matching result have no area intersection within the preset times and/or the preset longitude range, searching a preset folding point with the smallest longitude difference between the longitude of the preset folding point in the preset longitude area retrieval tree and the longitude of the target point, and taking the ID information of the polygon area to which the corresponding preset folding point belongs as an adjacent polygon area matched with the target point.
Further, still include:
and if the determined first region matching result and the second region matching result have no region intersection within the preset times and/or the preset latitude range, searching a preset break point with the smallest difference value between the latitude of the preset break point in the preset latitude region retrieval tree and the latitude of the target point, and taking the ID information of the polygon region to which the corresponding preset break point belongs as the adjacent polygon region matched with the target point.
In a second aspect, an embodiment of the present invention provides an apparatus for matching neighboring polygon areas based on longitude and latitude, including:
the acquisition module is used for acquiring the longitude and the latitude of the target point;
the first matching module is used for matching the longitude of the target point with a preset longitude area retrieval tree to determine a first area matching result; the preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the polygon region to which the corresponding preset folding point belongs; the preset break points are points on the boundary of the polygonal area;
the second matching module is used for matching with a preset latitude region retrieval tree based on the latitude of the target point to determine a second region matching result; the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs;
and the third matching module is used for taking the area intersection of the first area matching result and the second area matching result as an adjacent polygon area matched with the target point.
As can be seen from the foregoing technical solutions, the method and apparatus for matching neighboring polygon regions based on longitude and latitude provided in the embodiments of the present invention match based on the preset longitude region search tree and the preset latitude region search tree, so that a target point does not need to be verified and calculated in sequence by one polygon, and the embodiments of the present invention simplify the entire verification process into three steps, that is: the method and the device for determining the adjacent polygon area have the advantages that the first area matching result is determined through the longitude of the target point, the second area matching result is determined through the latitude of the target point, and finally the adjacent polygon area is determined according to the intersection of the first area matching result and the second area matching result.
Drawings
In order to more clearly illustrate the embodiments or technical solutions of the present invention, the drawings used in the embodiments or technical solutions in the prior art are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart illustrating a method for matching neighboring polygonal areas based on longitude and latitude according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a predetermined longitude area search tree according to another embodiment of the present invention;
FIG. 3 is a diagram illustrating a search tree of a predetermined latitude region according to another embodiment of the present invention;
FIG. 4 is a diagram illustrating a range search algorithm according to another embodiment of the present invention;
FIG. 5 is a diagram illustrating a binary search algorithm according to another embodiment of the present invention;
FIG. 6 is a schematic diagram of matching neighboring polygonal regions according to longitude and latitude provided by another embodiment of the present invention;
FIG. 7 is a schematic structural diagram of an apparatus for matching neighboring polygonal regions based on longitude and latitude provided in an embodiment of the present invention;
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some embodiments, but not all embodiments, of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. The method for detecting train collision according to the present invention will be explained and illustrated in detail by specific embodiments.
Fig. 1 is a flowchart illustrating a method for matching neighboring polygonal areas based on longitude and latitude according to an embodiment of the present invention; as shown in fig. 1, the method includes:
step 101: and acquiring the longitude and latitude of the target point.
In this step, the longitude and latitude of the target point can be acquired through various channels, such as Baidu map longitude and latitude query, GPS software, TEST software and the like, and the longitude and latitude coordinates of the target point are provided in real time.
Step 102: matching with a preset longitude area retrieval tree based on the longitude of the target point to determine a first area matching result; the preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the polygon region to which the corresponding preset folding point belongs; the preset break point is a point on the boundary of the polygonal area.
In this step, it should be noted that the preset break points are points on the boundary of the polygon area, and all the points on the boundary of the polygon area may be obtained by loading the polygon area information, and all the points on the boundary are collected into a polygon area boundary break point list. The preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the corresponding polygon region to which the preset folding point belongs, and can construct the preset longitude region retrieval tree by creating a region folding point longitude list, wherein the longitude of the preset folding point and the polygon region to which the preset folding point belongs are stored in the region folding point longitude list, and each preset folding point correspondingly comprises longitude information and information of the corresponding polygon region; for example, the administrative area is a typical polygonal area, the preset longitude area search tree stores the longitudes of all points on the boundary of the administrative area and the area IDs of the administrative area to which a plurality of points belong, and the area IDs may include a plurality of area levels according to requirements, where the area levels are, for example, province/prefecture cities; grade city; district/county, etc., and the present example is not particularly limited. Mapping relationship between longitude of each preset inflection point and the corresponding polygonal area to which the preset inflection point belongs, for example, longitude of the preset inflection point n is 135 ° 05' E, the polygonal area to which the preset inflection point n belongs is in the black-and-white-parental island, and the longitude of the preset inflection point n is in the same direction as that of the corresponding polygonal area to which the corresponding preset inflection point belongs; the longitude of the preset folding point 1 is 73 degrees 33' E, the polygonal area to which the preset folding point 1 belongs is in Pamilar plateau in Xinjiang, each preset folding point corresponds to one piece of folding point longitude information and one piece of polygonal area information to which the preset folding point belongs, so that a plurality of preset folding points stored in a longitude area search tree are preset, two arrays are generated, one array is an array for storing the longitudes of the plurality of preset folding points, the other array is an array for storing the polygonal area to which the preset folding points belong, and the two arrays have a mapping relation.
For better understanding of this step, for example, the preset longitude region search tree stores the mapping relationship between the longitude of each preset inflection point and the polygon region to which the corresponding preset inflection point belongs, as shown in fig. 2, if the obtained longitude of the target point is 84 ° 68' E, the target point is matched with the preset longitude region search tree, and the first region matching result is determined to be the belonging polygon region H, the belonging polygon region Q5, the belonging polygon region V3, and the belonging polygon region G.
Step 103: matching with a preset latitude area retrieval tree based on the latitude of the target point to determine a second area matching result; the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs.
In this step, referring to fig. 3, it can be understood that the method for constructing the search tree of the preset latitude area is similar to the method for constructing the search tree of the preset longitude area, except that the search tree of the preset latitude area stores the mapping relationship between the latitude of each preset inflection point and the polygon area to which the corresponding preset inflection point belongs.
In this step, it should be noted that, a mapping relationship between the latitude of each preset broken point and a polygonal region to which the corresponding preset broken point belongs, for example, the latitude of the preset broken point 53 is 3 ° 51' N, and the polygonal region to which the preset broken point 53 belongs is in great mother sand in the south sand island; the latitude of the preset break points 54 is 53 degrees 33.5' N, the polygonal area to which the preset break points 54 belong is on the central line of the main channel of the black dragon river in the north of the desert river, each preset break point corresponds to break point latitude information and one belonging polygonal area information, so that a plurality of preset break points stored in the preset latitude area search tree can be generated into two arrays, one array is an array for storing the latitudes of the plurality of preset break points, one array is an array for storing the polygonal area to which the preset break points belong, and the two arrays have a mapping relation.
For better understanding of the step, for example, the preset latitude region search tree stores a mapping relationship between the latitude of each preset break point and the polygon region to which the corresponding preset break point belongs, as shown in fig. 3, if the obtained latitude of the target point is 41 ° 28' N, the target point is matched with the preset latitude region search tree, and the second region matching result is determined to be the belonging polygon region X9, the belonging polygon region R3, the belonging polygon region G, and the belonging polygon region Z9.
Step 104: and taking the intersection of the areas of the first area matching result and the second area matching result as the adjacent polygon area matched with the target point.
In this step, for example, if the first region matching result is (the belonging polygon region H, the belonging polygon region Q5, the belonging polygon region V3, and the belonging polygon region G), and the second region matching result is (the belonging polygon region X9, the belonging polygon region R3, the belonging polygon region G, and the belonging polygon region Z9), the region intersection of the first region matching result and the second region matching result is the belonging polygon region G, so that the belonging polygon region G is taken as the neighboring polygon region matching the target point.
As can be seen from the above technical solutions, the method for matching adjacent polygon areas based on longitude and latitude provided in the embodiment of the present invention matches based on the preset longitude area search tree and the preset latitude area search tree, so that a target point does not need to be verified and calculated in sequence by one polygon, and the embodiment of the present invention simplifies the whole verification process into three steps, that is: the method and the device for determining the adjacent polygon area have the advantages that the first area matching result is determined through the longitude of the target point, the second area matching result is determined through the latitude of the target point, and finally the adjacent polygon area is determined according to the intersection of the first area matching result and the second area matching result.
On the basis of the foregoing embodiment, in this embodiment, the preset longitude area search tree stores a mapping relationship between a longitude of each preset inflection point and a polygon area to which the corresponding preset inflection point belongs, and the mapping relationship includes:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas and ID information of the polygonal areas to which the corresponding preset break points belong;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude region retrieval tree comprises a preset inflection point longitude array and a corresponding polygon region ID information array to which the preset inflection point belongs;
correspondingly, the preset latitude region retrieval tree stores the mapping relationship between the latitude of each preset break point and the polygon region to which the corresponding preset break point belongs, and the method comprises the following steps:
loading a plurality of polygonal region information, and creating a region break point latitude list; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area and ID information of the polygonal area to which the corresponding preset break point belongs;
sequencing all preset break points in the regional break point latitude list according to the size of the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array to which the corresponding preset breakpoint belongs.
In this embodiment, it can be understood that the polygon area information, the longitude of each preset inflection point on the boundary of each polygon area and the ID information of the polygon area to which the corresponding preset inflection point belongs may be obtained through a database storing the polygon area information, for example, a plurality of polygons are loaded, and the plurality of polygons including the preset inflection point 1/the longitude 73 ° 33' E of the preset inflection point 1/the polygon area α to which the preset inflection point 1 belongs are obtained; the longitude of the preset break point 2/the preset break point 2 is 73 degrees and 45 degrees, and the preset break point 2 belongs to the polygonal area A; the preset break point 3/longitude 73 degrees 53' E of the preset break point 3/polygonal area B to which the preset break point 3 belongs; the longitude of the preset break point 4/the preset break point 4 is 73 degrees 83' E/the polygonal area C to which the preset break point 4 belongs; preset break point 5/longitude 74 ° 05' E of preset break point 5/polygon area D to which preset break point 5 belongs. And creating an area breakpoint longitude list according to the acquired polygon area information, so that a plurality of preset breakpoints, the longitudes of the preset breakpoints and the ID information of the polygon areas to which the corresponding preset breakpoints belong are stored in the area breakpoint longitude list.
Creating a preset longitude regional retrieval tree according to a regional breakpoint longitude list, sorting all preset breakpoints in the regional breakpoint longitude list according to longitude sizes, and creating the preset longitude regional retrieval tree, wherein the preset longitude regional retrieval tree can be, for example, sorted from big to small or sorted from small to big according to the longitudes of all preset breakpoints in the regional breakpoint longitude list, and two arrays are generated after sorting, one array is an array for storing a plurality of preset breakpoint longitudes, and the other array is an array for storing ID information of a polygonal region to which the preset breakpoints belong.
Accordingly; the method for creating the regional breakpoint latitude list is similar to the method for creating the regional breakpoint longitude list, and a person skilled in the art can create the regional breakpoint latitude list by referring to the method for creating the regional breakpoint longitude list, so that a preset latitude regional search tree is created according to the created regional breakpoint latitude list, and a preset breakpoint latitude array and a polygon regional ID information array to which the corresponding preset breakpoint belongs are obtained, which are not described herein again.
According to the technical scheme, the method for matching the adjacent polygon areas based on the longitude and the latitude loads a plurality of polygon area information and creates the area breakpoint longitude list; the longitude of each preset folding point on the boundary of each polygon area and the ID information of the corresponding polygon area where the corresponding preset folding point belongs, the preset folding points in the area folding point longitude list are sequenced according to the longitude, a preset longitude area retrieval tree is created, the preset longitude area retrieval tree is enabled to be more regular, and the quick matching of the adjacent polygon area matched with the target point is facilitated.
On the basis of the foregoing embodiment, in this embodiment, the preset longitude area search tree stores a mapping relationship between a longitude of each preset inflection point and a polygon area to which the corresponding preset inflection point belongs, and further includes:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list according to a first preset rule; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas, ID information of the polygonal areas to which the corresponding preset break points belong and geometric central points corresponding to the polygonal areas;
wherein the first preset rule is as follows:
adding the longitude of each preset turning point on the boundary of each polygonal area to a preset turning point longitude list, wherein the longitude of each preset turning point on the boundary of each polygonal area is smaller than the longitude of a geometric center point corresponding to each polygonal area;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude region retrieval tree comprises a preset inflection point longitude array and a corresponding polygon region ID information array to which the preset inflection point belongs;
correspondingly, the preset latitude region retrieval tree stores the mapping relationship between the latitude of each preset break point and the polygon region to which the corresponding preset break point belongs, and the method further includes:
loading a plurality of polygonal area information, and creating an area break point latitude list according to a second preset rule; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area, ID information of the polygonal area to which the corresponding preset break point belongs and a geometric central point corresponding to each polygonal area;
wherein the second preset rule is as follows:
adding preset break points of which the latitudes of the preset break points on the boundaries of the polygonal areas are smaller than the latitudes of the geometric center points corresponding to the polygonal areas into the area break point latitude list;
sorting all preset break points in the regional break point latitude list according to the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array to which the corresponding preset breakpoint belongs.
In this embodiment, it should be noted that the following rule exists for the geometric center point corresponding to the polygon area:
longitude of the border break point on the left side of the geometric center point of the area < longitude of the geometric center point;
the longitude of the boundary break point on the right side of the geometric center point of the area is greater than the longitude of the geometric center point;
the latitude of the lower side boundary break point of the geometric center point of the region < the latitude of the geometric center point;
the latitude of the upper side boundary break point of the geometric center point of the region is larger than that of the geometric center point.
Because the geometric center points corresponding to the polygonal areas have the above rules, the longitude of each preset turning point on the boundary of each polygonal area is less than the preset turning point of the longitude of the geometric center point corresponding to each polygonal area, and the preset turning points are added into the regional turning point longitude list, so that the data volume stored in the regional turning point longitude list can be effectively reduced. Therefore, the calculation cost is reduced, and the calculation speed of the matching result is improved.
On the basis of the foregoing embodiment, in this embodiment, matching the longitude of the target point with a preset longitude area search tree to determine a first area matching result includes:
matching the longitude of the target point in a preset longitude area retrieval tree by using a preset longitude array of the preset longitude area retrieval tree, and if the matching is successful, taking ID information of a polygon area to which a corresponding preset turning point matched in the preset longitude array belongs as a first area matching result;
and if the matching is unsuccessful, expanding the longitude range of the target point, performing range search on a preset turning point longitude array in a longitude area retrieval tree by adopting a binary search mode, acquiring a preset turning point matched with the longitude range of the target point, and taking ID information of a polygon area to which the corresponding preset turning point matched in the preset turning point longitude array belongs as a first area matching result.
In this embodiment, it should be noted that: the range search algorithm is shown in fig. 4, and the binary search algorithm is shown in fig. 5. The binary search mode can be that the keyword is compared with the element positioned in the center of the array, and if the keyword is smaller than the element positioned in the center, the search is carried out only on the first half part of the array; if the keyword is equal to the central element, ending the search and finding a matched element; if the key is larger than the central element, the search only needs to be continued in the latter half of the array. The binary search method can reduce the search range by half every time the binary search method is used for searching once. Assuming that the number of array elements is n, for the sake of calculation, it is assumed that n is a power of 2. Then after the first comparison, only n/2 elements remain to continue searching; only (n/2)/2 elements remain after the second comparison and the search continues. Then after the kth comparison, there are n/2k elements left to continue the search. When k is log2n (logarithm of base 2 n), only one element remains, so that only one more comparison is needed. Thus, the binary search method finds a key in a sorted array, requiring log2n (base 2n logarithm) +1 comparison operation in the worst case, for a list of 1024 (210) elements, the binary search requires 11 comparisons in the worst case, while the sequential search method requires 1024 comparisons in the worst case. After each comparison, the binary search method reduces the array range to be searched by half, and can use variables low and high to respectively represent the head subscript and the tail subscript of the array region currently searched, so that the value of the variable mid is (low + high)/2.
In this embodiment, for the longitude of the target point matched by the preset longitude array in the preset longitude area search tree, if the matching is successful, it should be noted that:
if the target point is just a certain preset break point, inputting the target point, namely searching the adjacent polygon area matched with the target point in the search tree of the preset longitude area immediately without expanding the longitude range of the target point.
In this embodiment, for the longitude of the destination point matched by the preset longitude array in the preset longitude area search tree, if the matching is unsuccessful, for example:
the longitude of the target point is 113 ° 41 'and the latitude is 29 ° 58'. The left and right boundary values in the preset longitude region search tree are 73 ° 33 'to 135 ° 05', respectively. Performing range search on a preset inflection point longitude array in a longitude area retrieval tree by adopting a binary search mode, continuously expanding the longitude of a destination point, wherein if the longitude of the destination point is expanded by 4 degrees for the first time, the longitude of the destination point can be (115 degrees 41 'to 111 degrees 41'), the longitude of the destination point can also be (117 degrees 41 'to 109 degrees 41'), and searching a preset inflection point matched with the longitude range of the destination point in the preset longitude area retrieval tree, wherein as shown by a smaller rectangular frame in fig. 6, no intersection point exists between the preset inflection point longitude array and the boundary of a polygonal area, namely that matching is unsuccessful; and continuing to expand the longitude range of the target point, expanding by 10 degrees for the second time, searching for a preset folding point matched with the longitude range of the target point in a preset longitude area retrieval tree, wherein 9 intersection points exist between the preset folding point and the boundary of a polygon area as shown by a large rectangular frame in fig. 6, namely the ID information of the polygon area to which the 9 preset folding points belong is used as a first area matching result.
On the basis of the foregoing embodiment, in this embodiment, matching the target point with a preset latitude region search tree based on the latitude of the target point, and determining a second region matching result includes:
matching the latitude of the target point with a preset break point latitude array in the preset latitude area retrieval tree, and if the matching is successful, taking ID information of a polygon area to which a corresponding preset break point matched in the preset break point latitude array belongs as a second area matching result;
and if the matching is unsuccessful, expanding the latitude range of the target point, performing range search on a preset break point latitude array in a latitude region retrieval tree by adopting a binary search mode to obtain a preset break point matched with the latitude range of the target point, and taking ID information of a polygon region to which the corresponding preset break point matched in the preset break point latitude array belongs as a second region matching result.
In this embodiment, the longitude of the target point is matched with the preset longitude array in the preset longitude area search tree, and if the matching is successful, the ID information of the polygon area to which the corresponding preset waypoint matched in the preset longitude array belongs is used as a first area matching result; if the matching is unsuccessful, the longitude range of the target point is expanded, a binary search mode is adopted, a range search is performed on a preset turning point longitude array in a longitude area retrieval tree, a preset turning point matched with the longitude range of the target point is obtained, and the technical principle and the beneficial effect of the embodiment are similar, wherein the technical principle and the beneficial effect of the embodiment are that the ID information of a polygon area to which the corresponding preset turning point matched in the preset turning point longitude array belongs is taken as a first area matching result.
On the basis of the above embodiment, in this embodiment, the method further includes:
and expanding the longitude range of the target point according to the preset times and/or the preset longitude range.
In this embodiment, a limited number of times is used to expand the longitude range of the target point; for example, if the longitude range of the expanded target point is expanded by 5 degrees each time and the area cannot be matched after the expansion is 5 times, the determination is failed.
In this embodiment, the longitude range of the target point is expanded by limiting the longitude range; for example, the longitude range of the extended target point is extended by 5 ° each time, and the allowable extended longitude range is limited to (73 ° 33 'E to 135 ° 05' E), and if the range is extended several times and then the range is beyond the limit, it is determined that the area cannot be matched, and the determination fails.
In this embodiment, the longitude range of the target point may be expanded by limiting the number of times and limiting the longitude range.
As can be seen from the foregoing technical solutions, in the method for matching an adjacent polygon area based on longitude and latitude in the embodiments of the present invention, the matching is not performed without limitation by limiting the number of times and/or limiting the longitude range, which is beneficial to improving the efficiency of feeding back the result of the adjacent polygon area matched with the target point.
On the basis of the above embodiment, in this embodiment, the method further includes:
and expanding the latitude range of the target point according to the preset times and/or the preset latitude range.
The technical principle and the beneficial effects of the embodiment of the present embodiment are similar to those of the embodiment of expanding the longitude range of the target point according to the preset times and/or the preset longitude range, and reference may be made to the embodiment specifically, which is not described herein again.
On the basis of the above embodiment, in this embodiment, the method further includes:
and if the determined first area matching result and the second area matching result have no area intersection within the preset times and/or the preset longitude range, searching a preset folding point with the smallest longitude difference between the longitude of the preset folding point in the preset longitude area retrieval tree and the longitude of the target point, and taking the ID information of the polygon area to which the corresponding preset folding point belongs as an adjacent polygon area matched with the target point.
In this embodiment, it can be understood that, for example, if there is no area intersection between the first area matching result and the second area matching result within the preset number of times and/or the preset longitude range, a preset inflection point with the smallest longitude difference between the longitude of the preset inflection point in the preset longitude area search tree and the longitude of the destination point may be selected, and if the preset inflection point with the smallest longitude difference between the preset inflection point and the destination point is the preset inflection point 1, the polygon area α to which the preset inflection point 1 belongs is taken as the neighboring polygon area matched with the destination point.
As can be seen from the foregoing technical solutions, in the method for matching neighboring polygon areas based on longitude and latitude in the embodiments of the present invention, when there is no area intersection between the first area matching result and the second area matching result within the preset number of times and/or the preset longitude range, it is determined that the result is a failure, and the ID information of the polygon area to which the preset break point with the smallest longitude difference of the target point belongs is used as the neighboring polygon area matched with the target point, which is beneficial to fast matching the neighboring polygon area according to longitude and latitude.
On the basis of the above embodiment, in this embodiment, the method further includes:
and if the determined first region matching result and the second region matching result have no region intersection within the preset times and/or the preset latitude range, searching a preset break point with the smallest difference value between the latitude of the preset break point in the preset latitude region retrieval tree and the latitude of the target point, and taking the ID information of the polygon region to which the corresponding preset break point belongs as the adjacent polygon region matched with the target point.
The technical principle and the beneficial effects of the embodiment are similar to those of the embodiment described above, in which if there is no area intersection between the determined first area matching result and the determined second area matching result within the preset times and/or the preset longitude range, the preset turning point with the smallest difference between the longitude of the preset turning point in the preset longitude area search tree and the longitude of the target point is searched, and the ID information of the polygon area to which the corresponding preset turning point belongs is used as the adjacent polygon area matched with the target point.
The following examples are included to further illustrate the invention in order to better understand the invention, but the invention is not limited to the following examples:
the distribution of a plurality of polygon areas is shown in fig. 6, where the five-star shaped points in fig. 6 represent target points, and adjacent polygon areas of the five-star shaped points are expected to be matched.
It can be seen from fig. 6 that the position (i.e., long longitude, lat latitude) of the five-star shaped point is not a point on the boundary of the polygon area, and therefore, the adjacent polygon area matching the five-star shaped point cannot be matched without expanding the longitude range and the latitude range of the five-star shaped point. Therefore, a range of longitude and latitude [ ng-P ] of the five-star shaped point (lng, lat) is adopted to be expanded continuouslyi，lng+Pi) And [ lat-Q ]i，lat+Qi) I.e. constantly extending longitude and latitude extensions as indicated by the two dashed lines in fig. 6.
As can be seen by the longitude extensions in fig. 6, the longitude extensions pass A, B, C, D, E, F sequentially from west to east; as can be seen by the latitudinal extension lines in fig. 6, the latitudinal extension lines pass through G, H, D, I, J, K sequentially from south to north. Since both the longitude extension line and the latitude extension line contain the polygon area D, the adjacent polygon area matching the pentagram-shaped point can be determined to be D.
In this embodiment, it should be noted that the longitude extension line and the latitude extension line are gradually stretched because the regions are irregular polygons, and there may be a plurality of results when the longitude and latitude extension lines intersect within a certain range. Therefore, the method provided by this embodiment returns the first matched result in the intersection, which is the result with the minimum system matching overhead.
In practical application, experiments are carried out aiming at administrative regions of China, and the experimental results show that: the matching times are 29460 times; wherein, the matching fails 767 times, and the failure rate is 2.603%; wherein, the matching is successful 28693 times, and the success rate is 97.397%; the average detection times are 11; average takes 6 milliseconds; the areas where matching fails are mainly coastal terrain complex areas, such as elephant mountain, navian mountain, Chongming, Xiamen, Qingdao, and Caifei Dian.
Fig. 7 is a schematic structural diagram of an apparatus for matching neighboring polygonal areas based on longitude and latitude according to an embodiment of the present invention, as shown in fig. 7, the apparatus includes: an obtaining module 201, a first matching module 202, a second matching module 203, and a third matching module 204, wherein:
the acquiring module 201 is configured to acquire a longitude and a latitude of a target point;
a first matching module 202, configured to match, based on the longitude of the target point, a preset longitude area search tree, and determine a first area matching result; the preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the polygon region to which the corresponding preset folding point belongs; the preset break points are points on the boundary of the polygonal area;
the second matching module 203 is configured to match the latitude of the target point with a preset latitude region search tree to determine a second region matching result; the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs;
a third matching module 204, configured to use a region intersection of the first region matching result and the second region matching result as an adjacent polygon region matching the target point.
The device for matching the adjacent polygonal area based on the longitude and the latitude provided by the embodiment of the present invention can be specifically used for executing the method for matching the adjacent polygonal area based on the longitude and the latitude of the above embodiment, and the technical principle and the beneficial effect thereof are similar, and reference may be made to the above embodiment specifically, and details are not repeated here.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods of the various embodiments or some parts of the embodiments.
In addition, in the present invention, terms such as "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Moreover, in the present invention, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
Furthermore, in the description herein, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (9)
1. A method for matching adjacent polygonal regions based on longitude and latitude, comprising:
acquiring the longitude and latitude of a target point;
matching with a preset longitude area retrieval tree based on the longitude of the target point to determine a first area matching result; the preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the polygon region to which the corresponding preset folding point belongs; the preset break points are points on the boundary of the polygonal area;
the preset longitude region retrieval tree stores a mapping relation between the longitude of each preset inflection point and a polygon region to which the corresponding preset inflection point belongs, and further includes:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list according to a first preset rule; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas, ID information of the polygonal areas to which the corresponding preset break points belong and geometric central points corresponding to the polygonal areas;
wherein, the first preset rule is as follows:
adding the longitude of each preset turning point on the boundary of each polygonal area to a preset turning point longitude list, wherein the longitude of each preset turning point on the boundary of each polygonal area is smaller than the longitude of a geometric center point corresponding to each polygonal area;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude region retrieval tree comprises a preset inflection point longitude array and a corresponding polygon region ID information array to which the preset inflection point belongs;
matching with a preset latitude area retrieval tree based on the latitude of the target point to determine a second area matching result; the preset latitude area retrieval tree stores a mapping relation between the latitude of each preset break point and a polygon area to which the corresponding preset break point belongs;
the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs, and the method further comprises the following steps:
loading a plurality of polygonal area information, and creating an area break point latitude list according to a second preset rule; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area, ID information of the polygonal area to which the corresponding preset break point belongs and a geometric central point corresponding to each polygonal area;
wherein the second preset rule is as follows:
adding preset break points of which the latitudes of the preset break points on the boundaries of the polygonal areas are smaller than the latitudes of the geometric center points corresponding to the polygonal areas into the area break point latitude list;
sorting all preset break points in the regional break point latitude list according to the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array corresponding to the preset breakpoint;
and taking the intersection of the areas of the first area matching result and the second area matching result as the adjacent polygon area matched with the target point.
2. The method for matching adjacent polygon areas based on longitude and latitude according to claim 1, wherein the preset longitude area search tree stores a mapping relationship between the longitude of each preset inflection point and the polygon area to which the corresponding preset inflection point belongs, and comprises:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas and ID information of the polygonal areas to which the corresponding preset break points belong;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude area retrieval tree comprises a preset inflection point longitude array and a corresponding polygon area ID information array to which the preset inflection point belongs;
correspondingly, the preset latitude region retrieval tree stores the mapping relationship between the latitude of each preset break point and the polygon region to which the corresponding preset break point belongs, and the method comprises the following steps:
loading a plurality of polygonal region information, and creating a region break point latitude list; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area and ID information of the polygonal area to which the corresponding preset break point belongs;
sorting all preset break points in the regional break point latitude list according to the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array to which the corresponding preset breakpoint belongs.
3. The method for matching adjacent polygonal areas based on longitude and latitude according to claim 2, wherein matching with a preset longitude area search tree based on the longitude of the target point to determine a first area matching result comprises:
matching the longitude of the target point in a preset longitude area retrieval tree by using a preset longitude array of the preset longitude area retrieval tree, and if the matching is successful, taking ID information of a polygon area to which a corresponding preset turning point matched in the preset longitude array belongs as a first area matching result;
and if the matching is unsuccessful, expanding the longitude range of the target point, performing range search on a preset turning point longitude array in a longitude area retrieval tree by adopting a binary search mode, acquiring a preset turning point matched with the longitude range of the target point, and taking ID information of a polygon area to which the corresponding preset turning point matched in the preset turning point longitude array belongs as a first area matching result.
4. The method for matching adjacent polygonal areas based on longitude and latitude according to claim 2, wherein matching with a preset latitude area search tree based on the latitude of the target point to determine a second area matching result comprises:
matching the latitude of the target point with a preset break point latitude array in the preset latitude area retrieval tree, and if the matching is successful, taking ID information of a polygon area to which a corresponding preset break point matched in the preset break point latitude array belongs as a second area matching result;
and if the matching is unsuccessful, expanding the latitude range of the target point, performing range search on a preset break point latitude array in a latitude region retrieval tree by adopting a binary search mode to obtain a preset break point matched with the latitude range of the target point, and taking ID information of a polygon region to which the corresponding preset break point matched in the preset break point latitude array belongs as a second region matching result.
5. The method for matching neighboring polygonal areas based on longitude and latitude of claim 3, further comprising:
and expanding the longitude range of the target point according to the preset times and/or the preset longitude range.
6. The method for matching neighboring polygonal areas based on longitude and latitude of claim 4, further comprising:
and expanding the latitude range of the target point according to the preset times and/or the preset latitude range.
7. The method for matching neighboring polygonal areas based on longitude and latitude of claim 5, further comprising:
and if the determined first area matching result and the second area matching result have no area intersection within the preset times and/or the preset longitude range, searching a preset folding point with the smallest longitude difference between the longitude of the preset folding point in the preset longitude area retrieval tree and the longitude of the target point, and taking the ID information of the polygon area to which the corresponding preset folding point belongs as an adjacent polygon area matched with the target point.
8. The method for matching neighboring polygonal areas based on longitude and latitude of claim 5, further comprising:
and if the determined first region matching result and the second region matching result have no region intersection within the preset times and/or the preset latitude range, searching a preset break point with the smallest difference value between the latitude of the preset break point in the preset latitude region retrieval tree and the latitude of the target point, and taking the ID information of the polygon region to which the corresponding preset break point belongs as the adjacent polygon region matched with the target point.
9. An apparatus for matching adjacent polygonal areas based on longitude and latitude, comprising:
the acquisition module is used for acquiring the longitude and the latitude of the target point;
the first matching module is used for matching with a preset longitude area retrieval tree based on the longitude of the target point to determine a first area matching result; the preset longitude region retrieval tree stores the mapping relation between the longitude of each preset folding point and the polygon region to which the corresponding preset folding point belongs; the preset break points are points on the boundary of the polygonal area;
the preset longitude region retrieval tree stores a mapping relation between the longitude of each preset inflection point and a polygon region to which the corresponding preset inflection point belongs, and further includes:
loading a plurality of polygonal area information, and creating an area breakpoint longitude list according to a first preset rule; the information of the plurality of polygonal areas comprises longitudes of preset break points on the boundaries of the polygonal areas, ID information of the polygonal areas to which the corresponding preset break points belong and geometric central points corresponding to the polygonal areas;
wherein the first preset rule is as follows:
adding the longitude of each preset turning point on the boundary of each polygonal area to a preset turning point longitude list, wherein the longitude of each preset turning point on the boundary of each polygonal area is smaller than the longitude of a geometric center point corresponding to each polygonal area;
sorting all preset folding points in the area folding point longitude list according to the longitude size, and creating a preset longitude area retrieval tree; the preset longitude region retrieval tree comprises a preset inflection point longitude array and a corresponding polygon region ID information array to which the preset inflection point belongs;
the second matching module is used for matching with a preset latitude region retrieval tree based on the latitude of the target point to determine a second region matching result; the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs;
the preset latitude area retrieval tree stores the mapping relation between the latitude of each preset break point and the polygon area to which the corresponding preset break point belongs, and the method further comprises the following steps:
loading a plurality of polygonal area information, and creating an area break point latitude list according to a second preset rule; the information of the plurality of polygonal areas comprises the latitude of each preset break point on the boundary of each polygonal area, ID information of the polygonal area to which the corresponding preset break point belongs and a geometric central point corresponding to each polygonal area;
wherein the second preset rule is as follows:
adding preset break points of which the latitudes of the preset break points on the boundaries of the polygonal areas are smaller than the latitudes of the geometric center points corresponding to the polygonal areas into the area break point latitude list;
sorting all preset break points in the regional break point latitude list according to the latitude, and creating a preset latitude regional search tree; the preset latitude area retrieval tree comprises a preset breakpoint latitude array and a polygon area ID information array corresponding to the preset breakpoint;
and the third matching module is used for taking the area intersection of the first area matching result and the second area matching result as an adjacent polygon area matched with the target point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010929207.2A CN112783891B (en) | 2020-09-07 | 2020-09-07 | Method and device for matching adjacent polygonal areas based on longitude and latitude |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010929207.2A CN112783891B (en) | 2020-09-07 | 2020-09-07 | Method and device for matching adjacent polygonal areas based on longitude and latitude |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112783891A CN112783891A (en) | 2021-05-11 |
| CN112783891B true CN112783891B (en) | 2022-06-14 |
Family
ID=75750344
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010929207.2A Active CN112783891B (en) | 2020-09-07 | 2020-09-07 | Method and device for matching adjacent polygonal areas based on longitude and latitude |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112783891B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116721178B (en) * | 2023-05-04 | 2024-03-19 | 中远海运散货运输有限公司 | Chart selection method for polygon area crossing east-west warp 180 degrees |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103810194A (en) * | 2012-11-11 | 2014-05-21 | 刘龙 | Geographic coding method, position inquiring system and position inquiring method |
| CN107153711A (en) * | 2017-05-19 | 2017-09-12 | 北京旋极伏羲大数据技术有限公司 | Geographic information data processing method and processing device |
| CN108287907A (en) * | 2018-01-31 | 2018-07-17 | 吉林大学 | Satellite data querying method, system, equipment and computer readable storage medium |
| CN109063193A (en) * | 2018-08-29 | 2018-12-21 | 中国科学院地理科学与资源研究所 | A kind of thematic maps recommends the method and device of display |
| CN109947889A (en) * | 2019-03-21 | 2019-06-28 | 佳都新太科技股份有限公司 | Spatial data management method, apparatus, equipment and storage medium |
| CN110633262A (en) * | 2019-09-25 | 2019-12-31 | 重庆邮电大学 | Map intersection area calculation method and system based on Spark |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8199972B2 (en) * | 2008-02-06 | 2012-06-12 | Icontrol, Inc. | Methods and systems for fast scan location identification |
-
2020
- 2020-09-07 CN CN202010929207.2A patent/CN112783891B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103810194A (en) * | 2012-11-11 | 2014-05-21 | 刘龙 | Geographic coding method, position inquiring system and position inquiring method |
| CN107153711A (en) * | 2017-05-19 | 2017-09-12 | 北京旋极伏羲大数据技术有限公司 | Geographic information data processing method and processing device |
| CN108287907A (en) * | 2018-01-31 | 2018-07-17 | 吉林大学 | Satellite data querying method, system, equipment and computer readable storage medium |
| CN109063193A (en) * | 2018-08-29 | 2018-12-21 | 中国科学院地理科学与资源研究所 | A kind of thematic maps recommends the method and device of display |
| CN109947889A (en) * | 2019-03-21 | 2019-06-28 | 佳都新太科技股份有限公司 | Spatial data management method, apparatus, equipment and storage medium |
| CN110633262A (en) * | 2019-09-25 | 2019-12-31 | 重庆邮电大学 | Map intersection area calculation method and system based on Spark |
Non-Patent Citations (1)
| Title |
|---|
| 基于改进的网格划分方法的地图匹配算法研究;王诗航;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20180216;C034-832 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112783891A (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7574428B2 (en) | Geometry-based search engine for navigation systems | |
| Sankaranarayanan et al. | Efficient query processing on spatial networks | |
| Xiao et al. | Density based co-location pattern discovery | |
| Safar et al. | Voronoi-based reverse nearest neighbor query processing on spatial networks | |
| CN107766433B (en) | Range query method and device based on Geo-BTree | |
| Shan et al. | COBWEB: A robust map update system using GPS trajectories | |
| WO2009017926A2 (en) | Generalized location identification | |
| CN109947881B (en) | POI weight judging method and device, mobile terminal and computer readable storage medium | |
| CN105628044A (en) | Vehicle-mounted navigating device based on position real-time updating and road section attributes and navigating method | |
| CN112783891B (en) | Method and device for matching adjacent polygonal areas based on longitude and latitude | |
| CN107423373A (en) | A kind of City-level three-dimensional building model indexing means | |
| CN113065057A (en) | Data information authenticity verification method, device, equipment and storage medium | |
| Belhassena et al. | Trajectory big data processing based on frequent activity | |
| CN115658940A (en) | Method, device and storage medium for constructing and updating heterogeneous detection feature database | |
| Abbasifard et al. | Efficient indexing for past and current position of moving objects on road networks | |
| Edwardes et al. | Intelligent generalisation of urban road networks | |
| CN113345045A (en) | OSgEarth-based plotting method and system crossing positive and negative 180-longitude positions | |
| Eremeev et al. | Comparison of urban areas based on database of topological relationships in geoinformational systems | |
| CN102915311B (en) | Searching method and system | |
| KR101063827B1 (en) | Semi-automated Conjugated Point Pair Extraction Method for Transformation of Geometric Maps between Continuous and Digital Topographic Maps | |
| CN110807061A (en) | Method for searching frequent subgraphs of uncertain graphs based on layering | |
| CN114463499B (en) | Building three-dimensional modeling method and device | |
| CN109002511A (en) | A kind of intelligent recommendation method and apparatus of public lavatory | |
| CN113074735B (en) | Processing method of map data structure | |
| Huang et al. | Continuous within query in road networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Method and device for matching adjacent polygon regions based on longitude and latitude Effective date of registration: 20221127 Granted publication date: 20220614 Pledgee: Bank of Hangzhou Limited by Share Ltd. science and Technology Branch Pledgor: HANGZHOU HOPECHART IOT TECHNOLOGY Co.,Ltd. Registration number: Y2022980023716 |