Method and system for encoding the earth surface based on multi-iterative grid partitioning

Abstract

The present invention provides a coding method for dividing the Earth's surface using a multi-level iterative grid system. This method includes: first-level segmentation of the Earth's surface according to a set reference unit span, obtaining latitude and longitude reference number intervals; constructing a first-level regional code based on the latitude and longitude reference number intervals, and then obtaining regional codes through further subdivision and iteration of these intervals; based on the first-level regional code and a set direction identifier, obtaining a single-direction boundary identifier code through further subdivision and iteration of the latitude or longitude reference number intervals, and defining a unique boundary identifier code to represent a geographical boundary. The beneficial effects are: based on the original regional positioning function, the expression method is closer to machine language, forming a unified, scalable, and easily computed coding system.

Description

Technical Field

[0001] This invention belongs to the field of communication and information technology, and in particular relates to a coding method and system for dividing the Earth's surface based on multi-level iterative gridding. Background Technology

[0002] Currently, the globally accepted positioning method is latitude and longitude positioning, which relies on degrees, minutes, seconds, or multiple systems for identification. Its expression depends on letters (N / S / E / W) to distinguish hemispheres, and the calculation logic involves angle conversion, making it difficult for non-professionals to quickly understand and remember. Furthermore, in simple positioning scenarios (such as coarse navigation and area identification), latitude and longitude expressions are redundant, while in high-precision positioning scenarios, they need to be extended to multiple decimal places, resulting in insufficient flexibility. In addition, existing positioning methods lack a unified and concise coding rule for identifying unidirectional geographical boundaries (such as specific latitude lines or longitude lines), requiring specific angle numerical descriptions, which cannot form a unified logic with regional coding. Some existing regional positioning coding methods lack a globally unified iterative expansion logic, failing to meet the needs of both coarse and precise positioning, and also struggling to adapt to the concise identification of unidirectional boundaries. Therefore, there is an urgent need for a global positioning method that is structurally simple, logically unified, iteratively expandable, easy to remember and use, and capable of covering both regional positioning and boundary identification. Summary of the Invention

[0003] To address the shortcomings and challenges in the aforementioned background technology, this invention provides a coding method and system for dividing the Earth's surface using a multi-level iterative gridding approach, specifically implemented through the following technical solutions: The encoding method based on multi-level iterative gridding of the Earth's surface includes: The Earth's surface is divided into primary blocks based on the established reference unit span, resulting in latitude reference number intervals and longitude reference number intervals. A first-level regional code is constructed based on the latitude and longitude reference number intervals, and then the regional code is obtained by further subdividing and iterating the latitude and longitude reference number intervals. Based on the primary regional code and the set directional identifier, the single-direction boundary identifier code is obtained by further subdividing and iterating the latitude or longitude reference number interval, and a unique boundary identifier code is set to represent a geographical boundary.

[0004] A further design of the coding method based on multi-level iterative gridding of the Earth's surface is that the first-level block division is as follows: the latitude direction is evenly divided into n blocks from the North Pole to the South Pole, and numbered according to the sequence number from 0 to n-1 to form a latitude reference numbering interval; the longitude direction is evenly divided into n blocks eastward from the Prime Meridian, and numbered according to the sequence number from 0 to n-1 to form a longitude reference numbering interval.

[0005] A further design of the coding method based on multi-level iterative gridding of the Earth's surface is as follows: the region coding generation is specifically as follows: set the latitude reference number as the high digit and the longitude reference number as the low digit, and combine them to form a first-level region coding; take the block corresponding to any first-level region coding as the basic unit, and repeatedly perform iterative subdivision operation, specifically: divide the latitude interval into n equal parts and the longitude interval into n equal parts, and form a coding group by the latitude sub-region number and longitude sub-block number of each level of subdivision according to the rule of latitude first and longitude last, and then concatenate them to the end of the region coding of that level according to the iteration order to form a 2×m-bit m-level region coding, where m is the number of iteration subdivisions.

[0006] A further design of the coding method based on multi-level iterative gridding of the Earth's surface is as follows: Single-direction boundary identification coding: Select a preset letter as the direction identifier, perform n equal division iterative subdivision only in the single direction of latitude or longitude, obtain the iterative subdivision number, use the direction identifier letter as the prefix, and connect the iterative subdivision number of the single direction with the corresponding region number as the suffix to form an m-bit m-level boundary identification code of identifier and number combination, where m is the number of iterative subdivisions.

[0007] A further design of the encoding method based on multi-base iterative gridding of the Earth's surface is that the identifier is a set character.

[0008] A further design of the coding method based on multi-base iterative gridding of the Earth's surface is that the region coding also includes a height coding segment, which is continued at the end of the region coding by a separator.

[0009] A further design of the coding method based on multi-level iterative gridding of the Earth's surface is that the height coding segment is obtained by subdividing and iteratively subdividing the height reference number interval; the generation of the height reference number interval is specifically as follows: the surface height direction is uniformly divided into n blocks according to the set range interval [L, H], and numbered according to the sequence number from 0 to n-1; the subdivision and iterative process of the height coding segment is specifically as follows: taking the height interval corresponding to any level of region coding as the basic unit, performing a block division operation of n equal parts, repeatedly performing the iterative subdivision operation, and sequentially splicing the height sub-region numbers of each level of subdivision to form the height coding segment.

[0010] The present invention also provides an encoding system for an encoding method, the system comprising: The block encoding module is used to perform first-level region encoding generation; The iterative subdivision module performs multi-level sub-interval n equal division and encoding splicing to form m-level region encoding or m-level boundary identification encoding; The location mapping module is used to map the region code to a unique region on the Earth's surface; The boundary identification module is used to encode and represent the geographical boundaries corresponding to the Earth's surface using unique boundary identifiers. The account binding module is used to bind accounts to corresponding regions and boundaries by using globally unique regional codes and boundary identification codes as unique accounts. It supports account identification, information association, and scenario-based applications.

[0011] The present invention also provides a digital map service system based on the aforementioned encoding method, in which location information is expressed through regional encoding; longitude and latitude lines are expressed through unidirectional boundary marker encoding; and longitude and latitude boundaries are expressed through geographic boundaries.

[0012] The present invention also provides a navigation method based on the aforementioned encoding method, in which the positioning information of vehicles and locations is expressed through area encoding.

[0013] This invention also provides another encoding method based on multi-level iterative gridding of the Earth's surface, the method comprising: The Earth's surface space is divided into primary blocks based on the established benchmark unit span, resulting in latitude benchmark numbering intervals, longitude benchmark numbering intervals, and altitude benchmark numbering intervals. A first-level three-dimensional region code is constructed based on the latitude reference number interval, longitude reference number interval, and altitude reference number interval. Then, the three-dimensional region code is obtained by further subdividing and iterating the latitude reference number interval, longitude reference number interval, and altitude reference number interval.

[0014] Based on the first-level three-dimensional region coding and the set direction identifier, the single-direction boundary identifier code is obtained by further subdividing and iterating the latitude benchmark numbering interval, longitude benchmark numbering interval, or altitude benchmark numbering interval, and a unique boundary identifier code is set to represent a geographic boundary.

[0015] A further design of the coding method based on multi-level iterative gridding of the Earth's surface is that the first-level block division is as follows: the latitudinal direction is evenly divided into n blocks from the North Pole to the South Pole, and numbered according to the sequence number from 0 to n-1 to form a latitudinal reference numbering interval; the longitude direction is evenly divided into n blocks eastward from the Prime Meridian, and numbered according to the sequence number from 0 to n-1 to form a longitude reference numbering interval; the altitude direction is evenly divided into n blocks according to the set range interval [L, H], and numbered according to the sequence number from 0 to n-1 to form an altitude reference numbering interval. The specific process for generating a 3D region code is as follows: Latitude reference number is set as the high digit, longitude reference number as the middle digit, and altitude reference number as the low digit, combining them to form a three-digit first-level 3D region code. Using any block corresponding to a first-level 3D region code as the basic unit, iterative subdivision operations are repeatedly performed. Specifically, the latitude interval is divided into n equal parts, the longitude interval into n equal parts, and the altitude interval into n equal parts. The latitude sub-region number, longitude sub-block number, and altitude sub-block number of each subdivision are grouped according to the rule of latitude first, longitude second, and altitude last, and then sequentially concatenated at the end of the 3D region code according to the iteration order, forming a 3×m-bit m-level 3D region code, where m is the number of iterations.

[0016] The encoding method of this invention is based on the original regional positioning function, which is closer to machine language. This makes it easier for mobile terminals to preprocess or directly calculate location information for localized processing. It strengthens edge computing capabilities and thus helps to promote computing decentralization when the method is actually applied to the field of digital communication related to location information. It effectively reduces the cloud load and optimizes the allocation of cloud resources.

[0017] The geographic boundary identification function of the encoding method of this invention forms a unified, scalable, and easily computed encoding system through a concise encoding form of identifiers and numbers. It achieves accurate identification of global regions and geographic boundaries without using special identifiers, punctuation, or multi-dimensional units of measurement, and the encoding logic remains consistent with regional positioning, requiring no additional learning cost. Furthermore, the number of digits can be flexibly adjusted to meet the needs of boundary labeling with different precision, further expanding the application scenarios of the method. It can be adapted to communication technology fields such as digital maps, location services, and the Internet of Things, as well as traditional technology fields such as geography teaching, map drawing, boundary delineation, and regional management. Moreover, both the regional code and the boundary identifier code are globally unique and can be directly used as unique accounts, adapting to needs such as geographic information association and location-based identity identification, significantly enhancing its practical and promotional value.

[0018] The encoding method provided by this invention can be further extended to spatial regions on the Earth's surface, unifying the expression of one-dimensional boundaries (W / J / H), two-dimensional grids (purely numerical), and three-dimensional points (purely numerical alternating recursion or combinations of separators), forming a complete system from lines to surfaces to volumes, facilitating the unified management and exchange of various types of spatial data. The pure numerical alternating recursive three-dimensional encoding of this method can be directly stored as a BIGINT type in a relational database, occupying 8 bytes of storage space, far less than string types (typically 20 bytes or more). The comparison, sorting, and indexing performance of integer data is far superior to that of strings, with B-Tree indexing showing the best efficiency. Purely numerical encoding saves more than 50% of storage space, allowing more data records to be cached with the same amount of memory, significantly improving the overall system performance. Attached Figure Description

[0019] Figure 1 This is a block-based iterative diagram of the coding method for dividing the Earth's surface based on multi-level iterative gridding according to the present invention (the figure is a unfolded planar view of the Earth).

[0020] Figure 2 A schematic diagram of the representation of m-level region encoding (in the figure, G represents the high bit of the corresponding coding group; in the figure, D represents the low bit of the corresponding coding group).

[0021] Figure 3 A schematic diagram illustrating the encoding of m-level unidirectional boundary markers.

[0022] Figure 4 A schematic diagram illustrating the representation of m-level three-dimensional region encoding.

[0023] The diagram illustrates the following: 1- Primary region code; 2- Secondary region code group; 3-m-level region code group; 4- Identifier; 5- Primary longitude datum number; 6- Secondary iterative subdivision number; 7-m-level iterative subdivision number; 8- Primary 3D region code; 9-m-level 3D region code group; 10- Primary altitude datum number. Detailed Implementation

[0024] The following will refer to the appendices in the embodiments of the present invention. Figures 1-3 The technical solutions in the embodiments of the present invention will be clearly and completely described. Example 1

[0025] The encoding method for dividing the Earth's surface based on multi-level iterative gridding in this embodiment includes: First-level segmentation: The Earth's surface is segmented into first-level segments based on the set reference unit span to obtain latitude reference number intervals and longitude reference number intervals.

[0026] Regional code generation: A first-level regional code is constructed based on the latitude and longitude reference number intervals. Then, the regional code is obtained by further subdividing and iterating the latitude and longitude reference number intervals.

[0027] Unidirectional boundary identification coding and geographic boundary representation: Based on the primary regional coding and the set directional identifier, the unidirectional boundary identification code is obtained by further subdividing and iterating the latitude or longitude reference number interval, and a geographic boundary is represented by a unique boundary identification code. Example 2

[0028] like Figure 1In this embodiment, based on Embodiment 1, the first-level segmentation is as follows: In the latitudinal direction, the area from the North Pole to the South Pole is evenly divided into n blocks, numbered from 0 to n-1 to form a latitudinal reference numbering interval; in the longitude direction, the area from the Prime Meridian eastward is evenly divided into n blocks, numbered from 0 to n-1 to form a longitude reference numbering interval. In this embodiment and subsequent embodiments, n=10 is set.

[0029] Taking the first-level block (2-bit code) as an example: latitude 0-9 corresponds to 90°N-72°N to 72°S-90°S (18° per block), longitude 0-9 corresponds to 0°-36°E to 324°E-0° (36° per block), and code 00 corresponds to 90°N-72°N and 0°-36°E; In this embodiment, the generation process of the regional code is as follows: The latitude reference number is set as the high digit and the longitude reference number as the low digit, and these are combined to form a first-level regional code. The range of the first-level regional code is 00 to 99. Using any block corresponding to the first-level regional code as the basic unit, the iterative subdivision operation is repeatedly performed. Specifically, the latitude interval is divided into n equal parts, and the longitude interval is divided into n equal parts. The latitude sub-region number and longitude sub-block number of each subdivision are grouped according to the rule of latitude first (high digit) and longitude last (low digit). Then, they are sequentially concatenated to the end of the regional code according to the iteration order to form a 2×m-bit m-level regional code, where m is the number of iterations. See [link to relevant documentation]. Figure 2 When m=5, the encoding is 0000000000-9999999999.

[0030] Taking a two-level block (4-bit code) as an example: After the primary code 00 is subdivided, latitude 0-9 corresponds to 90°N-88.2°N to 72°N-73.8° (1.8° per block), and longitude 0-9 corresponds to 0°-3.6°E to 32.4°E-36°E (3.6° per block). Code 0000 corresponds to 90°N-88.2°N and 0°-3.6°E. Figure 1 ( Figure 1 (This is a schematic diagram of a two-level block structure). The second-level region code of point A in the diagram is 4104.

[0031] In this embodiment, the single-direction boundary identifier encoding generation process is as follows: A preset letter is selected as the direction identifier; only the latitude or longitude direction is subjected to n equal divisions in an iterative subdivision process to obtain an iterative subdivision number; the direction identifier letter is used as a prefix, and the iterative subdivision number for the single direction is followed by the corresponding region number as a suffix, forming an m-bit, m-level single-direction boundary identifier code that combines the identifier and the number, where m is the number of iterative subdivisions. See [link to documentation]. Figure 3 .

[0032] The identifier is a predefined character. In this embodiment, longitude is set to J and latitude to W, which can be quickly identified by both professionals and non-professionals. Alternatively, latitude can be represented by the letter "L" and longitude by the letter "D," but this will not be elaborated upon in this embodiment.

[0033] Taking the 18°N latitude line (latitude direction boundary) as an example: Calculation of the 18°N latitude line: 18°N latitude is located 72° south of the North Pole (90°N-18°N=72°), corresponding to the first-level block number 3 (first-level block number 3 corresponds to 36°N-18°N). Iterative subdivision coding: Continue iterating on the latitude interval (36°N-18°N) corresponding to the first-level number 3, subdividing by 10 times at each level, until the target accuracy is reached. Finally, the 18°N latitude line corresponds to the critical value of the iterative sequence in the latitude direction. The code corresponding to the subdivision of the latitude direction through the 3rd, 9th, 9th, 9th, 9th levels is "W399999" (6 iterations, accuracy reaches 180° / 10^6=0.00018°) or "W400000". The more digits, the higher the boundary accuracy.

[0034] Taking the longitude-direction block logic as an example, the boundary accuracy is as follows: the total span of the prime meridian (0°) eastward is 360°. When n=10, each block of the first level is 36°, each block of the second level is 3.6°, each block of the third level is 0.36°, each block of the fourth level is 0.036°, and so on. After m iterations, the span of a single block in the longitude direction is 360° / 10^m, see Table 1. For example: Calculation of the 108°E line: 108°E corresponds to the first-level block number 3 (first-level block number 3 corresponds to 108°E-144°E); Iterative subdivision coding: Continue to iterate on the longitude interval (108°E-144°E) corresponding to the first-level number 3, subdividing it by 10 times at each level. Finally, the 108°E line corresponds to the critical value of the iterative sequence in the longitude direction. The code corresponding to the 2nd, 9th, 9th, 9th, 9th subdivision in the longitude direction is "J299999" (6 iterations, accuracy reaches 360° / 10^6=0.00036°) or "J300000".

[0035] The number of iterations in this embodiment can be adjusted according to the accuracy requirements. For example, the longitude interval (108°E-144°E) corresponding to the first-level number 3 can be iterated again, with each level subdivided by 10 times. Finally, the critical value of the iteration sequence corresponding to the 108°E line is encoded as "J39999999" (8 iterations, accuracy reaches 360° / 10^8=0.0000036°) or "J40000000". The number of digits can be flexibly adjusted according to the accuracy requirements. Example 3

[0036] This embodiment provides an encoding system based on an encoding method, which mainly consists of a block encoding module, an iterative subdivision module, a positioning mapping module, a boundary identification module, and an account binding module.

[0037] The block coding module generates first-level regional codes. The iterative subdivision module divides multi-level latitude and longitude sub-intervals into n equal parts and splices the codes to form m-level regional codes or m-level boundary identification codes. The positioning mapping module maps the regional codes to unique regions on the Earth's surface. The boundary identification module uses unique boundary identification codes to represent the corresponding geographical boundaries on the Earth's surface. The account binding module uses globally unique regional codes and boundary identification codes as unique accounts to bind accounts to corresponding regions and boundaries, supporting account identification, information association, and scenario-based applications. Example 4

[0038] This embodiment provides a digital map service system based on an encoding method, in which the location information of a place is expressed through regional encoding; longitude and latitude lines are expressed through unidirectional boundary marker encoding; and longitude and latitude boundaries are expressed through geographic boundaries. Example 5

[0039] This embodiment provides a navigation method based on an encoding method, in which the positioning information of vehicles and locations is expressed through area encoding. This navigation method employs the positioning information encoding method of this invention, which is simple, has a small data footprint, improves data transmission efficiency, and accelerates navigation response. Furthermore, the encoding method of this invention is closer to machine language, facilitating localized preprocessing or direct calculation of location information on mobile devices. This strengthens edge computing capabilities, promotes computational decentralization, effectively reduces cloud load, and optimizes cloud resource allocation. Example 6

[0040] Compared to the technical solution in prior art 1, the encoding method for dividing the Earth's surface based on multi-level iterative gridding in this embodiment incorporates the height encoding segment into the original three-dimensional region encoding using the same recursive iterative method, forming a three-dimensional region encoding for expressing three-dimensional spatial location. Specifically: The Earth's surface space is divided into primary blocks based on the established benchmark unit span, resulting in latitude benchmark numbering intervals, longitude benchmark numbering intervals, and altitude benchmark numbering intervals. A first-level three-dimensional region code is constructed based on the latitude reference number interval, longitude reference number interval, and altitude reference number interval. Then, the three-dimensional region code is obtained by further subdividing and iterating the latitude reference number interval, longitude reference number interval, and altitude reference number interval.

[0041] Based on the primary three-dimensional region coding and the established direction identifiers, a single-direction boundary identifier code is obtained through further subdivision and iteration of the latitude benchmark numbering interval, longitude benchmark numbering interval, or altitude benchmark numbering interval. A unique boundary identifier code is then used to represent a geographic boundary. In this embodiment, the altitude boundary identifier is represented by H. For example, in [L, H] corresponding to [0, 10000M], H2568 corresponds to an altitude layer of 2568 meters.

[0042] In this embodiment, the first-level segmentation is as follows: the latitudinal direction is evenly divided into n blocks from the North Pole to the South Pole, and numbered according to the sequence number from 0 to n-1 to form the latitude reference numbering interval; the longitude direction is evenly divided into n blocks eastward from the Prime Meridian, and numbered according to the sequence number from 0 to n-1 to form the longitude reference numbering interval; the altitude direction is evenly divided into n blocks according to the set range interval [L, H], and numbered according to the sequence number from 0 to n-1 to form the altitude reference numbering interval.

[0043] The specific process for generating a 3D region code is as follows: Latitude reference number is set as the high digit, longitude reference number as the middle digit, and altitude reference number as the low digit, combining them to form a three-digit first-level 3D region code. Using any block corresponding to a first-level 3D region code as the basic unit, iterative subdivision operations are repeatedly performed. Specifically, the latitude interval is divided into n equal parts, the longitude interval into n equal parts, and the altitude interval into n equal parts. The latitude sub-region number, longitude sub-block number, and altitude sub-block number of each subdivision are grouped according to the rule of latitude first, longitude second, and altitude last, and then sequentially concatenated at the end of the 3D region code according to the iteration order, forming a 3×m-bit m-level 3D region code, where m is the number of iterations.

[0044] Taking a location at an altitude of 50 meters at a given two-dimensional region code of 321415678164 (ground location) as an example, the altitude code segment is 005000 (subdivided through 6 iterations). According to the coding method in this embodiment, the corresponding three-dimensional region code is 320140155670810640. The three-dimensional region code for a UAV at an altitude of 256 meters at this location is 320142155676810640. The three-dimensional region code for a weather station at an altitude of 3525 meters at this location is 323145152675810640. Similarly, for underground objects, only the range [L, H] needs to be adjusted; for example, setting L=-1000 and H=0.

[0045] The relative location information can be quickly obtained by subtracting the codes of the three same surface locations. This coding method has broad application prospects, such as: UAV path planning and airspace management, underground utility tunnel monitoring and management, and marine monitoring and environmental analysis.

[0046] The encoding method in this embodiment uses recursive logic, which is simple to calculate, has a clear hierarchy, and is controllable in precision, making it particularly suitable for computer processing.

[0047] Example 7

[0048] The encoding method for dividing the Earth's surface based on multi-level iterative gridding in this embodiment, on the basis of embodiment 2, adds a height encoding segment by using a separator at the end of the three-dimensional region encoding, and is mainly used for encoding three-dimensional spatial positions.

[0049] In this embodiment, the height coding segment is obtained by subdividing and iterating the height reference number interval. The generation of the height reference number interval is as follows: the ground surface height direction is uniformly divided into n blocks according to the set range interval [L, H], and numbered according to the sequence number from 0 to n-1; the subdivision and iteration process of the height coding segment is as follows: the height interval corresponding to any level of three-dimensional region coding is used as the basic unit, and the block operation is performed in n equal parts. The iterative subdivision operation is repeated, and the height sub-region numbers of each level of subdivision are sequentially spliced ​​to form the height coding segment.

[0050] In this embodiment, the measurement range [L, H] is set, where L represents the height of sea level, H is set to 10000M, and M represents the unit: meters; the separator is set to ".". Taking a location at an altitude of 50 meters with a defined surface location of 321415678164 as an example, the technical solution of this embodiment is expressed as 321415678164.0050 (the altitude encoding segment is subdivided and iterated only 4 times, and the number of iterations can be set according to the accuracy requirements). The three-dimensional region code of a UAV at an altitude of 256 meters at this surface location is 321415678164.0256. The three-dimensional region code of a weather station at an altitude of 3525 meters at this surface location is 321415678164.3525. In this embodiment, different separators can correspond to different measurement ranges. For example, the separator "." corresponds to the measurement range [0, 10000M]; the separator ".." corresponds to the measurement range (10000M, 100000M).

[0051] Compared to the technical solution of Embodiment 6, the number of iterations of the height encoding segment in this embodiment does not need to be consistent with the number of iterations of the two-dimensional region encoding. According to the set range or accuracy requirements, fewer character bits can be used to express the height position information, which can further reduce the amount of encoding storage and transmission data, and increase the efficiency of information storage and transmission.

[0052] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of the present invention, and these improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A coding method based on multi-base iterative gridding of the Earth's surface, characterized in that... include: The Earth's surface is divided into primary blocks based on the established reference unit span, resulting in latitude reference number intervals and longitude reference number intervals. A first-level regional code is constructed based on the latitude and longitude reference number intervals, and then the regional code is obtained by further subdividing and iterating the latitude and longitude reference number intervals. Based on the primary regional code and the set directional identifier, the single-direction boundary identifier code is obtained by further subdividing and iterating the latitude or longitude reference number interval, and a unique boundary identifier code is set to represent a geographical boundary.

2. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 1, characterized in that... The first-level division is as follows: in the latitudinal direction, the area from the North Pole to the South Pole is evenly divided into n blocks, and numbered according to the sequence number from 0 to n-1 to form the latitudinal reference numbering interval; in the longitude direction, the area from the Prime Meridian eastward is evenly divided into n blocks, and numbered according to the sequence number from 0 to n-1 to form the longitude reference numbering interval.

3. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 2, characterized in that... The specific process for generating the regional code is as follows: A latitude reference number is set as the high-order digit and a longitude reference number as the low-order digit, which are then combined to form a first-level regional code. The block corresponding to any first-level regional code is used as the basic unit, and iterative subdivision operations are repeatedly performed. Specifically, the latitude interval is divided into n equal parts, and the longitude interval is divided into n equal parts. The latitude sub-region number and longitude sub-block number of each subdivision are then grouped according to the rule of latitude first, longitude last, and then sequentially appended to the end of the regional code at that level according to the iteration order, forming a 2×m-bit m-level regional code, where m is the number of iterations.

4. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 2, characterized in that... Single-direction boundary identification code: Select a preset letter as the direction identifier, perform n equal division iterations only in the single direction of latitude or longitude to obtain the iteration subdivision number, use the direction identifier letter as the prefix, and connect the iteration subdivision number of the single direction with the corresponding area number as the suffix to form an m-digit m-level boundary identification code of identifier and number combination, where m is the number of iteration subdivisions.

5. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 1, characterized in that... The identifier is a set character.

6. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 1, characterized in that... The region code also includes a height code segment, which is appended to the end of the region code by a separator.

7. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 6, characterized in that... The height coding segment is obtained by subdividing and iterating the height reference number interval; the generation of the height reference number interval is specifically as follows: the surface height direction is uniformly divided into n blocks according to the set range interval [L, H], and numbered according to the sequence number from 0 to n-1; the subdivision and iteration process of the height coding segment is specifically as follows: taking the height interval corresponding to any level of region coding as the basic unit, performing a block division operation of n equal parts, repeatedly performing the iterative subdivision operation, and sequentially splicing the height sub-region numbers of each level of subdivision to form the height coding segment.

8. An encoding system based on the encoding method according to any one of claims 1-7, characterized in that... include: The block encoding module is used to perform first-level region encoding generation; The iterative subdivision module performs multi-level sub-interval n equal division and encoding splicing to form m-level region encoding or m-level boundary identification encoding; The location mapping module is used to map the region code to a unique region on the Earth's surface; The boundary identification module is used to encode and represent the geographical boundaries corresponding to the Earth's surface using unique boundary identifiers. The account binding module is used to bind accounts to corresponding regions and boundaries by using globally unique regional codes and boundary identification codes as unique accounts. It supports account identification, information association, and scenario-based applications.

9. A digital map service system based on the encoding method according to any one of claims 1-7, characterized in that... In this system, location information is expressed through regional codes; longitude and latitude lines are expressed through unidirectional boundary marker codes; and longitude and latitude boundaries are expressed through geographic boundaries.

10. A navigation method based on the encoding method according to any one of claims 1-7, characterized in that the positioning information of vehicles and locations in the method is expressed through area encoding.

11. A coding method based on multi-base iterative gridding of the Earth's surface, characterized in that... The method includes: The Earth's surface space is divided into primary blocks based on the established benchmark unit span, resulting in latitude benchmark numbering intervals, longitude benchmark numbering intervals, and altitude benchmark numbering intervals. A first-level three-dimensional region code is constructed based on the latitude reference number interval, longitude reference number interval, and altitude reference number interval. Then, the three-dimensional region code is obtained by further subdividing and iterating the latitude reference number interval, longitude reference number interval, and altitude reference number interval. Based on the first-level three-dimensional region coding and the set direction identifier, the single-direction boundary identifier code is obtained by further subdividing and iterating the latitude benchmark numbering interval, longitude benchmark numbering interval, or altitude benchmark numbering interval, and a unique boundary identifier code is set to represent a geographic boundary.

12. The coding method for dividing the Earth's surface based on multi-level iterative gridding according to claim 11, characterized in that... The first-level segmentation is as follows: Latitude is evenly divided into n blocks from the North Pole to the South Pole, and numbered from 0 to n-1 to form a latitude reference numbering interval; Longitude is evenly divided into n blocks eastward from the Prime Meridian, and numbered from 0 to n-1 to form a longitude reference numbering interval; Altitude is evenly divided into n blocks according to the set range interval [L, H], and numbered from 0 to n-1 to form an altitude reference numbering interval. The specific process for generating a 3D region code is as follows: Latitude reference number is set as the high digit, longitude reference number as the middle digit, and altitude reference number as the low digit, combining them to form a three-digit first-level 3D region code. Using any block corresponding to a first-level 3D region code as the basic unit, iterative subdivision operations are repeatedly performed. Specifically, the latitude interval is divided into n equal parts, the longitude interval into n equal parts, and the altitude interval into n equal parts. The latitude sub-region number, longitude sub-block number, and altitude sub-block number of each subdivision are grouped according to the rule of latitude first, longitude second, and altitude last, and then sequentially concatenated at the end of the 3D region code according to the iteration order, forming a 3×m-bit m-level 3D region code, where m is the number of iterations.

Images