Mesh generation method and device, electronic equipment and readable storage medium

Abstract

Embodiments of the present application provide a grid generation method and device, electronic equipment and readable storage medium, comprising: acquiring the number, area and common vertex of the basic grid unit of the to-be-observed vector region mapping; if the number is greater than 1 and less than or equal to a first preset value, determining the center point of the to-be-generated intermediate layer grid unit according to the common vertex of the basic grid unit, and determining the area of the to-be-generated intermediate layer grid unit according to the area of the basic grid unit; aggregating the basic grid unit of the to-be-observed vector region mapping according to the center point and the area of the to-be-generated intermediate layer grid unit to obtain the intermediate layer grid unit; if the number is greater than the first preset value, acquiring the effective degree number of the basic grid unit; aggregating the basic grid unit of the to-be-observed vector region mapping according to the effective degree number to obtain the intermediate layer grid unit, thereby reducing the space loss and the pressure of satellite planning and scheduling.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of satellite application, and particularly relates to a mesh generation method and device, electronic equipment and readable storage medium. BACKGROUND

[0002] The current satellite observation task representation scheme mainly uses a traditional seamless and non-overlapping hexagonal subdivision mesh to represent a target area. Specifically, the target area is first mapped through a seamless and non-overlapping hexagonal mesh, then a set of mesh cells is formed by discretizing the vector target area, and the representation of a complex surface object is completed through mesh coding. Then, it is used as an input of subsequent satellite scheduling planning, providing a model basic unit for large-scale star cluster planning and scheduling.

[0003] However, when the above-mentioned representation is used, some problems will exist. First, if the target area is mapped to a mesh corner point during mapping, simple spatial aggregation cannot control the resolution, and even in the worst case, aggregation to the 0th layer cannot achieve single mesh mapping, which will result in a large number of dead spaces. Secondly, when the target area is large, due to the limitation of the mesh scale, the number of mapped meshes will also increase accordingly. Too many mesh numbers will increase the number of satellite shooting times, cause more satellite resource use, and increase the pressure of satellite planning and scheduling. SUMMARY

[0004] The present application provides a mesh generation method, device, electronic equipment and readable storage medium, in order to solve the problem that the existing task representation method is limited by the satellite width, which may result in a large number of dead spaces during mesh mapping, and also results in an increase in the number of mapped meshes, which further causes more satellite resource use and increases the pressure of satellite planning and scheduling.

[0005] In order to solve the above technical problems, the present application is implemented as follows:

[0006] In a first aspect, the present application provides a mesh generation method, which comprises:

[0007] Obtaining key information of a basic mesh cell to be mapped for a to-be-observed vector area, the key information comprising the number, area and common vertex of the basic mesh cell;

[0008] If the number is greater than 1 and less than or equal to a first preset value, determining the center point of an intermediate layer mesh cell to be generated according to the common vertex of the basic mesh cell, and determining the area of the intermediate layer mesh cell to be generated according to the area of the basic mesh cell;

[0009] Aggregating the basic mesh cell to be mapped for the to-be-observed vector area according to the center point and area of the intermediate layer mesh cell to be generated, to obtain an intermediate layer mesh cell.

[0010] If the number is greater than a first preset value, an effective degree number of the basic grid unit is obtained, the effective degree number being a number of basic grid units adjacent to the basic grid unit and not aggregated;

[0011] The basic grid unit mapped by the to-be-observed vector region is aggregated according to the effective degree number, to obtain an intermediate layer grid unit.

[0012] Optionally, the key information of the basic grid unit mapped by the to-be-observed vector region is obtained, including:

[0013] A width of a satellite performing an observation task, a shape and an area of the to-be-observed vector region are obtained.

[0014] A level of the basic grid unit mapped by the to-be-observed vector region is determined according to the width.

[0015] An area of the basic grid unit mapped by the to-be-observed vector region is determined according to the level.

[0016] A number of the basic grid unit mapped by the to-be-observed vector region is determined according to the area of the basic grid unit and the area of the to-be-observed vector region.

[0017] A position distribution of the basic grid unit mapped by the to-be-observed vector region is determined according to the shape of the to-be-observed vector region.

[0018] A common vertex of the basic grid unit mapped by the to-be-observed vector region is determined according to the position distribution.

[0019] Optionally, after the basic grid unit mapped by the to-be-observed vector region is aggregated according to the effective degree number to obtain the intermediate layer grid unit, the method further includes:

[0020] A 64-bit grid code of the basic grid unit is obtained.

[0021] A grid code representing the intermediate layer grid unit is added in the first to fourth bits of the 64-bit grid code.

[0022] A grid code representing a vertex of the intermediate layer grid unit is added in the fifth to seventh bits of the 64-bit grid code.

[0023] A grid code representing a level of the intermediate layer grid unit is added in the eighth to eleventh bits of the 64-bit grid code, wherein the level of the intermediate layer grid unit is an intermediate value of the level of the basic grid unit and a previous level of the basic grid unit.

[0024] Optionally, the center point of the intermediate layer grid cell to be generated is determined according to the common vertex of the base grid cell, and the area of the intermediate layer grid cell to be generated is determined according to the area of the base grid cell, comprising:

[0025] obtaining a target number and an encoding combination of the base grid cell to which the common vertex belongs;

[0026] if the maximum value of the target number is a first preset value, the corresponding common vertex is determined as the center point of the intermediate layer grid cell to be generated;

[0027] if the maximum value of the target number is a second preset value, the center point of the intermediate layer grid cell to be generated is selected from the common vertex corresponding to the target number of the third preset value according to the encoding combination;

[0028] the area of the intermediate layer grid cell to be generated is determined as three times the area of the base grid cell.

[0029] Optionally, the base grid cell mapped by the effective degree number to the observation vector area is aggregated to obtain an intermediate layer grid cell, further comprising:

[0030] obtaining a minimum value of the effective degree number from the effective degree number;

[0031] if the minimum value is 1, the first base grid cell corresponding to the minimum value of the effective degree number and the base grid cell adjacent to the first base grid cell are aggregated to obtain an intermediate layer grid cell;

[0032] if the minimum value is greater than 1, a second base grid cell adjacent to the first base grid cell is obtained;

[0033] if it is determined that the first base grid cell and the second base grid cell are combined into three base grid cells adjacent to each other, a target effective degree sum of the three base grid cell combinations is obtained;

[0034] the three base grid cell combinations with the minimum target effective degree sum are aggregated to obtain an intermediate layer grid cell.

[0035] Optionally, after obtaining the minimum value of the effective degree number from the effective degree number, further comprising:

[0036] if the minimum value is 0, the effective degree of the base grid cell corresponding to the minimum value of the effective degree number is changed to a target value;

[0037] determining a third base grid cell participating in aggregation;

[0038] the effective degree of the third base grid cell is changed to a target value.

[0039] If the average of the valid degrees of the basic grid cells mapped by the vector region to be observed is the target value, the aggregation operation is ended.

[0040] Optionally, after the third basic grid cell participating in the aggregation is determined, the method further comprises:

[0041] obtaining the adjacency relationship of the basic grid cells;

[0042] generating an adjacency list according to the adjacency relationship;

[0043] traversing the adjacency list to obtain a fourth basic grid cell adjacent to the third basic grid cell;

[0044] decreasing the valid degree of the fourth basic grid cell by one.

[0045] In a second aspect, the present application provides a grid generation device, which comprises:

[0046] a first obtaining module, configured to obtain key information of basic grid cells mapped by a vector region to be observed, the key information comprising the number, area and common vertex of the basic grid cells;

[0047] a first determining module, configured to, if the number is greater than 1 and less than or equal to a first preset value, determine the center point of an intermediate layer grid cell to be generated according to the common vertex of the basic grid cells, and determine the area of the intermediate layer grid cell to be generated according to the area of the basic grid cells;

[0048] a first aggregation module, configured to aggregate the basic grid cells mapped by the vector region to be observed according to the center point and area of the intermediate layer grid cell to be generated, to obtain an intermediate layer grid cell;

[0049] a second obtaining module, configured to, if the number is greater than the first preset value, obtain the valid degree of the basic grid cells, the valid degree referring to the number of basic grid cells adjacent to the basic grid cells and not aggregated;

[0050] a second aggregation module, configured to aggregate the basic grid cells mapped by the vector region to be observed according to the valid degree, to obtain an intermediate layer grid cell.

[0051] In a third aspect, the present application provides an electronic device, comprising a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the grid generation method.

[0052] In a fourth aspect, the present application provides a readable storage medium, which, when instructions in the storage medium are executed by a processor of an electronic device, enables the electronic device to perform the above grid generation method.

[0053] In the embodiment of the present application, the key information of the basic grid unit to be observed vector region mapping is obtained, the key information including the number, area and common vertex of the basic grid unit; if the number is greater than 1 and less than or equal to a first preset value, the center point of the intermediate layer grid unit to be generated is determined according to the common vertex of the basic grid unit, and the area of the intermediate layer grid unit to be generated is determined according to the area of the basic grid unit; the center point of the intermediate layer grid unit is determined through the common vertex, which ensures the spatial relationship consistency between the newly generated grid unit and the basic grid unit, avoids the topological error or data break caused by grid division, and the area of the intermediate layer grid unit is determined according to the area, which ensures the spatial continuity and proportional consistency of the data; the basic grid unit to be observed vector region mapping is aggregated according to the center point and the area of the intermediate layer grid unit to be generated, to obtain the intermediate layer grid unit; if the number is greater than the first preset value, the effective degree number of the basic grid unit is obtained, the effective degree number referring to the number of the basic grid units adjacent to the basic grid unit and not aggregated; the basic grid unit to be observed vector region mapping is aggregated according to the effective degree number, to obtain the intermediate layer grid unit; by introducing the concept of effective degree number, the adjacent and not aggregated units are preferentially aggregated, the repeated calculation and redundant operation are reduced, and the calculation efficiency is improved; by aggregating the basic grid unit to generate the intermediate layer grid unit, the problem of too much dead space and insufficient precision caused by simple spatial aggregation is avoided, and the problem of too many mapped grids, which leads to the increase of satellite shooting times, the excessive use of satellite resources and the large satellite planning and scheduling, is also avoided. Thus, the spatial loss is reduced, and as few intermediate layer grids and basic layer grids as possible are used for coverage, which saves the time and spatial loss for subsequent star cluster planning, reduces the pressure of satellite planning and scheduling, and enables the star cluster planning to be efficiently performed. BRIEF DESCRIPTION OF DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or prior art description. Obviously, the drawings in the following description are some embodiments of the present application, and other drawings can also be obtained by those skilled in the art without any creative effort.

[0055] Figure 1 is a schematic diagram of a vector target representation grid provided by an embodiment of the present application;

[0056] Figure 2 is a grid generation method provided by an embodiment of the present application;

[0057] Figure 3 is Figure 2 A flow chart of step 101 in a grid generation method provided by the embodiment of the application is shown in the figure;

[0058] Figure 4 is Figure 2 A simple grid aggregation schematic diagram in a grid generation method provided by the embodiment of the application is shown in the figure;

[0059] Figure 5 is Figure 2 A schematic diagram of determining the center point of the intermediate layer grid unit in a grid generation method provided by the embodiment of the application is shown in the figure;

[0060] Figure 6 is Figure 2 A schematic diagram of converting the grid into a graph structure in a grid generation method provided by the embodiment of the application is shown in the figure;

[0061] Figure 7 is Figure 2 A grid index schematic diagram in a grid generation method provided by the embodiment of the application is shown in the figure;

[0062] Figure 8 is Figure 2 A schematic diagram of an adjacency list in a grid generation method provided by the embodiment of the application is shown in the figure;

[0063] Figure 9 is Figure 2 A flow chart of a greedy algorithm in a grid generation method provided by the embodiment of the application is shown in the figure;

[0064] Figure 10 is a structural diagram of a grid generation device provided by the embodiment of the application;

[0065] Figure 11 is a structural diagram of an electronic device provided by the embodiment of the application. DETAILED DESCRIPTION

[0066] The technical solutions in the embodiments of the application will be clearly and completely described below with reference to the drawings in the embodiments of the application. Obviously, the described embodiments are some but not all of the embodiments of the application. Based on the embodiments in the application, all other embodiments obtained by those of ordinary skill in the art without creative work fall within the protection scope of the application.

[0067] The current satellite observation task representation scheme relies on open source discrete global grid system and grid subdivision theory model in implementation, wherein the open source discrete global grid system includes large open source discrete grid subdivision system H3 and DGGRID. The H3 system is based on seven-aperture hexagonal subdivision, and provides 16 levels of multi-resolution grids. The provided functions include but are not limited to the mutual conversion of grid, grid vertex, grid edge and latitude and longitude and specified resolution grid index, grid distance-based neighbor query, shortest path search between grids, and grid of geometric polygon. DGGRID operates with icosahedron as the basic polyhedron, and the core function is to group point data into DGGS units at a selected resolution. DGGRID allows the generated DGGS to be exported to a standard GIS format. The greatest advantage of DGGRID is that the subdivision mode (triangle, quadrilateral or hexagon) can be selected. In addition, the projection direction and projection method can also be defined. It should be noted that both of these systems are based on the implementation of the global discrete grid system (Discrete Global Grid System, DGGS). DGGS is a multi-resolution discrete earth reference model formed by recursively subdividing the entire earth space. DGGS has three types of geographic grids, including triangle, quadrilateral and hexagon. Among them, the hexagonal grid system has smaller distortion at the poles, consistent connectivity and good angular resolution characteristics, and is suitable for generating large-scale thermal map grids globally, which is more meaningful for satellite planning and scheduling based on grid.

[0068] However, the above-mentioned hexagonal discrete grid subdivision system, due to its own seamless and non-overlapping and static subdivision properties, plus the limitation of satellite swath, often uses a single scale grid for mapping when representing tasks, so the number of generated grids will be significantly greater than the number of tasks, causing pressure on satellite planning and scheduling; if the vector target representation grid set is directly aggregated into the upper level grid unit, multiple situations will occur, the first situation is that the vector target is in the grid, as shown in the left graph of Figure 1 , at this time a single grid (small hexagon) can complete the coverage, and another situation is that the vector target is at the grid corner, as shown in Figure 1As shown in the right view of FIG. 1, at this time, simple aggregation (corresponding to the largest hexagonal grid in the figure) cannot achieve single grid mapping, and problems such as grid diameter greater than satellite swath width and grid area significantly greater than the area of the observed task object will occur. Therefore, the grid number formed by single-scale grid mapping will be inflated, which will bring great pressure to subsequent satellite planning and scheduling. Based on this, the embodiment of the present application proposes a grid generation method, which can generate new intermediate layer grid cells (corresponding to the intermediate-sized hexagonal grid cells including the vector target in the figure).

[0069] Referring to Figure 2 , Figure 2 is a step flow chart of a grid generation method provided by the embodiment of the present application, as shown in Figure 2 , the method can include:

[0070] Step 101, obtaining key information of a basic grid cell of a to-be-observed vector area mapping, the key information including the number, area and common vertex of the basic grid cell.

[0071] The embodiment of the present application needs to generate new hexagonal multi-scale extended grids on the basis of the original grid, so it is necessary to determine the key information of the basic grid cell of the to-be-observed vector area mapping first. The key information includes the number, area and common vertex of the basic grid cell. In order to obtain these information, the swath width of the satellite performing the observation task, the shape and area of the to-be-observed vector area are obtained first, wherein the swath width (Swath Width) of the satellite refers to the ground width that can be covered by the satellite once, which is an important parameter for determining the observation range, and the shape and area of the to-be-observed vector area directly affect the complexity of grid division and the number of grid cells. According to the swath width and observation requirements, the resolution of the grid cell, i.e. the level, can be determined. The higher the level, the smaller the grid cell and the higher the resolution. The side length of different levels is fixed, so the area of the grid cell can be directly determined according to the level. Then, according to the area of the basic grid cell and the area of the to-be-observed vector area, the number of the basic grid cell of the to-be-observed vector area mapping can be determined, i.e. the number of the basic grid cell = the area of the to-be-observed area / the area of a single grid cell. The shape of the to-be-observed vector area can determine the distribution position of the basic grid cell of the to-be-observed vector area mapping, and the common vertex of the basic grid cell of the to-be-observed vector area mapping can be determined according to the distribution position. Specifically, step 101, as shown in Figure 3 ,

[0072] Step 1011, obtaining the swath width of the satellite performing the observation task, the shape and area of the to-be-observed vector area.

[0073] Step 1012, determining the level of the basic grid cell of the to-be-observed vector area mapping according to the swath width.

[0074] Step 1013, determining the area of the basic grid unit to which the to-be-observed vector region is mapped according to the hierarchy.

[0075] Step 1014, determining the number of the basic grid units to which the to-be-observed vector region is mapped according to the area of the basic grid unit and the area of the to-be-observed vector region.

[0076] Step 1015, determining the position distribution of the basic grid units to which the to-be-observed vector region is mapped according to the shape of the to-be-observed vector region.

[0077] Step 1016, determining the common vertex of the basic grid units to which the to-be-observed vector region is mapped according to the position distribution.

[0078] For example, assuming that the satellite width is 20 kilometers, the to-be-observed region is an irregular polygon with an area of 100 square kilometers, and the basic grid system used is H3 hexagonal grid, because the closest and smaller than the satellite width is the 6th layer grid unit (with an average side length of 10 kilometers), the hierarchy of the basic grid unit to which the to-be-observed vector region is mapped is determined to be the 6th layer according to the satellite width, the area is 1.23 square kilometers, and the number of basic grid units required is 100 / 1.23≈82 at this time, according to the boundary of the irregular polygon, 82 6th layer grid units that are completely or partially located in the region are screened out, and the common vertex of these grid units is determined (the common vertex is a vertex shared by two, three or more grid units).

[0079] In the above steps, by accurately calculating the number and distribution of the grid units, the observation path and resource allocation of the satellite can be optimized, and repeated observation and resource waste can be reduced, and by determining the common vertex, the subsequent aggregation and optimization of the grid units can be facilitated, and the complexity of data processing can be reduced.

[0080] Step 102, if the number is greater than 1 and less than or equal to the first preset value, determining the center point of the to-be-generated intermediate layer grid unit according to the common vertex of the basic grid unit, and determining the area of the to-be-generated intermediate layer grid unit according to the area of the basic grid unit.

[0081] After obtaining the key information of the basic grid unit to which the to-be-observed vector region is mapped, the embodiment of the application starts to determine the center point and area of the to-be-generated intermediate layer grid unit based on the key information, and then aggregates based on the obtained information. When the to-be-observed vector region is small, only 1-3 6th layer H3 grids are needed to cover it, and at this time, only one intermediate layer grid (intermediate layer grid unit) is needed to complete the coverage, such as Figure 4As shown, if the sixth level of the basic grid cell of the to-be-observed vector region mapping has only one, it indicates that this basic grid cell can directly cover the to-be-observed vector region, and there is no need to aggregate. If the sixth level of the basic grid cell of the to-be-observed vector region mapping has two or three adjacent to each other, aggregation is needed to obtain an intermediate level. When the task area is large, multiple sixth level grids are needed to cover.

[0082] Here, the first aggregation is performed according to the first type, so the first preset value is 3. Under this aggregation mode, the center point and the area of the intermediate level need to be determined first. The center point is selected from the common vertices. Since the common vertex refers to the vertex shared by multiple basic grid cells, each common vertex may belong to multiple basic grid cells, and the number of these grid cells is referred to as the "target number". In addition, each basic grid cell has a unique code (such as H3 index in H3 grid system), and these code combinations can be used to identify the grid cells to which the common vertex belongs. Since aggregation may be 2 or 3, the target number is 2 or 3. Get the maximum value of the target number. If the target number is 3, it indicates that the basic grid cells are adjacent to each other at this time, and the common vertex corresponding to the value of 3 can be directly determined as the center point of the intermediate layer grid cell to be generated. For example Figure 5 As shown, the vertices in the circle range belong to the common vertices of the three adjacent sub-grids, and are also the center points of the intermediate layer grid cells to be generated. When the maximum value of the target number is 2, it indicates that the adjacent sub-grids are two by two adjacent, and according to the content of Figure 4 As can be seen from the content of, when two by two adjacent, there are two common vertices, and at this time, one of them can be selected as the center point. If the number of basic grid cells is 3, the codes are A, B, and C, and the distribution mode is two by two adjacent, then there are four common vertices, two common vertices a and b between A and B, and two common vertices c and d between B and C. The code combination corresponding to a and b is consistent, and the code combination corresponding to c and d is consistent. At this time, when the common vertices are selected, one of a and b and one of c and d are selected. After the center point is determined, the area of the intermediate layer grid cell to be generated is also determined based on the area of the basic grid cell. The area of each intermediate layer grid cell to be generated is 3 times the area of the basic grid cell that constitutes it. For example, if the area of the basic grid cell is 1.23 square kilometers, then the area of the intermediate layer grid cell is 1.23 x 3 = 3.69 square kilometers.

[0083] The specific steps include:

[0084] Obtaining the target number and code combination of the basic grid cell to which the common vertex belongs;

[0085] If the maximum of the target number is a first preset value, a corresponding common vertex is determined as a center point of the intermediate layer grid cell to be generated;

[0086] If the maximum of the target number is a second preset value, a center point of the intermediate layer grid cell to be generated is selected from the common vertices corresponding to the target number being a third preset value according to an encoding combination.

[0087] A three-fold area of the basic grid cell is determined as an area of the intermediate layer grid cell to be generated.

[0088] The first preset value is 3, and the second preset value is 2. The encoding combination refers to an encoding combination of all basic grid cells to which the common vertex belongs. For example, the basic grid cells to which the common vertex A belongs are three, which are basic grid cell 1, basic grid cell 2 and basic grid cell 3, and the corresponding encodings are 001, 002 and 003. Therefore, the encoding combination corresponding to the common vertex A is 001002003. It should be noted that if the generated intermediate layer grid cells are adjacent, the two adjacent intermediate layer grid cells are overlapped with each other, and the overlap degree is 16 / 27, which is about 59.3%, as shown in FIG. 1. Figure 5

[0089] The above step can effectively aggregate the surrounding basic grid cells by selecting the common vertex with the maximum target number as the center point, reduce data redundancy, and facilitate the encoding of the intermediate layer grid cell.

[0090] In step 103, the basic grid cells mapped to the vector observation area to be observed are aggregated according to the center point and the area of the intermediate layer grid cell to be generated, to obtain the intermediate layer grid cell.

[0091] After the center point and the area of the intermediate layer grid cell are determined, the position and the coverage range of the intermediate layer grid cell can be directly determined. At this time, the basic grid cells can be deleted, and the corresponding vector observation area to be observed can be covered by using the aggregated intermediate layer grid cell.

[0092] For example, it is assumed that the center point of the intermediate layer grid cell is determined as A, and the intermediate layer grid cell is adjacent to the basic grid cells (B, C and D). The area of one basic grid cell is 1.23 square kilometers, so the area of the intermediate layer grid cell is 3 times the area of the basic grid cell, which is 3.69 square kilometers. The side length of the intermediate layer grid cell is determined according to the area, and the position of the intermediate layer grid cell is determined according to the center point. The basic grid cells B, C and D are aggregated into one intermediate layer grid cell, and the basic grid cells B, C and D are removed. Then, the next center point is selected to generate a new intermediate layer grid cell, until all the basic grid cells are aggregated.

[0093] ​If the number is greater than the first preset value, the number of effective degrees of the basic grid unit is obtained in step 104, where the number of effective degrees refers to the number of basic grid units adjacent to the basic grid unit and not aggregated.

[0094] In the above process, the embodiment of the application is aimed at the aggregation strategy when the to-be-observed vector region is small, and when the to-be-observed vector region is large, multiple grids of the sixth level are needed to cover. In order to reduce the pressure of subsequent star cluster planning to the greatest extent, the number of task grids needs to be reduced as much as possible.

[0095] Based on the above requirements, the embodiment of the application proposes a grid number optimization algorithm, which can realize covering any irregular region with as few multi-scale adaptive grids as possible. This algorithm needs to convert the grid unit into a graph structure. That is, each hexagonal grid can be regarded as a graph node, and two grids adjacent to each other can be regarded as the connection between nodes. In this way, the number of basic grid units adjacent to a certain basic grid unit (node) can be regarded as the degree of the grid (node), and these basic grid units can also be regarded as an undirected connected graph. As shown in the figure, the degrees of each basic grid unit (node) are marked in the figure, and from top to bottom and from left to right, they are 3, 3, 3, 6, 3, 3, and 3. Figure 6

[0096] The above explanation of the meaning of the degree is given, but when the embodiment of the application is aggregated, sometimes some basic grid units may have been aggregated. In order to avoid the repeated aggregation of the aggregated basic grid units, the embodiment of the application calculates the number of basic grid units adjacent to the basic grid unit and not aggregated, and the degree at this time is the effective degree.

[0097] In step 105, the basic grid units mapped to the to-be-observed vector region are aggregated according to the number of effective degrees, and the intermediate layer grid unit is obtained.

[0098] ​After the effective degrees are obtained, the base grid cells in the region mapped by the to-be-observed vector can be aggregated according to the effective degrees. The aggregation is based on a greedy strategy, and the grid cell with the lowest effective degree is preferentially processed, so that a local optimal solution is obtained, and then a global optimal solution is obtained. That is, at the beginning of each iteration, the first base grid cell (node) with the smallest effective degree is selected, and the degree is denoted as n. If n is equal to 1, it indicates that the cell has only one adjacent unaggregated cell, and the cell can be directly aggregated with the adjacent cell. If n is greater than 1, it indicates that each cell has multiple adjacent unaggregated cells, and the best combination needs to be further screened. At this time, aggregation of three base grid cells can be performed. When aggregating, it is required that the three grid cells are adjacent to each other. If there are multiple combinations of three adjacent base grid cells, the target effective degree sum of the three adjacent base grid cell combinations is calculated, and the smallest combination is selected for aggregation. Because the smaller the target effective degree sum is, the fewer the adjacent unaggregated cells in the combination are, and the combination is more suitable for preferential aggregation. The specific steps include:

[0099] obtaining the minimum value of the effective degrees from the effective degrees;

[0100] if the minimum value is 1, aggregating the first base grid cell corresponding to the minimum value of the effective degrees and the base grid cell adjacent to the first base grid cell to obtain an intermediate layer grid cell;

[0101] if the minimum value is greater than 1, obtaining a second base grid cell adjacent to the first base grid cell;

[0102] in a case where the first base grid cell and the second base grid cell are combined to form a combination of three adjacent base grid cells, obtaining a target effective degree sum of the combination of the three base grid cells;

[0103] aggregating the combination of the three base grid cells with the smallest target effective degree sum to obtain an intermediate layer grid cell.

[0104] For example, assuming that the minimum value of the effective degrees is 2, the corresponding base grid cells are A, C, and D, the cells adjacent to A are B and C, the cells adjacent to C are A, D, and E, and the cells adjacent to D are C and E. At this time, the three adjacent base grid cell combinations are: combination 1: A, B, and C, target effective degree sum = 2(A) + 1(B) + 3(C) = 6, combination 2: C, D, and E, target effective degree sum = 3(C) + 2(D) + 1(E) = 6. At this time, combination 1 or combination 2 is selected for aggregation.

[0105] In the above steps, the base grid cells are dynamically aggregated by the effective degrees to generate intermediate layer grid cells. Not only is the generation of isolated cells avoided, but also the aggregation order is optimized, the calculation efficiency is improved, and the satellite observation planning and data processing of a complex region are applicable.

[0106] It should be noted that when the aggregation is performed, after the basic grid cells participating in the aggregation are selected, the specific aggregation manner is still determined according to the center point finding and area determining manner, to determine the position and size of the intermediate layer grid cell of the aggregation. In addition, after the basic grid cells participating in the aggregation are processed, there are isolated basic grid cells, and the effective degree number of the isolated basic grid cells is 0. In order to distinguish the isolated basic grid cells and the basic grid cells that have participated in the aggregation from the basic grid cells that do not participate in the aggregation and need to be processed in the next iteration, it is necessary to avoid repeated processing of these cells in the subsequent aggregation operation. The effective degree number of the basic grid cell that does not need to participate in the aggregation is set to the target value in the embodiment of the application, indicating that the cell is marked as "non-aggregatable" state. If the effective degree number of all basic grid cells is the target value, it indicates that all cells are marked as "non-aggregatable" state, and the iteration ends, and the aggregation operation can end. The specific steps include:

[0107] If the minimum value is 0, the effective degree number of the basic grid cell corresponding to the minimum value of the effective degree number is changed to the target value;

[0108] Determine the third basic grid cell participating in the aggregation;

[0109] Change the effective degree number of the third basic grid cell to the target value;

[0110] In the case where the effective degree number of the basic grid cell to be observed in the vector region mapping is detected to be the target value, the aggregation operation is ended.

[0111] For example, assuming that the target value is 100, there are basic grid cells A, B, C, D, E and F, and the initial effective degree number is as follows: A: 2 (adjacent to B and C), B: 1 (adjacent to A), C: 3 (adjacent to A, D and E), D: 0 (no adjacent non-aggregated cell), E: 2 (adjacent to C and D), and F: 0 (no adjacent non-aggregated cell). Because the effective degree numbers of D and F are 0, they are updated to 100, and then E participates in the aggregation, and the effective degree number is also changed to 100. The effective degree number after the first update is A: 2, B: 1, C: 3, D: 100, E: 100 and F: 100. There are cells (A, B and C) whose effective degree number is not 100, and the aggregation operation is continued until the effective degree number of all cells is the target value 100.

[0112] In the above steps, the cells that have been aggregated or isolated are marked as the target value by setting the effective degree number of the cells with the effective degree number of 0 and the cells that have participated in the aggregation to the target value, to avoid repeated processing of the cells. It should be noted that the effective degree number is the number of adjacent basic grid cells that have not been aggregated, so after some basic grid cells are aggregated, the effective degree number of the adjacent basic grid cells will also change correspondingly. The specific steps include:

[0113] Obtaining the adjacency relationship of the basic grid unit;

[0114] According to the adjacency relationship, an adjacency table is generated;

[0115] Traversing the adjacency table, a fourth basic grid unit adjacent to the third basic grid unit is obtained;

[0116] The validity number of the fourth basic grid unit is reduced by one.

[0117] Wherein, the adjacency relationship of the basic grid unit is stored in the adjacency table, as shown in Figure 7 , the basic grid unit is indexed from top to bottom and from left to right in sequence, and then the adjacency relationship of the basic grid unit with the index is stored in the adjacency table, as shown in Figure 8 , the basic grid unit index adjacent to the grid 1 is 2, 3 and 4; the basic grid unit index adjacent to the grid 2 is 1, 4 and 5; the basic grid unit index adjacent to the grid 3 is 1, 4 and 6; the basic grid unit index adjacent to the grid 4 is 1, 2, 3, 5, 6 and 7; the basic grid unit index adjacent to the grid 5 is 2, 4 and 7; the basic grid unit index adjacent to the grid 6 is 3, 4 and 7; and the basic grid unit index adjacent to the grid 7 is 4, 5 and 6.

[0118] The overall process of the above greedy algorithm is shown in Figure 9 , the minimum validity number n of the basic grid unit is obtained first, when n=0, the validity number of this basic grid unit is modified to 100 (target value); when n=1, the grid and the adjacent grid are aggregated, and the validity number of this basic grid unit is updated to 100; when n>=2 (which can also be considered as n>1) and n<100, the minimum and the second minimum degree numbers in the adjacent grid are preferentially selected, and the premise of selection is that the three grids are adjacent to each other, and an intermediate level grid is used to cover the three grids, and then the validity number of this basic grid unit is updated to the target value, and finally, the code of the grid with n=100 is recorded in the target validity number array. The code of the aggregated intermediate level grid unit and the code of the basic grid unit which does not need to participate in the aggregation are recorded in the target validity number array.

[0119] It should be noted that the code of the basic grid unit can be automatically obtained by the Uber-H3 coding scheme, and the intermediate level grid unit needs to be set by itself, and the embodiment of the present application is based on the Uber-H3 coding scheme to expand the setting, and the specific steps include:

[0120] Obtaining the 64-bit grid code of the basic grid unit;

[0121] adding a grid code representing the middle layer grid cell in the first 1-4 bits of the 64-bit grid code;

[0122] adding a grid code representing the middle layer grid cell vertex in the 5-7 bits of the 64-bit grid code;

[0123] adding a grid code representing the middle layer grid cell level in the 8-11 bits of the 64-bit grid code, wherein the middle layer grid cell level is the level of the base grid cell and the middle value of the previous level of the base grid cell.

[0124] In addition to the above-mentioned encoding, other encodings are consistent or related to Uber-H3. Further, the following is explained: in the 0th bit: reserved bit, value 0, in the 1-4 bits: in H3, this represents the index mode of the cell, 1 (0001) represents the grid code, 2 (0010) represents the encoding of the single-direction edge, 3 (0011) refers to the encoding of the double-direction edge, 4 (0100) represents the vertex encoding, and other values are meaningless. The middle layer grid is added to H3, where 8 (1000) represents the encoding of the middle layer grid, indicating that the encoding is a middle layer grid, 5-7 bits: if the value of the index mode in 1-4 bits is 2 (0010) or 3 (0011), it represents which edge of this H3 hexagonal grid, the value range is 1-6 (001-110); if the value of the index mode is 4, it represents the vertex number of the vertex owner, the value range is 0-5 (000-101); if the index mode is other values, the 5-7 bits are meaningless; if 1-4 bits are 8 (1000), this represents the center point of the middle layer grid, which is the vertex of the base grid, and belongs to the most northern hexagonal grid of the three base H3 grids that constitute the middle layer grid, the value is 0-5 (000-101), the encoding order of the vertex is randomly set, such as 0-4 (000-100) for pentagonal, and so on. The 8-11 bits represent the encoding level corresponding to the H3 grid or the middle layer grid, the range is [0, 15], for example, the encoding level of the base grid cell is 6, and the corresponding encoding level of the middle layer grid is 6.5, the 12-18 bits represent the 122 base cells globally divided when the encoding level is 0, the range is [0, 121], which indicates which base cell the H3 grid or the middle layer grid belongs to at level 0; the 19-63 bits represent the value in the coordinate system of the face corresponding to the encoding level 1 to the encoding level 15, a total of 45 bits, covering the recursive relationship of the parent and child grids. Among them, the value of the middle layer grid in this part is consistent with the most northern H3 grid in its child grid, that is, the middle layer grid inherits the recursive relationship of this grid, and if there is no most northern H3 grid, the middle layer grid can be consistent with the first H3 grid in the counterclockwise direction from the north direction.

[0125] In addition, the embodiment of the present application considers the difference in heat values of different grids when performing grid aggregation. Only the basic grid units adjacent to each other with the same heat value can be aggregated into the intermediate layer grid unit.

[0126] In the embodiment of the present application, the key information of the basic grid unit to be observed in the vector region mapping is acquired, the key information including the number, area and common vertex of the basic grid unit; if the number is greater than 1 and less than or equal to a first preset value, the center point of the intermediate layer grid unit to be generated is determined according to the common vertex of the basic grid unit, and the area of the intermediate layer grid unit to be generated is determined according to the area of the basic grid unit; the center point of the intermediate layer grid unit is determined through the common vertex, which ensures the spatial relationship consistency between the newly generated grid unit and the basic grid unit, avoids the topological error or data break caused by grid division, and the area of the intermediate layer grid unit is determined according to the area, which ensures the spatial continuity and proportional consistency of the data; the basic grid unit to be observed in the vector region mapping is aggregated according to the center point and the area of the intermediate layer grid unit to be generated, to obtain the intermediate layer grid unit; if the number is greater than the first preset value, the effective degree number of the basic grid unit is acquired, the effective degree number referring to the number of the basic grid units adjacent to the basic grid unit and not aggregated; the basic grid unit to be observed in the vector region mapping is aggregated according to the effective degree number, to obtain the intermediate layer grid unit; by introducing the concept of effective degree number, the adjacent and unaggregated units are preferentially aggregated, the repeated calculation and redundant operation are reduced, and the calculation efficiency is improved; by aggregating the basic grid unit to generate the intermediate layer grid unit, the problem of too much dead space and insufficient precision caused by simple spatial aggregation is avoided, and the problem of too many mapped grids, which leads to the increase in the number of satellite shooting, the excessive use of satellite resources and the large satellite planning and scheduling, is also avoided. Therefore, the spatial loss is reduced, and as few intermediate layer grids and basic layer grids as possible are used for coverage, which saves the time and spatial loss for subsequent constellation planning, reduces the pressure of satellite planning and scheduling, and enables the constellation planning to be efficiently performed.

[0127] Figure 10 is a structural diagram of a grid generation device provided by the embodiment of the present application, which can include:

[0128] The first acquisition module 201 is configured to acquire the key information of the basic grid unit to be observed in the vector region mapping, the key information including the number, area and common vertex of the basic grid unit.

[0129] The first determination module 202 is configured to, if the number is greater than 1 and less than or equal to a first preset value, determine the center point of the intermediate layer grid unit to be generated according to the common vertex of the basic grid unit, and determine the area of the intermediate layer grid unit to be generated according to the area of the basic grid unit.

[0130] The first aggregation module 203 is configured to aggregate the basic grid cells mapped by the to-be-observed vector region according to the center point and the area of the intermediate layer grid cell to be generated, to obtain the intermediate layer grid cell.

[0131] The second acquisition module 204 is configured to acquire the effective degree of the basic grid cell if the number is greater than the first preset value, the effective degree being the number of the basic grid cells adjacent to the basic grid cell and not aggregated.

[0132] The second aggregation module 205 is configured to aggregate the basic grid cells mapped by the to-be-observed vector region according to the effective degree, to obtain the intermediate layer grid cell.

[0133] Optionally, the first acquisition module 201 specifically comprises:

[0134] The first acquisition sub-module is configured to acquire the width of the satellite performing the observation task, the shape and the area of the to-be-observed vector region.

[0135] The first determination sub-module is configured to determine the level of the basic grid cell mapped by the to-be-observed vector region according to the width.

[0136] The second determination sub-module is configured to determine the area of the basic grid cell mapped by the to-be-observed vector region according to the level.

[0137] The third determination sub-module is configured to determine the number of the basic grid cells mapped by the to-be-observed vector region according to the area of the basic grid cell and the area of the to-be-observed vector region.

[0138] The fourth determination sub-module is configured to determine the position distribution of the basic grid cell mapped by the to-be-observed vector region according to the shape of the to-be-observed vector region.

[0139] The fifth determination sub-module is configured to determine the common vertex of the basic grid cell mapped by the to-be-observed vector region according to the position distribution.

[0140] Optionally, the grid generation device further comprises:

[0141] The third acquisition module is configured to acquire the 64-bit grid code of the basic grid cell.

[0142] The first increasing module is configured to increase the grid code representing the intermediate layer grid cell in the 1st-4th bit of the 64-bit grid code.

[0143] The second increasing module is configured to increase the grid code representing the vertex of the intermediate layer grid cell in the 5th-7th bit of the 64-bit grid code.

[0144] a third increasing module, configured to increase the grid code representing the middle layer grid cell level in the 8th-11th bits of the 64-bit grid code, wherein the middle layer grid cell level is a middle value of a level of the base grid cell and a previous level of the base grid cell.

[0145] Optionally, the first determining module 202 specifically includes:

[0146] a second obtaining sub-module, configured to obtain a target number and an encoding combination of the base grid cells to which the common vertex belongs.

[0147] a sixth determining sub-module, configured to determine the corresponding common vertex as a center point of the middle layer grid cell to be generated if the maximum value of the target number is a first preset value.

[0148] a screening sub-module, configured to screen the center point of the middle layer grid cell to be generated from the common vertices corresponding to the target number of a third preset value according to the encoding combination if the maximum value of the target number is a second preset value.

[0149] a seventh determining sub-module, configured to determine three times of an area of the base grid cell as an area of the middle layer grid cell to be generated.

[0150] Optionally, the second aggregation module 205 specifically includes:

[0151] a third obtaining sub-module, configured to obtain a minimum value of the effective degrees from the effective degrees.

[0152] a first aggregation sub-module, configured to aggregate a first base grid cell corresponding to the minimum value of the effective degrees and the base grid cells adjacent to the first base grid cell to obtain the middle layer grid cell if the minimum value is 1.

[0153] a fourth obtaining sub-module, configured to obtain a second base grid cell adjacent to the first base grid cell if the minimum value is greater than 1.

[0154] a fifth obtaining sub-module, configured to obtain a target effective degree sum of the three base grid cell combinations if it is determined that the first base grid cell and the second base grid cell are combined into the three base grid cell combinations adjacent to each other.

[0155] a second aggregation sub-module, configured to aggregate the three base grid cell combination with the minimum target effective degree sum to obtain the middle layer grid cell.

[0156] a first modifying sub-module, configured to modify the effective degree of the base grid cell corresponding to the minimum value of the effective degrees to a target value if the minimum value is 0.

[0157] an eighth determining sub-module, configured to determine a third base grid cell participating in the aggregation.

[0158] The second modification submodule is configured to change the effective degree of the third basic grid unit to a target value.

[0159] The detection submodule is configured to end the aggregation operation if it is detected that the effective degrees of the basic grid units in the to-be-observed vector region mapping are all target values.

[0160] The sixth acquisition submodule is configured to acquire the adjacency relationship of the basic grid units.

[0161] The adjacency table generation submodule is configured to generate an adjacency table according to the adjacency relationship.

[0162] The seventh acquisition submodule is configured to traverse the adjacency table to acquire fourth basic grid units adjacent to the third basic grid unit.

[0163] The third modification submodule is configured to decrease the effective degree of the fourth basic grid unit by one.

[0164] In the embodiment of the application, the key information of the basic grid units in the to-be-observed vector region mapping is acquired, the key information including the number, area and common vertex of the basic grid units; if the number is greater than 1 and less than or equal to a first preset value, the center point of the to-be-generated intermediate layer grid unit is determined according to the common vertex of the basic grid units, and the area of the to-be-generated intermediate layer grid unit is determined according to the area of the basic grid units; the center point of the intermediate layer grid unit is determined through the common vertex, which ensures the spatial relationship consistency between the newly generated grid unit and the basic grid unit, avoids topological errors or data breaks caused by grid division, and the area of the intermediate layer grid unit is determined according to the area, which ensures the spatial continuity and proportional consistency of the data; the basic grid units in the to-be-observed vector region mapping are aggregated according to the center point and area of the to-be-generated intermediate layer grid unit, to obtain the intermediate layer grid unit; if the number is greater than the first preset value, the effective degree of the basic grid unit is acquired, the effective degree being the number of the basic grid units adjacent to the basic grid unit and not aggregated; the basic grid units in the to-be-observed vector region mapping are aggregated according to the effective degree, to obtain the intermediate layer grid unit; by introducing the concept of effective degree, the adjacent and unaggregated units are preferentially aggregated, the repeated calculation and redundant operation are reduced, and the calculation efficiency is improved; the application aggregates the basic grid units to generate the intermediate layer grid unit, avoids the problem of too much dead space and insufficient precision caused by simple spatial aggregation, and avoids the problem of too many mapped grids, which leads to an increase in the number of satellite shooting times, an excessive use of satellite resources, and an excessive satellite planning and scheduling. Thus, the spatial loss is reduced, and as few intermediate layer grids and basic layer grids as possible are used for coverage, which saves time and spatial loss for subsequent constellation planning, reduces the pressure of satellite planning and scheduling, and enables the constellation planning to be efficiently performed.

[0165] The application further provides an electronic device, Figure 11 is a structural block diagram of an electronic device provided by an embodiment of the application, referring to Figure 11 , comprising a processor 301, a memory 302, and a computer program 3021 stored in the memory and executable on the processor, and the processor implements the following steps of the grid generation method when executing the program:

[0166] obtain key information of a basic grid unit to be observed vector region mapping, the key information comprising a number, an area and a common vertex of the basic grid unit;

[0167] if the number is greater than 1 and less than or equal to a first preset value, determining a center point of an intermediate layer grid unit to be generated according to the common vertex of the basic grid unit, and determining an area of the intermediate layer grid unit to be generated according to the area of the basic grid unit;

[0168] aggregating the basic grid unit to be observed vector region mapping according to the center point and the area of the intermediate layer grid unit to be generated, to obtain an intermediate layer grid unit;

[0169] if the number is greater than the first preset value, obtaining an effective degree number of the basic grid unit, the effective degree number referring to a number of basic grid units adjacent to the basic grid unit and not aggregated;

[0170] aggregating the basic grid unit to be observed vector region mapping according to the effective degree number, to obtain an intermediate layer grid unit.

[0171] The application further provides a readable storage medium, when instructions in the storage medium are executed by a processor of an electronic device, the electronic device can execute the grid generation method of the foregoing embodiments.

[0172] For the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the related parts refer to the part of the method embodiment.

[0173] The algorithms and displays provided herein are not inherently related to any particular computer, virtual system, or other apparatus. Structural requirements of such systems to perform the operations described above are apparent from the description. Moreover, the application is not intended to be bound by any particular programming language. It will be appreciated that a variety of programming languages can be used to implement the teachings of the application described herein, and that the description above with respect to a particular language is given only for the best mode of the application.

[0174] In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the application can be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been described in detail in order to avoid obscuring the understanding of this description.

[0175] Similarly, it is to be understood that the embodiments of the present application can be adapted to practice the various inventive aspects individually, or in any combination, and that the disclosure of each feature in the description of the exemplary embodiments of the present application is similarly to be taken as an embodiment of each and every subcombination of that feature. Accordingly, the description of the exemplary embodiments of the present application is not to be taken as limiting in scope, but is provided for illustrative purposes.

[0176] Those skilled in the art will appreciate that the modules in the apparatus of the embodiments can be adapted and placed in one or more apparatuses other than the embodiments. The modules or units or components in the embodiments can be combined into one module or unit or component, and further can be divided into more sub-modules or sub-units or sub-components. Except that at least some of such features and / or processes or units are mutually exclusive, any combination of all the features disclosed in the specification (including the accompanying claims, abstract and drawings), and all the processes or units of any methods or apparatuses disclosed so far can be adopted. Unless explicitly stated otherwise, each feature disclosed in the specification (including the accompanying claims, abstract and drawings) can be replaced by alternative features providing the same, equivalent or similar functionality.

[0177] Embodiments of the various components of the application can be implemented in hardware, or as software modules running in one or more processors, or combinations thereof. Those skilled in the art will appreciate that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all of the functionality of some or all of the components in the sequencing apparatus according to the present application. The present application can also be implemented as a program for executing part or all of the methods described herein on a device or apparatus. Such a program can be stored on a computer readable medium or can have one or more signals. Such signals can be downloaded from an Internet website, or provided on a carrier medium, or in any other form.

[0178] It should be noted that the above embodiments are illustrative of the invention and not restrictive, and that those skilled in the art can devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses should not be construed as limiting the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention can be implemented by means of hardware comprising several different elements and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third, etc., does not indicate any order. These words can be interpreted as names.

[0179] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0180] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

[0181] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

[0182] It should be noted that the various data-related processes in the embodiments of this application are carried out in compliance with the relevant data protection laws and policies of the country where the location is located, and with the authorization granted by the owner of the corresponding device.

Claims

1. A mesh generation method characterized by, The method comprises: obtaining key information of a basic grid cell of a to-be-observed vector region mapping, the key information comprising a number, an area and common vertices of the basic grid cell; if the number is greater than 1 and less than or equal to a first preset value, determining a center point of a to-be-generated intermediate layer grid cell according to the common vertices of the basic grid cell, and determining an area of the to-be-generated intermediate layer grid cell according to the area of the basic grid cell; aggregating the basic grid cell of the to-be-observed vector region mapping according to the center point and the area of the to-be-generated intermediate layer grid cell to obtain an intermediate layer grid cell; if the number is greater than the first preset value, obtaining an effective degree number of the basic grid cell, the effective degree number being a number of basic grid cells adjacent to the basic grid cell and not aggregated; aggregating the basic grid cell of the to-be-observed vector region mapping according to the effective degree number to obtain an intermediate layer grid cell.

2. The method of claim 1, wherein, The obtaining of the key information of the basic grid cell of the to-be-observed vector region mapping comprises: obtaining a width of a satellite performing an observation task, a shape and an area of a to-be-observed vector region; determining a level of the basic grid cell of the to-be-observed vector region mapping according to the width; determining an area of the basic grid cell of the to-be-observed vector region mapping according to the level; determining a number of the basic grid cell of the to-be-observed vector region mapping according to the area of the basic grid cell and the area of the to-be-observed vector region; determining a position distribution of the basic grid cell of the to-be-observed vector region mapping according to the shape of the to-be-observed vector region; determining common vertices of the basic grid cell of the to-be-observed vector region mapping according to the position distribution.

3. The method of claim 2, wherein, After the aggregating of the basic grid cell of the to-be-observed vector region mapping according to the effective degree number to obtain an intermediate layer grid cell, the method further comprises: obtaining a 64-bit grid code of the basic grid cell; increasing a grid code representing an intermediate layer grid cell in the first to fourth bits of the 64-bit grid code; increasing a grid code representing a vertex of the intermediate layer grid cell in the fifth to seventh bits of the 64-bit grid code; increasing a grid code representing a level of the intermediate layer grid cell in the eighth to eleventh bits of the 64-bit grid code, wherein the level of the intermediate layer grid cell is an intermediate value of the level of the basic grid cell and a previous level of the basic grid cell.

4. The method of claim 1, wherein, The determining of the center point of the to-be-generated intermediate layer grid cell according to the common vertices of the basic grid cell, and the determining of the area of the to-be-generated intermediate layer grid cell according to the area of the basic grid cell, comprise: obtaining a target number and a code combination of a basic grid cell to which the common vertices belong; if a maximum value of the target number is a first preset value, determining the corresponding common vertex as the center point of the to-be-generated intermediate layer grid cell; if the maximum value of the target number is a second preset value, screening the center point of the to-be-generated intermediate layer grid cell from the common vertex corresponding to the target number being a third preset value according to the code combination; Determine a three times area of the base grid cell as an area of the intermediate layer grid cell to be generated.

5. The method of claim 1, wherein, The aggregating the base grid cells mapped by the vector region to be observed according to the valid degree number to obtain the intermediate layer grid cell further includes: Obtain a minimum valid degree number from the valid degree number; If the minimum value is 1, aggregate a first base grid cell corresponding to the minimum valid degree number and a base grid cell adjacent to the first base grid cell to obtain an intermediate layer grid cell; If the minimum value is greater than 1, obtain a second base grid cell adjacent to the first base grid cell; In a case where it is determined that the first base grid cell and the second base grid cell are combined into three base grid cell combinations adjacent to each other, obtain a target valid degree sum of the three base grid cell combinations; Aggregate the three base grid cell combinations with the minimum target valid degree sum to obtain an intermediate layer grid cell.

6. The method of claim 5, wherein, After the obtaining of the minimum valid degree number from the valid degree number, the method further includes: If the minimum value is 0, change the valid degree number of the base grid cell corresponding to the minimum valid degree number to a target value; Determine a third base grid cell participating in aggregation; Change the valid degree number of the third base grid cell to the target value; In a case where it is detected that the valid degree numbers of the base grid cells mapped by the vector region to be observed are all the target value, end the aggregation operation.

7. The method of claim 6, wherein, After the determining of the third base grid cell participating in aggregation, the method further includes: Obtain an adjacency relationship of the base grid cell; Generate an adjacency list according to the adjacency relationship; Traverse the adjacency list to obtain a fourth base grid cell adjacent to the third base grid cell; Reduce the valid degree number of the fourth base grid cell by 1.

8. A mesh generation apparatus characterized by comprising: The device includes: A first obtaining module configured to obtain key information of base grid cells mapped by a vector region to be observed, the key information including a number, an area and a common vertex of the base grid cells; A first determining module configured to, if the number is greater than 1 and less than or equal to a first preset value, determine a center point of an intermediate layer grid cell to be generated according to the common vertex of the base grid cells, and determine an area of the intermediate layer grid cell to be generated according to the area of the base grid cells; A first aggregating module configured to aggregate the base grid cells mapped by the vector region to be observed according to the center point and the area of the intermediate layer grid cell to be generated to obtain an intermediate layer grid cell; A second obtaining module configured to, if the number is greater than the first preset value, obtain a valid degree number of the base grid cells, the valid degree number being a number of base grid cells adjacent to the base grid cells and not aggregated; A second aggregating module configured to aggregate the base grid cells mapped by the vector region to be observed according to the valid degree number to obtain an intermediate layer grid cell.

9. An electronic device, comprising: The device includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus; The memory is used to store a computer program. The processor is configured to implement the mesh generation method according to any one of claims 1-7 when executing the program stored in the memory. 10.A computer-readable storage medium having stored thereon instructions that, when executed by one or more processors, cause the processors to perform the mesh generation method according to any one of claims 1-7.

Images