Map coding method integrating map slicing function and Beidou grid location code

Abstract

The embodiments of the present application relate to the field of map positioning technology, and in particular to a map encoding method that integrates a map slicing function and a Beidou grid location code, comprising: selecting a reference point on a target map, taking the reference point as the origin, and gridding the target map based on a grid offset length of a preset level of a Beidou grid location code to obtain a basic grid of the target map, wherein each grid unit is marked with a unique grid code; selecting a reference point among the grid intersections of the basic grid; taking each reference point as the center, encoding the Beidou grid location code according to the grid offset length of the preset level of the Beidou grid location code, and replacing the grid code of each grid unit of the basic grid with the Beidou grid location code to obtain a fused grid of the target map, which can efficiently and accurately realize the grid division and encoding of the target map, avoid the intersection of grid units, facilitate overall management, and give full play to the advantages of the Beidou grid location code.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of map positioning technology, and in particular to a map encoding method that integrates a map slicing function and a Beidou grid location code. Background Art

[0002] The more mature map positioning systems in the industry are basically search engines implemented by third-party map tools, relying on traditional latitude and longitude positioning methods to achieve map positioning. This is insufficient in the digital twin of the park, and the positioning accuracy and efficiency do not meet the requirements. The introduction of the Beidou grid location code makes up for this shortcoming. The Beidou grid location code also has high positioning accuracy and efficiency in dynamic digital twin scenarios.

[0003] Beidou grid location code, also known as Beidou grid code or Beidou navigation grid code, is a global regional location identification coding standard developed by the national Beidou system. This coding standard can assign a globally unique one-dimensional integer code to any grid of varying sizes with a maximum accuracy of 1.5 cm in the earth's space from the center of the earth to 60,000 kilometers above the ground. The Beidou grid location code is combined with the Beidou system and the Beidou enhanced system to provide users with a new spatial location service model, which greatly improves the efficiency of organization, management, calculation, analysis and query integration of big data, and is of great significance to information construction, social development and people's life.

[0004] However, the existing map slicing function is not well integrated with the Beidou grid location code, and grid nesting, overlapping and interlacing are prone to occur, which fails to bring into play the advantages of the Beidou grid location code. Summary of the invention

[0005] The main purpose of the embodiments of the present application is to propose a map coding method that integrates map slicing function and Beidou grid location code, which can efficiently and accurately realize the grid division and coding of the target map, fundamentally avoid the interleaving between grid units, facilitate overall management, and maximize the advantages of Beidou grid location code.

[0006] To achieve the above-mentioned purpose, an embodiment of the present application provides a map encoding method that integrates a map slicing function and a Beidou grid location code, comprising the following steps: selecting a reference point on a target map, utilizing the slicing function of a digital map software, taking the reference point as the origin, and gridding the target map based on a grid offset length of a preset level of a Beidou grid location code to obtain a basic grid of the target map; wherein each grid unit in the basic grid is marked with a unique grid code; selecting a reference point among the grid intersection points of the basic grid, wherein the distance between two adjacent reference points is not greater than a first preset distance, and the first preset distance is determined based on a grid offset length of a preset level of the Beidou grid location code; respectively taking each of the reference points as the center, encoding the Beidou grid location code according to the grid offset length of the preset level of the Beidou grid location code, and replacing the grid code of each grid unit of the basic grid with the encoded Beidou grid location code to obtain a fused grid of the target map.

[0007] To achieve the above-mentioned purpose, an embodiment of the present application further provides a map encoding system that integrates a map slicing function and a Beidou grid location code, the system comprising: a basic grid segmentation module, used to select a reference point on a target map, and use the slicing function of a digital map software to grid the target map based on the preset level grid offset length of the Beidou grid location code with the reference point as the origin to obtain a basic grid of the target map; wherein each grid unit of the basic grid is marked with a unique grid code; a reference point selection module, used to select a reference point from the grid intersection points of the basic grid, the distance between two adjacent reference points is not greater than a first preset distance, and the first preset distance is determined based on the preset level grid offset length of the Beidou grid location code; a Beidou grid location code encoding module, used to encode the Beidou grid location code with each of the reference points as the center according to the preset level grid offset length of the Beidou grid location code; a fusion module, used to replace the grid code of each grid unit of the basic grid with the encoded Beidou grid location code to obtain a fused grid of the target map.

[0008] To achieve the above-mentioned purpose, an embodiment of the present application also provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the above-mentioned map encoding method of the fused map slicing function and the Beidou grid location code.

[0009] To achieve the above objectives, an embodiment of the present application also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the above-mentioned map encoding method of the fusion map slicing function and Beidou grid location code.

[0010] The map coding method of the embodiment of the present application that integrates the map slicing function and the Beidou grid location code is integrated with the map slicing function and the Beidou grid location code. The basic grid of the target map obtained by slicing the digital map software is used as a bridge, and a reference point is selected from the grid intersection points of the basic grid to encode the Beidou grid location code, so as to achieve efficient conversion between the grid code and the Beidou grid location code, and obtain the fused grid of the target map. This greatly reduces the manpower required for grid calculation and division. There is no need for staff to go to the park for on-site manual measurement and division, nor is there a need to perform tedious switching calculations to divide the range of the grid through longitude and latitude. By using the slicing function of the digital map software, only a reference point is established as the origin to efficiently and accurately divide the park into grids, which greatly saves resource investment. Reference points are selected from the grid intersection points of the basic grid. All reference points are established in the same basic grid system, which fundamentally avoids the intersection of Beidou grids. Even if overlap occurs, they can be perfectly spliced ​​and connected, which is more convenient for overall management. The distance between two adjacent reference points is set to be no greater than the grid offset length of the preset level based on the Beidou grid location code to determine the first preset distance. This can ensure that every grid unit of the basic grid can be successfully encoded with the Beidou grid location code, reducing the complexity of map coding and the computing power required for map coding, thereby maximizing the advantages of the Beidou grid location code.

[0011] In some optional embodiments, the Beidou grid location code encoding is performed with each of the reference points as the center according to the preset level of the grid offset length of the Beidou grid location code, including: traversing each of the reference points, determining the radiation area of ​​the current reference point on the target map according to the preset level of the Beidou grid location code, taking the current reference point as the center, and dividing the radiation area into grids based on the preset level of the grid offset length of the Beidou grid location code to obtain the Beidou grid of the radiation area; according to the encoding rule of the Beidou grid location code, marking the Beidou grid location code for each grid unit in the Beidou grid of the radiation area, after traversing all the reference points, splicing all the Beidou grids to complete the Beidou grid location code encoding of the target map. It can be seen from the encoding rule of the Beidou grid location code that the radiation range of each reference point is limited, and the Beidou grid corresponding to the radiation area can be divided for each reference point, and then the Beidou grid location code encoding is performed respectively. Since all reference points are established in the same set of basic grid systems, splicing all the Beidou grids can complete the Beidou grid location code encoding of the target map.

[0012] In some optional embodiments, if there is an overlapping area in the radiation area of ​​two adjacent reference points on the target map, only the Beidou grid location code of the overlapping area under one of the reference points is retained. The existence of overlapping areas is inevitable, but the grid unit lengths of the basic grid and the Beidou grid are the same, and all reference points are established in the same set of basic grid systems. The overlapping areas are just repeated, and there is no grid interlacing. At this time, the Beidou grid location code under one of the reference points can be retained to ensure that the Beidou grid location code of the grid unit is single and unique.

[0013] In some optional embodiments, a reference point is selected on the target map, and the slicing function of the digital map software is used to grid the target map with the reference point as the origin based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target map, including: selecting the upper left corner point of the target map as the reference point, and determining the reference division length according to the grid offset length of the preset level of the Beidou grid location code; using the slicing function of the digital map software, with the reference point as the origin, gridding the target map from left to right and from top to bottom according to the reference division length to obtain the basic grid of the target map; wherein, if during grid division, the remaining length of the divided area compared to the right boundary and the lower boundary of the target map is less than the reference division length, a corresponding blank area is generated to fill the target map, so that the remaining length of the divided area compared to the right boundary and the lower boundary of the target map is equal to the reference division length. The upper left corner of the target map is selected as the reference point to make the entire map encoding process more standardized and normative. Since the width and height of the target map may not be divisible by the reference division length, for the right and lower boundaries of the target map, if the remaining length is less than the reference division length, a blank area is automatically generated to fill the gap to ensure that the size of each grid unit is the same, which is convenient for subsequent fusion with the Beidou grid location code.

[0014] In some optional embodiments, the preset level is the fifth level, and selecting reference points among the grid intersection points of the basic grid includes: selecting each grid intersection point of the 7nth row and the 7mth column of the basic grid as a reference point; wherein n and m are both integers greater than 0, and it is ensured that 7n is not greater than N, 7m is not greater than M, N is the total number of rows of the basic grid, and M is the total number of columns of the basic grid.

[0015] In some optional embodiments, the reference point is selected on the target map, and the slicing function of the digital map software is used to grid the target map with the reference point as the origin based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target map, including: delineating the target area in the target map; wherein the number of the target areas is at least 1; the reference point is selected on the target area, and the slicing function of the digital map software is used to grid the target area with the reference point as the origin based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target area; wherein the preset levels corresponding to different target areas can be the same or different. Limiting the target area can reduce the grid division and calculation of unnecessary areas, reduce the calculation pressure, reduce the interface load, and facilitate data management. In addition, the preset levels corresponding to different target areas can be the same or different, that is, the grid division accuracy of different target areas can be different, and for target areas with high precision requirements, it is no longer necessary to divide them layer by layer, further reducing unnecessary calculations and reducing useless data. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 It is a flow chart of a map encoding method integrating a map slicing function and a Beidou grid location code provided in one embodiment of the present application;

[0017] Figure 2 is a schematic diagram of a basic grid of a target map provided in one embodiment of the present application;

[0018] Figure 3 is a schematic diagram of a grid code of a basic grid provided in one embodiment of the present application;

[0019] Figure 4 Provided in one embodiment of the present application, a reference point is selected on a target map, and a slicing function of a digital map software is used to grid the target map based on a preset level of grid offset length of a Beidou grid location code with the reference point as the origin to obtain a flowchart of a basic grid of the target map;

[0020] Figure 5 is a schematic diagram of a basic grid of different target areas provided in one embodiment of the present application;

[0021] Figure 6 It is a flowchart provided in an embodiment of the present application, which is to encode the Beidou grid position code according to the grid offset length of the preset level of the Beidou grid position code with each reference point as the center;

[0022] Figure 7 is a schematic diagram of a Beidou grid location code of a Beidou grid provided in an embodiment of the present application;

[0023] Figure 8 It is a structural schematic diagram of a map coding system integrating a map slicing function and a Beidou grid location code provided in another embodiment of the present application;

[0024] Fig. 9 It is a schematic diagram of the structure of an electronic device provided in another embodiment of the present application. DETAILED DESCRIPTION

[0025] To make the purpose, technical scheme and advantages of the embodiments of the present application clearer, the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings. However, it will be appreciated by those skilled in the art that in the present application, many technical details are proposed in order to enable the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical scheme claimed in the present application can also be implemented. The division of the following embodiments is for the convenience of description, and the specific implementation of the present application should not be construed as any limitation, and the various embodiments can be combined and referenced with each other under the premise of no contradiction.

[0026] An embodiment of the present application relates to a map encoding method that integrates a map slicing function and a Beidou grid location code, which is applied to an electronic device, wherein the electronic device can be a terminal or a server, and this embodiment and the following embodiments are all described by taking the server as an example. The following is a specific description of the implementation details of the map encoding method that integrates a map slicing function and a Beidou grid location code proposed in this embodiment. The following content is only for the convenience of understanding the implementation details provided, and is not necessary for the implementation of this solution.

[0027] The specific process of the map encoding method integrating the map slicing function and the Beidou grid location code proposed in this embodiment can be as follows: Figure 1 As shown, including:

[0028] Step 101, select a reference point on the target map, use the slicing function of the digital map software, take the reference point as the origin, and divide the target map into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target map, and each grid cell in the basic grid is marked with a unique grid code.

[0029] In a specific implementation, after the server obtains the target map, it can select any reference point on the target map, use the slicing function of the digital map software (i.e., third-party map software), take the selected reference point as the origin, and divide the target map into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target map. Each grid cell in the basic grid of the target map is marked with a unique grid code, and all grid cells are square.

[0030] It is worth noting that there are ten levels of Beidou grid location code, and the grid offset length of each level is different. Taking the commonly used fifth level as an example, the grid offset length of the fifth level is 8 grids less than 1km, which means that the length of one grid is required to be 128m. If the preset level is the fifth level, then in the basic grid of the divided target map, the size of each grid unit actually represents an area of ​​128m×128m.

[0031] In one example, the base grid of the target map can be Figure 2 As shown, the server can mark each grid unit with a unique grid code based on the reference point according to the orientation, such as Figure 3 As shown, in order to highlight the grid code, Figure 3 Only the base grid of the target map is retained, and the content of the target map is omitted. Figure 3 The black dot in the figure is the selected reference point. The grid is divided with the reference point as the center, and the grid code assigned to the first grid unit in the first quadrant is (1,1).

[0032] In one example, the server selects a reference point on the target map, uses the slicing function of the digital map software, takes the reference point as the origin, and divides the target map into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target map, which can be obtained by Figure 4 The steps shown in the figure are implemented, including:

[0033] Step 1011, delineate target areas in the target map, and the number of target areas is at least one.

[0034] In the specific implementation, before the server performs grid division, it must first define the target area in the target map. The number of target areas is at least 1. Figure 5 The target map shown is demarcated into two target areas, a central area and a peripheral area, and the server then divides each target area into grids.

[0035] Step 1012, select a reference point on the target area, use the slicing function of the digital map software, take the reference point as the origin, and divide the target area into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target area. The preset levels corresponding to different target areas can be the same or different.

[0036] In the specific implementation, after the server defines the target area in the target map, it can traverse each target area, select a reference point on the target area, and use the slicing function of the digital map software to divide the target area into grids based on the grid offset length of the preset level of the Beidou grid location code with the reference point as the origin, and finally obtain the basic grids of each target area. It is worth noting that the preset levels corresponding to different target areas can be the same or different, for example Figure 5 As shown, the preset level corresponding to the outer target area is the fifth level of the Beidou grid location code, and the preset level corresponding to the central target area is the sixth level of the Beidou grid location code.

[0037] It is understandable that limiting the target area can reduce the grid division and calculation of unnecessary areas, reduce the calculation pressure, reduce the interface load, and facilitate data management. In addition, the preset levels corresponding to different target areas can be the same or different, that is, the grid division accuracy of different target areas can be different. For example, target area A requires the fifth level of the Beidou grid location code, and target area B requires the eighth level of the Beidou grid location code. Then for target area B with high precision requirements, the eighth level corresponding division can be directly performed, and there is no need to divide it layer by layer, which further reduces unnecessary calculations and useless data.

[0038] Step 102, selecting reference points from grid intersection points of the basic grid, wherein the distance between two adjacent reference points is not greater than a first preset distance, and the first preset distance is determined based on a grid offset length of a preset level of a Beidou grid position code.

[0039] In the specific implementation, after obtaining the basic grid of the target map, the server can select reference points from the grid intersection points of the basic grid. It is worth noting that the distance between two adjacent reference points is not greater than the first preset distance determined by the grid offset length of the preset level based on the Beidou grid location code. The selection and setting of the reference points ensures that all reference points are established in the same basic grid system, fundamentally avoiding the intersection between Beidou grids. Even if overlap occurs, they can be perfectly spliced ​​and connected. The distance setting can ensure that each grid unit of the basic grid can be successfully encoded with the Beidou grid location code.

[0040] In one example, the preset level is the fifth level, and the grid offset length of the fifth level is 8 grids less than 1 km, that is, the length of one grid is required to be 128 m, then the first preset distance is set to 128×7=896 m, that is, the distance between two adjacent reference points shall not exceed 896 m.

[0041] Step 103, taking each reference point as the center, encode the Beidou grid location code according to the grid offset length of the preset level of the Beidou grid location code, and replace the grid code of each grid unit of the basic grid with the encoded Beidou grid location code to obtain the fused grid of the target map.

[0042] In a specific implementation, after selecting the reference points, the server can encode the Beidou grid location code with each reference point as the center according to the grid offset length of the preset level of the Beidou grid location code, and replace the grid code of each grid unit of the basic grid with the encoded Beidou grid location code to obtain the fused grid of the target map.

[0043] In one example, the server encodes the Beidou grid location code with each reference point as the center according to the grid offset length of the preset level of the Beidou grid location code, which can be done as follows: Figure 6 The steps shown in the figure are implemented, including:

[0044] Step 1031, traverse each reference point, determine the radiation area of ​​the current reference point on the target map according to the preset level of the Beidou grid location code, take the current reference point as the center, and divide the radiation area into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the Beidou grid of the radiation area.

[0045] In the specific implementation, after the server selects the reference point, it can traverse each reference point, determine the radiation area of ​​the current reference point on the target map according to the preset level of the Beidou grid location code, and divide the radiation area into grids based on the grid offset length of the preset level of the Beidou grid location code with the current reference point as the center to obtain the Beidou grid of the radiation area.

[0046] In an example, taking the fifth level as an example, the grid offset length of the fifth level is 8 grids, which is less than 1km, that is, the length of one grid is required to be 128m. The radiation area of ​​the reference point is 1792m×1792m. By gridding the radiation area, the Beidou grid of the radiation area can be obtained. The Beidou grid has a total of 196 grid units.

[0047] Step 1032, according to the coding rules of the Beidou grid location code, mark the Beidou grid location code for each grid cell in the Beidou grid of the radiation area, and after traversing all reference points, splice all Beidou grids to complete the Beidou grid location code coding of the target map.

[0048] In the specific implementation, the server marks the Beidou grid location code for each grid cell in the Beidou grid of the radiation area corresponding to the current reference point according to the encoding rules of the Beidou grid location code. After the server traverses all reference points, all Beidou grids (all Beidou grid location codes) can be spliced ​​to complete the Beidou grid location code encoding of the target map.

[0049] In one example, taking the fifth level as an example, Figure 6 As shown, for reference point A, according to the coding rules of the Beidou grid position code, the horizontal and vertical grid span codes are both 0 to 7 (reference point 0), A to G, and the Beidou grid position code of the first grid unit in the third quadrant of the Beidou grid is marked as reference point A-AA.

[0050] It is understandable that according to the coding rules of the Beidou grid location code, the radiation range of each reference point is limited. For each reference point, the Beidou grid corresponding to the radiation area can be divided, and then the Beidou grid location code encoding is performed separately. Since all reference points are established in the same basic grid system, all Beidou grids can be spliced ​​to complete the Beidou grid location code encoding of the target map.

[0051] In one example, if there is an overlapping area in the radiation area of ​​two adjacent reference points on the target map, only the Beidou grid location code of the overlapping area under one of the reference points is retained. For example, if reference point A-77 and reference point B-G7 overlap, then the server only needs to retain reference point A-77. The existence of overlapping areas is inevitable, but the grid unit lengths of the basic grid and the Beidou grid are the same, and all reference points are built on the same basic grid system. The overlapping areas are just repeated, and there is no grid interlacing. At this time, the Beidou grid location code under one of the reference points can be retained to ensure that the Beidou grid location code of the grid unit is single and unique.

[0052] based on Figure 3 and Figure 6 It can be seen that the benchmark point and reference point A are the same point. Then the grid code of the grid cell with the grid code (1,1) in the basic grid will be replaced by the Beidou grid location code "reference point A-11", and the grid code of the grid cell with the grid code (8,6) will be replaced by the Beidou grid location code "reference point B-G6".

[0053] In this embodiment, the map slicing function is integrated with the Beidou grid location code, and the basic grid of the target map obtained by slicing the digital map software is used as a bridge. A reference point is selected in the grid intersection of the basic grid to encode the Beidou grid location code, and the efficient conversion between the grid code and the Beidou grid location code is realized to obtain the fused grid of the target map. This greatly reduces the manpower required for grid calculation and division. There is no need for staff to go to the park for on-site manual measurement and division, nor is there a need to perform tedious switching calculations to divide the range of the grid through longitude and latitude. By using the slicing function of the digital map software, only a reference point is established as the origin to efficiently and accurately divide the park into grids, which greatly saves resource investment. Reference points are selected from the grid intersection points of the basic grid. All reference points are established in the same basic grid system, which fundamentally avoids the intersection of Beidou grids. Even if overlap occurs, they can be perfectly spliced ​​and connected, which is more convenient for overall management. The distance between two adjacent reference points is set to be no greater than the grid offset length of the preset level based on the Beidou grid location code to determine the first preset distance. This can ensure that every grid unit of the basic grid can be successfully encoded with the Beidou grid location code, reducing the complexity of map coding and the computing power required for map coding, thereby maximizing the advantages of the Beidou grid location code.

[0054] In one embodiment, the server selects a reference point on the target map, uses the slicing function of the digital map software, takes the reference point as the origin, and divides the target map into grids based on the grid offset length of the preset level of the Beidou grid location code. When obtaining the basic grid of the target map, the upper left corner point of the target map can be selected as the reference point, and the reference division length is determined according to the grid offset length of the preset level of the Beidou grid location code. The slicing function of the digital map software is used to take the reference point as the origin, and the target map is grid-divided from left to right and from top to bottom according to the reference division length to obtain the basic grid of the target map. If, when performing grid division, the remaining length of the divided area compared to the right boundary and the lower boundary of the target map is less than the reference division length, the server generates a corresponding blank area to fill the target map, so that the remaining length of the divided area compared to the right boundary and the lower boundary of the target map is equal to the reference division length. The upper left corner of the target map is selected as the reference point to make the entire map encoding process more standardized and normative. Since the width and height of the target map may not be divisible by the reference division length, for the right and lower boundaries of the target map, if the remaining length is less than the reference division length, a blank area is automatically generated to fill the gap to ensure that the size of each grid unit is the same, which is convenient for subsequent fusion with the Beidou grid location code.

[0055] In one example, taking the fifth level as an example, when the server selects reference points from the grid intersection points of the basic grid, the grid intersection points of the 7nth row and the 7mth column of the basic grid can be selected as reference points. Where n and m are both integers greater than 0, and it is ensured that 7n is not greater than N, and 7m is not greater than M, N is the total number of rows of the basic grid, and M is the total number of columns of the basic grid.

[0056] The step division of the above methods is only for the purpose of clear description. When implemented, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs without changing the core design of the algorithm and process are all within the scope of protection of this patent.

[0057] To sum up, the map coding method proposed in this application, which integrates map slicing function and Beidou grid location code, aims to solve the following technical problems and achieve the following technical effects.

[0058] First, efficiently solve the grid division problem of the park map.

[0059] The traditional park map grid division method, when the entire park is gridded, first of all, it is necessary to conduct on-site positioning and mapping of the entire park, map the specific location of the entire park and the longitude and latitude span, etc., and then perform manual grid division calculations, and the technicians calculate the longitude and latitude of each grid. In this way, the early grid division requires a lot of manpower and material resources, and the resource consumption is relatively large. The map coding method proposed in this application, which integrates the map slicing function and the Beidou grid location code, uses the map slicing tool for division. It only needs to map the longitude and latitude of a point. Then, according to the map slicing tool, the park can be directly divided into grids with this surveying point as the origin, and the longitude and latitude range of the grid does not need to be calculated by the technicians, which greatly reduces the complexity of the early map survey grid division.

[0060] Second, fundamentally solve the problem of overlapping and interlacing grid units.

[0061] If you randomly select reference points to encode Beidou grid location codes, grids will inevitably be nested, overlapped, and interlaced when grids are divided with different reference points. However, this application nests all reference points in the already divided basic grid system, which reasonably avoids the problems of grid overlap and regional omissions. It is also convenient for the unified management of Beidou grid location codes. If changes or additions to reference points are involved, there is no need to add repeated grid calculation and division steps, and the grid code correspondence can be directly replaced.

[0062] Third, solve the problem of insufficient precision.

[0063] Using third-party map software for basic grid division is more in line with the demand for high precision, and its accuracy and precision far exceed manual survey and manual division calculation of the target map.

[0064] Another embodiment of the present application proposes a map coding system integrating a map slicing function and a Beidou grid location code. The details of the map coding system integrating a map slicing function and a Beidou grid location code proposed in this embodiment are specifically described below. The following content is only for the convenience of understanding the implementation details provided, and is not necessary for the implementation of this example. Figure 8 : is a schematic diagram of a map coding system integrating a map slicing function and a Beidou grid location code proposed in this embodiment, including:

[0065] The basic grid segmentation module 201 is used to select a reference point on the target map, use the slicing function of the digital map software, take the reference point as the origin, and divide the target map into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the basic grid of the target map; wherein each grid unit of the basic grid is marked with a unique grid code.

[0066] The reference point selection module 202 is used to select reference points from the grid intersection points of the basic grid, and the distance between two adjacent reference points is not greater than a first preset distance, which is determined based on the grid offset length of a preset level of the Beidou grid position code.

[0067] The Beidou grid location code encoding module 203 is used to encode the Beidou grid location code according to the grid offset length of the preset level of the Beidou grid location code, with each reference point as the center.

[0068] The fusion module 204 is used to replace the grid code of each grid unit of the basic grid with the encoded Beidou grid position code to obtain a fused grid of the target map.

[0069] It is not difficult to find that this embodiment is a system embodiment corresponding to the above method embodiment, and this embodiment can be implemented in conjunction with the above method embodiment. The relevant technical details and technical effects mentioned in the above embodiments are still valid in this embodiment, and in order to reduce repetition, they are not repeated here. Accordingly, the relevant technical details mentioned in this embodiment can also be applied in the above embodiments.

[0070] It is worth mentioning that all modules involved in this embodiment are logic modules. In practical applications, a logic unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. In addition, in order to highlight the innovative part of this application, this embodiment does not introduce units that are not closely related to solving the technical problems proposed by this application, but this does not mean that there are no other units in this embodiment.

[0071] Another embodiment of the present application relates to an electronic device, such as Fig. 9 As shown, it includes: at least one processor 301; and a memory 302 that is communicatively connected to the at least one processor 301; wherein the memory 302 stores instructions that can be executed by the at least one processor 301, and the instructions are executed by the at least one processor 301 so that the at least one processor 301 can execute the map encoding method of the fusion map slicing function and Beidou grid location code in the above-mentioned embodiments.

[0072] Among them, the memory and the processor are connected in a bus manner, and the bus may include any number of interconnected buses and bridges, and the bus connects various circuits of one or more processors and memories together. The bus can also connect various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface between the bus and the transceiver. The transceiver can be one element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices on a transmission medium. The data processed by the processor is transmitted on a wireless medium via an antenna, and further, the antenna also receives data and transmits the data to the processor.

[0073] The processor is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management, and other control functions. Memory can be used to store data used by the processor when performing operations.

[0074] Another embodiment of the present application relates to a computer-readable storage medium storing a computer program, which implements the above method embodiment when executed by a processor.

[0075] That is, those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium, including a number of instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, ROM (Read-Only Memory), RAM (Random Access Memory), disk or optical disk and other media that can store program codes.

[0076] Those skilled in the art will appreciate that the above embodiments are specific embodiments for implementing the present application, and in actual applications, various changes may be made thereto in form and detail without departing from the spirit and scope of the present application.

Claims

1. A map coding method integrating map slicing function and Beidou grid location code, characterized in that: include: A reference point is selected on the target map, and the target map is gridded by using the slicing function of the digital map software, taking the reference point as the origin and based on the grid offset length of the preset level of the Beidou grid position code, to obtain a basic grid of the target map; wherein each grid unit in the basic grid is marked with a unique grid code; Selecting reference points among the grid intersection points of the basic grid, where the distance between two adjacent reference points is no greater than a first preset distance, where the first preset distance is determined based on a grid offset length of a preset level of the Beidou grid position code; Taking each of the reference points as the center, respectively, Beidou grid position code encoding is performed according to the grid offset length of the preset level of the Beidou grid position code, and the grid code of each grid unit of the basic grid is replaced with the Beidou grid position code obtained by encoding, so as to obtain the fused grid of the target map; The Beidou grid position code encoding is performed with each of the reference points as the center according to the grid offset length of the preset level of the Beidou grid position code, including: Traversing each of the reference points, determining the radiation area of ​​the current reference point on the target map according to the preset level of the Beidou grid location code, taking the current reference point as the center, and dividing the radiation area into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the Beidou grid of the radiation area; According to the coding rule of the Beidou grid position code, each grid cell in the Beidou grid of the radiation area is marked with a Beidou grid position code, and after traversing all reference points, all Beidou grids are spliced ​​to complete the Beidou grid position code coding of the target map; If there is an overlapping area in the radiation areas of two adjacent reference points on the target map, only the Beidou grid position code of the overlapping area under one of the reference points is retained.

2. The map encoding method integrating map slicing function and Beidou grid location code according to claim 1, characterized in that: A reference point is selected on the target map, and the slicing function of the digital map software is used to grid the target map based on the grid offset length of the preset level of the Beidou grid location code with the reference point as the origin to obtain the basic grid of the target map, including: The upper left corner point of the target map is selected as the reference point, and the reference division length is determined according to the grid offset length of the preset level of the Beidou grid position code; Using the slicing function of the digital map software, taking the reference point as the origin, the target map is grid-divided from left to right and from top to bottom according to the reference division length to obtain a basic grid of the target map; Among them, if, when performing grid division, the remaining length of the divided area compared to the right boundary and the lower boundary of the target map is less than the benchmark division length, a corresponding blank area is generated to fill the target map so that the remaining length of the divided area compared to the right boundary and the lower boundary of the target map is equal to the benchmark division length.

3. The map encoding method integrating map slicing function and Beidou grid location code according to claim 2, characterized in that: The preset level is the fifth level, and the selecting reference points from the grid intersection points of the basic grid includes: selecting each grid intersection point of the 7nth row and the 7mth column of the basic grid as a reference point; wherein n and m are both integers greater than 0, and it is ensured that 7n is not greater than N, 7m is not greater than M, N is the total number of rows of the basic grid, and M is the total number of columns of the basic grid.

4. The map coding method integrating the map slicing function and the Beidou grid location code according to any one of claims 1 to 2, characterized in that: The method comprises: selecting a reference point on the target map, using the slicing function of the digital map software, taking the reference point as the origin, and dividing the target map into grids based on the grid offset length of the preset level of the Beidou grid position code to obtain the basic grid of the target map, including: Delineating a target area in the target map; wherein the number of the target area is at least 1; A reference point is selected on the target area, and the slicing function of the digital map software is used to grid the target area with the reference point as the origin and based on the grid offset length of the preset level of the Beidou grid position code, so as to obtain the basic grid of the target area; wherein the preset levels corresponding to different target areas may be the same or different.

5. A map coding system integrating map slicing function and Beidou grid location code, characterized in that: include: A basic grid segmentation module is used to select a reference point on the target map, use the slicing function of the digital map software, take the reference point as the origin, and divide the target map into grids based on the grid offset length of the preset level of the Beidou grid position code to obtain the basic grid of the target map; wherein each grid unit of the basic grid is marked with a unique grid code; A reference point selection module, configured to select a reference point from among the grid intersection points of the basic grid, wherein the distance between two adjacent reference points is not greater than a first preset distance, wherein the first preset distance is determined based on a grid offset length of a preset level of the Beidou grid position code; A Beidou grid location code encoding module, used for encoding the Beidou grid location code according to the grid offset length of the preset level of the Beidou grid location code, with each of the reference points as the center; A fusion module, used to replace the grid code of each grid unit of the basic grid with the Beidou grid position code obtained by encoding, so as to obtain a fused grid of the target map; The Beidou grid position code encoding is performed with each of the reference points as the center according to the grid offset length of the preset level of the Beidou grid position code, including: Traversing each of the reference points, determining the radiation area of ​​the current reference point on the target map according to the preset level of the Beidou grid location code, taking the current reference point as the center, and dividing the radiation area into grids based on the grid offset length of the preset level of the Beidou grid location code to obtain the Beidou grid of the radiation area; According to the coding rule of the Beidou grid position code, each grid cell in the Beidou grid of the radiation area is marked with a Beidou grid position code, and after traversing all reference points, all Beidou grids are spliced ​​to complete the Beidou grid position code coding of the target map; If there is an overlapping area in the radiation areas of two adjacent reference points on the target map, only the Beidou grid position code of the overlapping area under one of the reference points is retained.

6. An electronic device, characterized in that: include: at least one processor; and, a memory communicatively coupled to the at least one processor; In which, the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the map encoding method of the fusion map slicing function and Beidou grid location code as described in any one of claims 1 to 4.

7. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the map encoding method of the fused map slicing function and the Beidou grid location code as described in any one of claims 1 to 4 is implemented.

Images