A fast region generation method based on global grid

Abstract

The present invention discloses a method for rapidly generating regions based on a global grid. The method comprises constructing a global gridding model, dividing the global geographic space into grids, assigning each grid a unique code, and constructing an n-level global grid within the range of [-180, 180] in longitude and [-90, 90] in latitude. The method further comprises calculating regional location information, constructing regions using a certain level of grids as basic units, and calculating regional location information based on a set of "start and end points" input during regional planning. The method further comprises calculating the intersection of the grids between two regions, determining the type of the intersecting region based on the grids in the intersection, and calculating the location information of the intersecting region based on the type of the intersecting region. The method adopts a global gridding model with consistent regional planning standards; plans regions based on two points, is fast, and has simple interactions; and supports the standardized expression of airspace data, characterizing airspace data based on a unified and concise regional coding method, thereby improving the efficiency of airspace use and analysis.

Description

Technical Field

[0001] The present invention relates to the field of airspace planning in an airspace management system, and in particular to a method for rapidly generating regions based on a global grid. Background Art

[0002] With economic development, demand for air transport is rapidly increasing, and airspace is a crucial resource for supporting air transport. Currently, airspace planning is primarily based on longitude and latitude. An airspace consists of several longitude and latitude points. Planning requires entering these points point by point and carefully verifying the latitude and longitude values for each point. After planning is complete, vector analysis and manual assistance are used to determine whether the planned airspace conflicts with existing airspace. This approach struggles to meet the demands for rapid airspace adjustments and conflict resolution in situations such as air traffic control and route planning.

[0003] There are two main deficiencies in the airspace planning technology based on latitude and longitude: (1) When describing airspace based on latitude and longitude data, it is necessary to enter the coordinates of each latitude and longitude point in the airspace one by one, and at the same time, it is necessary to check whether the degrees, minutes and seconds of each latitude and longitude point are accurate, which takes a long time to enter and proofread the data; (2) The airspace planned based on latitude and longitude consists of a string of latitude and longitude point coordinates, and the data type is vector. When analyzing vector data, a large number of vector operations such as intersection and difference are involved, and the conflict resolution calculation time is long and the efficiency is low. Summary of the Invention

[0004] Purpose of the invention: The purpose of the present invention is to provide a method for rapid region generation based on a global grid, which is used to support the rapid generation of airspace, avoid the long-term entry and verification of airspace longitude and latitude information, represent airspace based on a unified and concise region code, reduce the calculation time of airspace intersection, and improve the efficiency of airspace analysis.

[0005] Technical solution: The present invention comprises the following steps:

[0006] (1) Construct a global gridding model to divide the global geographic space into grids. Each grid is assigned a unique code with a longitude range of [-180, 180] and a latitude range of [-90, 90]. Within this range, an n-level global grid is constructed.

[0007] (2) Calculate regional location information. A region is constructed using a certain level of grid as the basic unit. It is divided into single-selection regions, continuous regions, frame-selection regions, and combined regions. A region is determined based on two points. The regional location information is calculated based on the set of “start and end points” input during the regional planning process.

[0008] (3) Calculate the intersection of the grids between the two areas, determine the type of the intersection area based on the grids in the intersection, and calculate the location information of the intersection area based on the intersection area type.

[0009] Furthermore, the step (1) of constructing the n-level global grid includes the following steps:

[0010] (1.1) Global multi-level grid division;

[0011] (1.2) Global multi-level grid coding.

[0012] Furthermore, the step (1.1) includes the following steps:

[0013] (1.1.1) Level 1 grid division: Longitude is divided counterclockwise from -180 to 180 at intervals of J1 seconds. The number of columns of the global Level 1 grid is 360*3600 / J1=R. Latitude is divided north and south from the equator at intervals of W1 seconds. The number of rows of the Level 1 grid in the northern and southern hemispheres is 90*3600 / W1=T, where T is an integer greater than 1.

[0014] (1.1.2) The nth level grid division, the longitude interval is J n Seconds, latitude interval is W n seconds, where J n >=1,W n >=1,J n-1 / J n = N n And J n-1 %J n =0,W n-1 / W n =M n And W n-1 %W n =0, where Mn and Nn are integers, Nn>1, Mn>1.

[0015] Furthermore, the step (1.2) includes the following steps:

[0016] (1.2.1) Level 1 grid code: The northern and southern hemisphere identification codes are S and N, the longitude direction is coded as 01-R, and the latitude direction is coded as 01-T by default. If T <= 26, the English letters AZ are used. The level 1 grid code consists of the northern and southern hemisphere identification, the longitude identification code, and the latitude identification code.

[0017] (1.2.2) The nth level grid coding, the n-1th level size is J n-1 Seconds, W n-1 Second grid according to J n Seconds, W n The standard second is divided into N n *M n The nth level grid is composed of the n-1th level grid code and the nth level identification code. The nth level identification code defaults to the "Z" sequence 01-N n*M n Encoding, if N n *M n <=26, coded in alphabetical order from A to Z.

[0018] Furthermore, the step (2) of calculating the regional location information includes the following steps:

[0019] (2.1) Determine the area type;

[0020] (2.2) Calculate the location information of the single selection area;

[0021] (2.3) Calculate the continuous and frame selection area position information;

[0022] (2.4) Calculate the position information of the combined area.

[0023] Furthermore, the step (2.1) includes the following steps:

[0024] (2.1.1) The latitude and longitude coordinates of point P are expressed as (P lng , P lat ), a set of input starting and ending points is expressed as U = (P b , P e ), the “starting and ending point” set is represented as {U1U2…U i}, i is the number of "start and end points". If i=1, it means there is only one group of areas, and the area type is single area, continuous area or frame area. If i>1, it means there are multiple groups of areas, and the area type is combined area.

[0025] (2.1.2) According to the grid information, level n, longitude interval J n , latitude interval W n , calculate P respectively b 、P e In the row and column number of the current grid, calculate the row and column number of a point in the n-level grid as shown in formula 1.

[0026]

[0027] Among them, point P b , P e The grid row and column numbers are (Row b , Col b ), (Row e , Col e );

[0028] (2.1.3) When i=1, if If the two points are in the same grid, the area type is single selection area. or If the two points are in the same row or column, the region type is continuous. , the area type is frame selection.

[0029] Furthermore, step (2.2) includes calculating the row and column numbers of the grid based on the four corner points of the grid, i.e., the positions of the single-selection areas. The longitude and latitude coordinates of the four corner points of the grid are expressed as GridScope={P1,P2,P3,P4}, where P1 is the lower left corner of the grid. The set of points is sorted counterclockwise, and the longitude and latitude of the set points are shown in formulas 2-1 and 2-2.

[0030]

[0031] Among them, k represents the number of points in the grid set, is the increment.

[0032] Furthermore, the step (2.3) includes the following steps:

[0033] (2.3.1) Calculate the four corner points of the region based on the row and column numbers of the starting and ending points, compare the row and column numbers of the starting and ending points, and get the maximum row number. , minimum line number , maximum column number , minimum column number ;

[0034] (2.3.2) Obtain the latitude and longitude coordinates of the four corner points of the region in sequence according to the row and column number range PartScope={P1,P2,P3,P4}. Point P1 is the lower left corner of the region. The set of points is organized counterclockwise. The calculation of the four corner points of the region is shown in Formula 3.

[0035]

[0036] Among them, m represents the number of points in the area, GridScope [row,col][m] Represents the mth point in the grid point set corresponding to row and column numbers row and col; when m=1, row=Row min ,col=Col min ; When m=2, row=Row max ,col=Col min ; When m=3, row=Row max ,col=Col max ; When m=4, row=Row min ,col=Col max .

[0037] Furthermore, the step (2.4) includes the following steps:

[0038] (2.4.1) Traverse the “starting and ending” set {U1U2…U i}, calculate the maximum row number, minimum row number, maximum column number, and minimum column number corresponding to the "start and end points" according to step (23-1), loop through the row and column numbers, and calculate the grid point set through step (22) to form a grid set GridScopeSet={GridScope1,GridScope2…GridScope j}, where j is the number of grids;

[0039] (2.4.2) Traverse the grid set GridScopeSet, and exclude duplicate grids based on whether the row and column numbers are equal, forming a deduplicated grid set GridScopeNoSameSet={GridScope1,GridScope2…GridScope j};

[0040] (2.4.3) Traverse the set GridScopeNoSameSet and convert the point set in each grid into four edges in order to form the edge set EdgeSet. Traverse the set EdgeSet and remove duplicate edges based on whether the latitude and longitude of the first and last points of the edge are equal to form the edge set EdgeNoSameSet.

[0041] (2.4.4) Take the first edge from the edge set EdgeNoSameSet as the reference edge Edge juge (P juge1 ,P judge2 ), Edge juge Put the two points into the outer contour point set BoundarySet, traverse the remaining edges in the EdgeNoSameSet set in turn, and take out the edges that are connected to P judge2 Edge next (P next1 ,P next2 ), if P judge2 =P next1 , then P next2 Put into the set BoundarySet, if P judge2 =P next2 , then P next1 Put it into the collection BoundarySet and put the Edge next Take it from the set EdgeNoSameSet and set it as the reference edge (Edge juge =Edge next ), repeatedly traverse EdgeNoSameSet until the number of edges is 0, forming a set of outer contour points that close the region.

[0042] Furthermore, the step (3) includes the following steps:

[0043] (3.1) Calculate the intersecting grid set, calculate the first-level grid code of the point based on the first-level grid longitude and latitude interval, and determine the north-south identity of the point: ; The first-level grid code row and column number of the calculation point is shown in Formula 4:

[0044]

[0045] The first-level grid code is represented as , where Alp is a set of 26 English letters. Only when Col1<=26, take effect;

[0046] According to the latitude and longitude intervals of the nth and n-1th level grids, the nth level grid identification of the point is calculated, as shown in formula (5):

[0047]

[0048] The n-th grid code of the point is composed of: , only hour, take effect;

[0049] (3.2) Determine the type of intersection area, assuming that the starting grid code is , the end grid code is , then the single-selection area code is represented as , the continuous region code is expressed as - , the frame selection area code is represented as * ,The coding of the combined area is a combination of the coding of the single selection area, continuous area, and frame selection area formed by the "start and end point" set;

[0050] (3.3) Calculate the location information of the intersection area, calculate the intersection area of the single selection type, obtain the row and column numbers of the grid, calculate the location information of the intersection area according to step (2.2), calculate the intersection area of the continuous area and the frame selection type, compare the row number and column number of each grid in the set GridInSect respectively, and obtain the maximum row number , minimum line number , maximum column number , minimum column number ; Calculate the location information of the intersection area according to step (2.3.2), calculate the intersection area of the combined area type, assign GridInSect to GridScopeNoSameSet, and calculate the location information of the intersection area according to steps (2.4.3) and (2.4.4).

[0051] Beneficial effects: Compared with the prior art, the present invention has the following significant advantages:

[0052] (1) Based on two-point planning, a set of grids is determined to form an airspace through two points, which is simple to interact with and highly efficient.

[0053] (2) The airspace is represented based on a global grid model. The longitude and latitude of the grid are fixed. The longitude and latitude of the airspace data composed of the grid are fixed, which avoids the long-term calibration of the airspace longitude and latitude information when planning the airspace based on longitude and latitude.

[0054] (3) Perform spatial analysis based on a unified and concise spatial coding, convert the vector solution of the spatial domain into a grid solution, and convert the vector calculations such as intersection and difference of the spatial domain into operations of spatial coding to improve the efficiency of spatial analysis. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] Figure 1 is a flow chart of the present invention;

[0056] Figure 2 A flowchart for calculating regional location information;

[0057] Figure 3 (a)-(c) are schematic diagrams of the locations of single selection, continuous selection, and frame selection areas respectively;

[0058] Figure 4 Schematic diagram for calculating the outer contour points of the combined area;

[0059] Figure 5 Schematic diagram of coding representation for each type of area. DETAILED DESCRIPTION

[0060] The technical solution of the present invention will be further described below with reference to the accompanying drawings.

[0061] like Figure 1 As shown, the present invention includes the following steps:

[0062] (1) Constructing a global grid model: The global geographic space is divided into grids, each grid is assigned a unique code, and the range of the grid is [-180, 180] in the longitude direction and [-90, 90] in the latitude direction. Constructing an n-level global grid within this range includes two steps: global multi-level grid division and global multi-level grid coding.

[0063] (2) Calculate regional location information; the region is constructed with a certain level of grid as the basic unit, and is divided into four types according to type: single selection area (composed of one grid), continuous area (composed of multiple continuous grids in the same row or column at the same level), frame selection area (composed of continuous grids with equal number of rows and columns at the same level), and combined area (any combination of single selection area, continuous area, or frame selection area). A region is determined based on two points ("starting and ending points"), and the regional location information is calculated based on the "starting and ending points" set input during the regional planning process, including four steps: determining the region type, calculating the location information of the single selection area, calculating the location information of the continuous and frame selection areas, and calculating the location information of the combined area;

[0064] (3) Calculate the intersection of the grids between the two areas, determine the type of the intersection area based on the grids in the intersection, and calculate the location information of the intersection area based on the intersection area type.

[0065] The main process of step (1) includes:

[0066] Building a global grid model

[0067] The global geographic space is divided into grids, and each grid is assigned a unique code. The division range is [-180, 180] in the longitude direction and [-90, 90] in the latitude direction. Constructing an n-level global grid within this range includes two steps: global multi-level grid division and global multi-level grid encoding.

[0068] (1.1) Global multi-level grid division

[0069] (1.1.1) Level 1 grid division: Longitude is divided counterclockwise from -180° (180° west) at intervals of J1 seconds to 180° (180° east). The number of Level 1 grid columns globally is 360*3600 / J1=R (R is an integer greater than 1). Latitude is divided north and south from the equator at intervals of W1 seconds. The number of Level 1 grid rows in the northern and southern hemispheres is 90*3600 / W1=T (T is an integer greater than 1).

[0070] (1.1.2) The nth level grid division, the longitude interval is J n Seconds, latitude interval W n seconds, where J n >=1,W n >=1,J n-1 / J n = N n (Nn is an integer, Nn>1) and J n-1 %J n =0,W n-1 / W n =M n (Mn is an integer, Mn>1) and W n-1 %Wn =0.

[0071] (1.2) Global multi-level grid coding

[0072] (1.2.1) Level 1 grid code: The northern and southern hemisphere identifiers are N (Northern Hemisphere) and S (Southern Hemisphere). Longitude is coded as 01-R. Latitude is coded as 01-T for the northern and southern hemispheres by default, or AZ if T <= 26. The level 1 grid code consists of the northern and southern hemisphere identifiers, the longitudinal identifier, and the latitudinal identifier.

[0073] (1.2.2) The nth level grid coding, the n-1th level size (J n-1 Seconds, W n-1 Seconds) grid according to (J n Seconds, W n seconds) is divided into N n *M n The nth level grid is composed of the n-1th level grid code and the nth level identification code; the nth level identification code defaults to the "Z" sequence 01-N n *M n encoding, or if N n *M n <=26, coded in alphabetical order from A to Z.

[0074] The main process of step (2) includes:

[0075] Calculation area location information

[0076] The area is composed of a certain level of grid as the basic unit, and is divided into four types according to type: single selection area (composed of one grid), continuous area (composed of multiple continuous grids in the same row or column at the same level), frame selection area (composed of continuous grids with equal number of rows and columns at the same level) and combination area (any combination of single selection area, continuous area or frame selection area). An area is determined based on two points ("starting and ending points"). The area location information is calculated according to the set of "starting and ending points" input during the area planning process, including four steps: determining the area type, calculating the location information of the single selection area, calculating the location information of the continuous and frame selection areas, and calculating the location information of the combination area. The processing process is as follows: Figure 2 shown.

[0077] (2.1) Determine the area type

[0078] (2.1.1) The latitude and longitude coordinates of point P are expressed as (P lng , P lat ), a set of input starting and ending points is expressed as U = (P b , P e ), the “starting and ending point” set is represented as {U1U2…U i}, i is the number of "start and end points". If i=1, it means there is only one group of areas, and the area type is single area, continuous area or frame area. If i>1, it means there are multiple groups of areas, and the area type is combined area.

[0079] (2.1.2) According to the grid information, level n, longitude interval J n , latitude interval W n , calculate P respectively b 、P e In the row and column number of the current grid, calculate the row and column number of a point in the n-level grid as shown in formula 1.

[0080]

[0081] Among them, point P b , P e The grid row and column numbers are (Row b , Col b ), (Row e , Col e );

[0082] (2.1.3) When i=1, if If the two points are in the same grid, the area type is single selection area. or If the two points are in the same row or column, the region type is continuous. , the area type is frame selection.

[0083] (2.2) Calculate the location information of the single selection area

[0084] According to the four corner points of the grid, i.e. the positions of the single selection areas, the row and column numbers of the grid are calculated. The longitude and latitude coordinates of the four corner points of the grid are expressed as GridScope={P1,P2,P3,P4}. Point P1 is the lower left corner of the grid. The collection points are sorted counterclockwise. The longitude and latitude of the collection points are shown in formulas 2-1 and 2-2.

[0085]

[0086] Among them, k represents the number of points in the grid set, is the increment.

[0087] (2.3) Calculate the continuous and frame selection area position information

[0088] The position calculation method of the continuous area is the same as that of the frame selection area. The four corner points of the area are calculated based on the row and column numbers of the starting point and the end point. For example Figure 3 As shown in (a)~3(c).

[0089] (2.3.1) Calculate the four corner points of the region based on the row and column numbers of the starting and ending points, compare the row and column numbers of the starting and ending points, and get the maximum row number. , minimum line number , maximum column number , minimum column number ;

[0090] (2.3.2) Obtain the latitude and longitude coordinates of the four corner points of the region in sequence according to the row and column number range PartScope={P1,P2,P3,P4}. Point P1 is the lower left corner of the region. The set of points is organized counterclockwise. The calculation of the four corner points of the region is shown in Formula 3.

[0091]

[0092] Among them, m represents the number of points in the area, GridScope [row,col][m] Represents the mth point in the grid point set corresponding to row and column numbers row and col; when m=1, row=Row min ,col=Col min ; When m=2, row=Row max ,col=Col min ; When m=3, row=Row max ,col=Col max ; When m=4, row=Row min ,col=Col max .

[0093] (2.4) Calculate the position information of the combined area

[0094] The calculation of the combined area requires obtaining all the grids corresponding to the "start and end point" set, converting the grid into an edge set, removing duplicate edges, and calculating the closed point set of the outer contour of the composed area in the same way as the start and end points of the remaining edges, such as Figure 4 shown.

[0095] (2.4.1) Traverse the “starting and ending” set {U1U2…U i}, calculate the maximum row number, minimum row number, maximum column number, and minimum column number corresponding to the "start and end points" according to step (23-1), loop through the row and column numbers, and calculate the grid point set through step (22) to form a grid set GridScopeSet={GridScope1,GridScope2…GridScope j}, where j is the number of grids;

[0096] (2.4.2) Traverse the grid set GridScopeSet, and exclude duplicate grids based on whether the row and column numbers are equal, forming a deduplicated grid set GridScopeNoSameSet={GridScope1,GridScope2…GridScope j};

[0097] (2.4.3) Traverse the set GridScopeNoSameSet and convert the point set in each grid into four edges in order to form the edge set EdgeSet. Traverse the set EdgeSet and remove duplicate edges based on whether the latitude and longitude of the first and last points of the edge are equal to form the edge set EdgeNoSameSet.

[0098] (2.4.4) Take the first edge from the edge set EdgeNoSameSet as the reference edge Edge juge (P juge1 ,P judge2 ), Edge juge Put the two points into the outer contour point set BoundarySet, traverse the remaining edges in the EdgeNoSameSet set in turn, and take out the edges that are connected to P judge2 Edge next (P next1 ,P next2 ), if P judge2 =P next1 , then P next2 Put into the set BoundarySet, if P judge2 =P next2 , then P next1 Put it into the collection BoundarySet and put the Edge next Take it from the set EdgeNoSameSet and set it as the reference edge (Edge juge =Edge next ), repeatedly traverse EdgeNoSameSet until the number of edges is 0, forming a set of outer contour points that close the region.

[0099] The main process of step (3) includes:

[0100] Calculate area coding information

[0101] According to the area type calculated in step (2), the area code is determined by calculating the grid codes of the "starting point" and the "end point", including two steps: calculating the grid code of the point at the nth level and organizing the area code.

[0102] (3.1) Calculate the intersecting grid set, calculate the first-level grid code of the point based on the first-level grid longitude and latitude interval, and determine the north-south identity of the point: ; The first-level grid code row and column number of the calculation point is shown in Formula 4:

[0103]

[0104] The first-level grid code is represented as , where Alp is a set of 26 English letters. Only when Col1<=26, take effect;

[0105] According to the latitude and longitude intervals of the nth and n-1th level grids, the nth level grid identification of the point is calculated, as shown in formula (5):

[0106]

[0107] The n-th grid code of the point is composed of: , only hour, take effect;

[0108] (3.2) Determine the type of intersection area, assuming that the starting grid code is , the end grid code is , then the single-selection area code is represented as , the continuous region code is expressed as - , the frame selection area code is represented as * The coding of the combined area is a combination of the single selection area, continuous area, and frame selection area coding formed by the "start and end point" set.

[0109] (3.3) Calculate the location information of the intersection area, calculate the intersection area of the single selection type, obtain the row and column numbers of the grid, calculate the location information of the intersection area according to step (2.2), calculate the intersection area of the continuous area and the frame selection type, compare the row number and column number of each grid in the set GridInSect respectively, and obtain the maximum row number , minimum line number , maximum column number , minimum column number ; Calculate the location information of the intersection area according to step (2.3.2), calculate the intersection area of the combined area type, assign GridInSect to GridScopeNoSameSet, and calculate the location information of the intersection area according to steps (2.4.3) and (2.4.4).

Claims

1. A global grid-based regional rapid planning method, characterized in that: The steps include: (1) Construct a global gridding model, divide the global geographic space into grids, assign a unique code to each grid, and construct an n-level global grid within the range of longitude [-180, 180] and latitude [-90, 90]. (2) Calculate regional location information. A region is constructed using a certain level of grid as the basic unit. It is divided into single-selection regions, continuous regions, frame-selection regions, and combined regions. A region is determined based on two points. The regional location information is calculated based on the "start and end point" set input during the regional planning process. (3) Calculating the area code information, determining the area code based on the area type calculated in step (2) and by calculating the grid codes of the "starting point" and "end point"; The step (2) of calculating the regional location information includes the following steps: (2.1) Determine the area type; (2.2) Calculate the location information of the single selection area; (2.3) Calculate the continuous and frame selection area position information; (2.4) Calculate the position information of the combined area.

2. The global grid-based regional rapid planning method according to claim 1, characterized in that: The step (1) of constructing an n-level global grid includes the following steps: (1.1) Global multi-level grid division; (1.2) Global multi-level grid coding.

3. The global grid-based regional rapid planning method according to claim 2, characterized in that: The step (1.1) comprises the following steps: (1.1.1) Level 1 grid division: The longitude direction is divided counterclockwise from -180 to 180 at intervals of J1 seconds. The number of columns of the global level 1 grid is 360*3600 / J1=R. The latitude direction is divided north and south at intervals of W1 seconds starting from the equator. The number of rows of the level 1 grid in the northern and southern hemispheres is 90*3600 / W1=T, where T is an integer greater than 1. (1.1.2) The nth level grid division, the longitude interval is J n Seconds, latitude interval is W n seconds, where J n >=1,W n >=1,J n-1 / J n =N n And J n-1 %J n =0,W n-1 W n =M n And W n-1 %W n =0, where Mn and Nn are integers, Nn>1, Mn>1.

4. The global grid-based regional rapid planning method according to claim 2, characterized in that: The step (1.2) comprises the following steps: (1.2.1) Level 1 grid code: The northern and southern hemisphere identification codes are S and N, the longitude direction is coded as 01-R, and the latitude direction is coded as 01-T by default. If T <= 26, the English letters AZ are used. The level 1 grid code consists of the northern and southern hemisphere identification, the longitude identification code, and the latitude identification code; (1.2.2) The nth level grid coding, the n-1th level size is J n-1 Seconds, W n-1 Second grid according to J n Seconds, W n The standard second is divided into N n *M n The nth level grid is composed of the n-1th level grid code and the nth level identification code. The nth level identification code defaults to the "Z" sequence 01-N n *M n Encoding, if N n *M n <=26, coded in alphabetical order from A to Z.

5. The global grid-based regional rapid planning method according to claim 1, characterized in that: The step (2.1) comprises the following steps: (2.1.1) The latitude and longitude coordinates of point P are expressed as (P lng , P lat ), a set of input starting and ending points is represented as U=(P b , P e ), the "starting and ending" set is represented as {U1U2....U i }, i is the number of "start and end points". If i = 1, it means there is only one group of areas, and the area type is single area, continuous area or frame area. If i > 1, it means there are multiple groups of areas, and the area type is combined area. (2.1.2) According to the grid information, level n, longitude interval J n , latitude interval W n , calculate P respectively b 、P e In the row and column number of the current grid, calculate the row and column number of a point in the n-level grid as shown in formula 1. Among them, point P b , P e The grid row and column numbers are (Row b , Col b ), (Row e , Col e ); (2.1.3) When i=1, if Row b =Row e And Col b =Col e If the two points are in the same grid, the area type is single selection area. b =Row e And Col b ≠Col e or Row b ≠Row e And Col b =Col e If the two points are in the same row or column, the area type is continuous. b ≠Row e And Col b ≠Col e , the area type is frame selection.

6. The global grid-based regional rapid planning method according to claim 1, characterized in that: The step (2.2) includes calculating the row and column numbers of the grid based on the four corner points of the grid, i.e., the positions of the single selection areas. The longitude and latitude coordinates of the four corner points of the grid are expressed as GridScope = {P1, P2, P3, P4}, where P1 is the lower left corner of the grid. The set of points is sorted counterclockwise, and the longitude and latitude of the set points are shown in formulas 2-1 and 2-2. Among them, k represents the number of points in the grid set, and △ is the increment.

7. The global grid-based regional rapid planning method according to claim 1, characterized in that: The step (2.3) comprises the following steps: (2.3.1) Calculate the four corner points of the region based on the row and column numbers of the starting and ending points, compare the row and column numbers of the starting and ending points, and get the maximum row number. max =max(Row b , Row e ), minimum row number Row min =min(Row b , Row e ), maximum column number Col max =max(Col b , Col e ), minimum column number Col min =min(Col b , Col e ); (2.3.2) Obtain the latitude and longitude coordinates of the four corner points of the region in sequence according to the row and column number range. PartScope = {P1, P2, P3, P4}. Point P1 is the lower left corner of the region. The set of points is organized counterclockwise. The calculation of the four corner points of the region is shown in Formula 3. P m =GridScope [row，col][m] m∈[1,4] (3) Among them, m represents the number of points in the region, CriidScope [row,col][m] Represents the mth point in the grid point set corresponding to row and column numbers row and col; when m = 1, row = Row min , col=Col min ; When m = 2, row = Row max , col=Col min ; When m = 3, row = Row max , col = Col max ; When m = 4, row = Row min , col = Col max .

8. The global grid-based regional rapid planning method according to claim 1, characterized in that: The step (2.4) comprises the following steps: (2.4.1) Traverse the "start and end point" set {U1U2....U i }, calculate the maximum row number, minimum row number, maximum column number, and minimum column number corresponding to the "start and end points" according to step (23-1), loop through the row and column numbers, calculate the grid point set through step (22), and form a grid set GridScopeSet = {GridScope1, GridScope2....GridScope j }, where j is the number of grids; (2.4.2) Traverse the grid set GridScopeSet, and exclude duplicate grids based on whether the row and column numbers are equal, forming a deduplicated grid set GridScopeNoSameSet = {GridScope1, GridScope2....GridScope j }; (2.4.3) Traverse the set GridScopeNoSameSet and convert the point set in each grid into four edges in order to form the edge set EdgeSet. Traverse the set EdgeSet and remove duplicate edges based on whether the latitude and longitude of the first and last points of the edge are equal to form the edge set EdgeNoSameSet. (2.4.4) Take the first edge from the edge set EdgeNoSameSet as the reference edge Edge juge (P juge1 , P judge2 ), Edge juge Put the two points into the outer contour point set BoundarySet, traverse the remaining edges in the EdgeNoSameSet set in turn, and take out the edges that are connected to P judge2 Edge next (P next1 ,P next2 ), if P judge2 =P next1 , then P next2 Put into the set BoundarySet, if P judge2 =P next2 , then P next1 Put it into the collection BoundarySet and put the Edge next Take it from the set EdgeNoSameSet and set it as the reference edge (Edge juge =Edge next ), repeatedly traverse EdgeNoSameSet until the number of edges is 0, forming a set of outer contour points that closes the region.

9. The global grid-based regional rapid planning method according to claim 1, characterized in that: The step (3) comprises the following steps: (3.1) Calculate the nth level grid code of the point. Based on the first level grid longitude and latitude interval, calculate the first level grid code of the point and determine the north and south identification of the point: The first-level grid code row and column number of the calculation point is shown in Formula 4: Line number: Column number: The first-level grid code is represented as Among them, Alp is a set of 26 English letters, and only when Col1 is less than or equal to 26, take effect; According to the latitude and longitude intervals of the nth and n-1th level grids, the nth level grid identification of the point is calculated, as shown in formula (5): The n-th grid code of the point is composed of: Only Pid k <=26 o'clock, take effect; (3.2) Calculate the tissue area code, assuming that the starting grid code is The end grid is coded as The single-selection area code is represented as The continuous region code is represented as The frame selection area code is represented as The coding of the combined area is a combination of the single selection area, continuous area, and frame selection area coding formed by the "start and end point" set.

Images