Adaptive step-by-step grid encryption method and device based on hexahedral grid units

Abstract

The present invention discloses an adaptive step-by-step mesh encryption method and device based on hexahedral mesh units, wherein the method comprises: obtaining an initial hexahedral mesh model, a target position, and a unit scale required by a user; determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as the area to be encrypted; judging whether the scale of the largest unit in the area to be encrypted meets the unit scale required by the user, and if the judgment result is "no", encrypting all units in the area to be encrypted at once. The adaptive step-by-step mesh encryption method and device based on hexahedral mesh units disclosed by the present invention can adaptively encrypt the required area according to the target position specified by the user, thereby improving the flexibility of mesh model construction, effectively relocating and processing the area to be encrypted, avoiding unnecessary calculations, improving the efficiency of mesh encryption, and performing more flexible, efficient, and reasonable mesh unit encryption.

Description

Technical Field

[0001] The present invention relates to the field of geophysical technology, and in particular to a self-adaptive step-by-step grid encryption method and device based on hexahedral grid units. Background Art

[0002] In numerical simulations and emulations in fields such as geophysics, appropriate mesh resolution is crucial for accurately capturing complex physical phenomena. Using a uniformly refined mesh across the entire model often results in wasted computing resources and inefficiencies. However, geometric singularities created by localized mesh refinement can make it difficult to ensure computational stability and accuracy. To improve simulation accuracy and efficiency, a method for localized mesh refinement that ensures computational stability and accuracy is needed.

[0003] Traditional mesh refinement methods can generally be divided into two categories: one method automatically adjusts the mesh resolution based on simulation results (such as the gradient or change of physical quantities); the other method is through user interaction. Through graphical user interface (GUI) tools and scripts, the user sets parameters and adaptively refines the mesh based on the characteristics of the model (such as curvature, gradient, and edge, etc.), so that the feature area has a higher resolution. The user can also specify the model area and re-divide the mesh.

[0004] However, when users specify model areas for mesh encryption, the specified areas are often geometric bodies or collections existing in the model. In order to ensure geometric continuity, the mesh around the encrypted area often also requires a certain degree of encryption, which can easily lead to difficulties in maintaining geometric continuity and zero volume unit problems, and the efficiency, flexibility and convenience are also poor. Summary of the Invention

[0005] The purpose of the present invention is to provide an adaptive step-by-step mesh encryption method and device based on hexahedral mesh units, which can solve the problem of maintaining geometric continuity and the zero volume unit problem, and realize flexible, efficient and convenient local encryption of unit meshes.

[0006] To achieve the above object, the present invention provides an adaptive step-by-step mesh encryption method based on hexahedral mesh units, comprising:

[0007] Acquisition step: obtaining the initial hexahedral mesh model, target position and unit scale required by the user;

[0008] Determining step: determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as the area to be encrypted;

[0009] Judgment step: judging whether the size of the largest unit in the area to be encrypted meets the unit size required by the user;

[0010] Encryption step: If the judgment result is "no", all cells in the encryption area are encrypted once.

[0011] In one embodiment of the present invention, all units in the area to be encrypted are encrypted once, including:

[0012] Equal unit division step: each hexahedral unit of the area to be encrypted is divided into three equal parts in three directions to obtain 27 hexahedral subunits;

[0013] Node moving step: Move each newly added node that does not overlap with the original node on the boundary of the current encryption area to the nearest original node on the boundary, so that the nodes of each sub-unit are all nodes of the adjacent unit;

[0014] Delete unit step: delete the zero-volume subunits and redundant nodes generated after the move node step;

[0015] Number Nodes Step: Renumber all nodes in the hexahedral mesh model.

[0016] In one embodiment of the present invention, after the determining step, the method further includes:

[0017] If the judgment result is "yes", the encryption ends.

[0018] In one embodiment of the present invention, after the encryption step, the method further includes:

[0019] The determining step and the judging step are re-executed until the size of the largest unit in the area to be encrypted meets the unit size required by the user.

[0020] In one embodiment of the present invention, an adaptive step-by-step mesh encryption device based on hexahedral mesh units includes:

[0021] An acquisition module is used to obtain the initial hexahedral mesh model, target position and unit scale required by the user;

[0022] A determination module, configured to determine a minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as an area to be encrypted;

[0023] A judgment module is used to judge whether the size of the largest unit in the area to be encrypted meets the unit size required by the user;

[0024] The encryption module is used to encrypt all the units in the encryption area if the judgment result is "no".

[0025] In one embodiment of the present invention, the encryption module includes:

[0026] A unit division submodule is used to divide each hexahedral unit of the area to be encrypted into three equal parts in three directions to obtain 27 hexahedral subunits;

[0027] The node moving submodule is used to move each newly added node generated on the boundary of the current encryption area that does not overlap with the original node to the nearest original node on the boundary, so that the nodes of each subunit are all nodes of the adjacent units;

[0028] The deletion submodule is used to delete the zero-volume grid cells and redundant nodes generated after moving the nodes;

[0029] The Number Nodes submodule is used to renumber all nodes in the hexahedral mesh model.

[0030] In one embodiment of the present invention, the judgment module is further configured to terminate encryption if the judgment result is "yes".

[0031] In one embodiment of the present invention, the encryption module further comprises: re-executing the determination module and the judgment module until the size of the largest unit of the area to be encrypted meets the unit size required by the user.

[0032] In one embodiment of the present invention, an electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the steps of the adaptive step-by-step grid encryption method based on hexahedral grid units as described above are implemented.

[0033] In one embodiment of the present invention, a non-transitory computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of any of the above-described adaptive hierarchical grid encryption methods based on hexahedral grid units.

[0034] In one embodiment of the present invention, a computer program product includes a computer program, which, when executed by a processor, implements the steps of any of the above-mentioned adaptive hierarchical grid encryption methods based on hexahedral grid units.

[0035] Compared with the prior art, the adaptive step-by-step mesh encryption method and device based on hexahedral mesh units according to the present invention has the beneficial effects of being able to adaptively encrypt in the target area through the target position specified by the user, and being adaptive and flexible; satisfying the unit coordination principle by moving nodes and deleting zero-volume units and redundant nodes, and being able to avoid the appearance of new nodes on the unit surface at the boundary of the encrypted area after encryption, and being able to solve the singularity problem during the force balance calculation and analysis of the newly added nodes; being able to effectively reposition and process the area to be encrypted through step-by-step encryption, and avoiding unnecessary calculations for the entire mesh model, and being able to improve the efficiency of mesh encryption, and being highly efficient. In summary, it is possible to achieve more flexible, efficient, and reasonable mesh encryption at the position specified by the user, and to adapt to the scale requirements of different models. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 1 is a flow chart of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0037] Figure 2 This is one of the schematic diagrams showing the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to one embodiment of the present invention;

[0038] Figure 3 This is a second schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0039] Figure 4 This is a third schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0040] Figure 5 This is a fourth schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0041] Figure 6 5 is a schematic diagram showing the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0042] Figure 7 6 is a schematic diagram showing the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0043] Figure 8 7 is a schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0044] Figure 9FIG8 is an eighth schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0045] Figure 10 9 is a schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0046] Figure 11 10 is a schematic diagram showing the effect of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0047] Figure 12 11 is an eleventh schematic diagram of the effect of the adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0048] Figure 13 12 is a schematic diagram showing the effect of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0049] Figure 14 13 is a schematic diagram showing the effect of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0050] Figure 15 14 is a schematic diagram showing the effect of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0051] Figure 16 FIG15 is a schematic diagram showing the effect of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0052] Figure 17 16 is a schematic diagram showing the effect of an adaptive step-by-step mesh refinement method based on hexahedral mesh units according to an embodiment of the present invention;

[0053] Figure 18 1 is a schematic structural diagram of an adaptive step-by-step grid encryption device based on hexahedral grid units according to an embodiment of the present invention;

[0054] Figure 19 FIG. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0055] The specific embodiments of the present invention are described in detail below with reference to the accompanying drawings, but it should be understood that the protection scope of the present invention is not limited by the specific embodiments.

[0056] Unless expressly stated otherwise, throughout the specification and claims, the term “comprise” or variations such as “include” or “comprising” will be understood to include the stated elements or components but not to exclude other elements or components.

[0057] like Figures 1 to 19 As shown, the adaptive step-by-step mesh encryption method and apparatus based on hexahedral mesh units according to a preferred embodiment of the present invention can be implemented in the following manner.

[0058] Figure 1 FIG. 1 is a flow chart of an adaptive step-by-step mesh encryption method based on hexahedral mesh units according to an embodiment of the present invention. Figure 1 As shown, the method may include the following steps:

[0059] Step 101, acquisition step: acquiring an initial hexahedral mesh model, a target position, and a unit scale required by the user.

[0060] Specifically, based on the graphical user interface, initial information such as the initial hexahedral mesh model specified by the user, the target position, and the unit scale required by the user can be obtained.

[0061] The initial hexahedral mesh model refers to the initial model obtained by dividing the model into hexahedral mesh units. The specific shape of the initial model is not limited in the present embodiment. The initial model can describe the geometric structure of the ground, faults, mountains, or rivers.

[0062] The initial hexahedral mesh model may include multiple meshes. Each mesh may be referred to as a mesh unit or a unit. The mesh unit is in the shape of a hexahedron (generally a cube or a cuboid), and thus each mesh unit is a hexahedral mesh unit.

[0063] The target location is the location or range where mesh refinement is required. Target locations can include multiple locations and / or multiple ranges. Multiple refers to one or more.

[0064] The user-required unit scale refers to the desired size of the mesh unit after encryption. The grid unit scale can correspond to the length. For example, depending on the numerical simulation and emulation requirements, the grid unit scale can be 10 meters or 1 kilometer. The specific value of the grid encryption scale is not limited in this embodiment of the present invention.

[0065] Step 102, determination step: determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as the area to be encrypted.

[0066] Specifically, the minimum hexahedral grid unit region refers to a region consisting of the smallest number of combinations among all combinations of hexahedral grid units that are composed of at least one hexahedral grid unit and include the target location.

[0067] It should be noted that, by encrypting the grid, the density of the grid can be increased. In the embodiment of the present invention, encrypting refers to increasing the density of the grid.

[0068] Step 103: Determine whether the size of the largest unit in the area to be encrypted meets the unit size required by the user.

[0069] Step 104, encryption step: If the judgment result is "no", all units in the area to be encrypted are encrypted once.

[0070] In some implementations, after the determination step, the method further includes: if the determination result is "yes", terminating the encryption.

[0071] In some embodiments, after the encryption step, the method further includes: re-performing the determination step and the judgment step until the size of the largest unit in the area to be encrypted meets the unit size required by the user.

[0072] Specifically, it is determined whether the size b of the largest unit in the area to be encrypted meets the unit size a required by the user. In other words, it is determined whether b ≤ a. If b ≤ a, encryption is completed; otherwise, all units in the area to be encrypted are encrypted once, and steps 102 and 103 are repeated until encryption is complete.

[0073] For example, the user's required unit scale a is 10 meters; when the scale b of the largest unit in the area to be encrypted is 8 meters, the current scale of the largest unit in the area to be encrypted can already meet the user's needs, and no grid encryption is required; when b is 15 meters or 30 meters, the current scale of the largest unit in the area to be encrypted does not meet the user's needs, and grid encryption is required for all units in the area to be encrypted.

[0074] In the case of b>a, mesh refinement is performed on all cells in the area to be refined, which may include:

[0075] Equal division unit step: Each hexahedral unit in the area to be encrypted is divided into three equal parts along the X, Y, and Z axes to obtain 27 hexahedral subunits;

[0076] Node Move Steps: Each mesh cell before cell encryption is called an original mesh cell. Each newly generated cell after cell encryption is called a sub-cell of the original mesh cell. The vertices of each original mesh cell are called original nodes, and the vertices of each sub-cell are newly added nodes. Newly added nodes can be of two types: those generated on the faces of the original hexahedral mesh cell and those generated within the original hexahedral mesh cell.

[0077] The newly added nodes generated on the surface of the original hexahedral grid unit can include two categories: one is the newly added nodes whose positions coincide with the positions of the original nodes; the other is the newly added nodes whose positions do not coincide with the positions of the original nodes.

[0078] According to the principle of unit coordination, the nodes of a unit must also be the nodes of the adjacent units, and should not be internal points or boundary points belonging to only a single unit. Each new node generated on the outer boundary surface of the boundary unit of this encrypted area that does not overlap with the original node position is moved to the nearest original node on the boundary, so that the nodes of each sub-unit are the nodes of the adjacent units.

[0079] Delete Elements and Nodes: Deletes zero-volume mesh elements and redundant nodes generated after the Move Nodes step. Zero-volume mesh elements are hexahedral mesh elements with eight nodes in the same position, obtained by moving newly added nodes and stretching the corresponding hexahedral subelements.

[0080] Number Nodes Step: Renumber all nodes in the model. By renumbering all nodes in the model, you can ensure consistency in node naming rules across the entire mesh.

[0081] After executing the sub-steps in step 104, the encryption process of all the units in the area to be encrypted is completed.

[0082] Then, step 102 and step 103 are executed until the size b of the largest unit in the area to be encrypted in step 103 meets the unit size a required by the user (ie, b≤a).

[0083] It is understood that by performing mesh encryption on the area to be encrypted, the size b of the largest unit in the area to be encrypted will be reduced. b will be reduced once each level of mesh encryption is performed on the area to be encrypted.

[0084] To facilitate understanding of the above embodiments of the present invention, the effect of grid encryption is described below with reference to specific scenarios.

[0085] According to different needs of users, the grid encryption method provided by the above embodiments of the present invention can be used in different scenarios such as point-like rapid hierarchical encryption of a single unit, linear rapid hierarchical encryption of a string of unit groups, and surface rapid hierarchical encryption of a row of unit groups.

[0086] For example, if a user drills a hole at a certain point and the grid scale at that location is too large, a single-point encryption calculation can be performed; for example, if a narrow strip of small fault area needs to be encrypted, a string of unit group encryption technology can be used; for example, if a block area needs to be encrypted, a row of unit group encryption technology can be used.

[0087] Figures 2 to 7 This example shows a point-based rapid hierarchical encryption of a single cell. In an initial hexahedral mesh model with 48 cells, cells 1, 11, 21, and 31 (using the cells to be encrypted corresponding to the user-specified target location as an example, but not limited to these cells) are selected for three levels of encryption. After each level of encryption, the maximum cell size (b) is reduced to 1 / 3 of the original size. After three levels of encryption, the maximum cell size (b) is reduced to 1 / 27 of the original mesh size.

[0088] It should be noted that the original number of the unit may be assigned by the modeling software according to certain rules when the user creates the model of the initial value. The above-mentioned units constituting the area to be encrypted can be found through the program.

[0089] It is understood that cells 1, 11, 21, and 31 are illustrative examples, and in actual applications, one or more cells can be selected based on user needs. For example, if a user needs to infill a certain borehole location, they can enter the borehole's latitude and longitude as the target range. In the initial hexahedral mesh model, the cell containing that point can be found and encrypted as the area to be infilled.

[0090] in, Figure 2 The initial hexahedral mesh model is shown; Figure 3 The locally refined grid cells are shown (isograph); Figure 4 The figure shows the mesh unit after local encryption (side view in the X-axis direction); Figure 5 The figure shows the locally encrypted grid unit (side view in the Y-axis direction); Figure 6 The figure shows the mesh unit after local encryption (side view in the Z-axis direction); Figure 7 Unit No. 1 is shown after level 3 encryption (isotropic view).

[0091] Figures 8 to 12 This example shows a linear, hierarchical, and rapid densification of a group of cells. In an initial hexahedral mesh model with 48 cells, cells 31, 32, 33, 34, 35, 36, 4, 10, 16, and 22 (including the cells corresponding to the user-specified target location, but not limited to these cells) are selected for three levels of densification. With each level of densification, the maximum cell size b is reduced to 1 / 3 of the original size. After three levels of densification, the maximum cell size b is reduced to 1 / 27 of the original mesh size.

[0092] in, Figure 8 The initial hexahedral mesh model is shown; Figure 9 The locally refined grid cells are shown (isograph); Figure 10 The figure shows the mesh unit after local encryption (side view in the X-axis direction); Figure 11 The figure shows the locally encrypted grid unit (side view in the Y-axis direction); Figure 12 The partially encrypted mesh unit is shown (side view in the Z-axis direction).

[0093] Figures 13 to 17 This example demonstrates how to achieve localized mesh densification through planar rapid hierarchical densification of multiple rows of cell groups. In an initial hexahedral mesh model with 72 cells, cells 4, 5, 6, 10, 11, 12, and 28, 29, 30, 34, 35, and 36 are selected (these cells correspond to the user-specified target location in the area to be densified as an example, but are not limited to these cells). The selected cells are densified along the shared surface between the two groups. After two levels of densification, the maximum cell size b on either side of the shared surface is reduced to 1 / 9 of the original mesh.

[0094] in, Figure 13 The initial hexahedral mesh model is shown; Figure 14 The locally refined grid cells are shown (isograph); Figure 15 The figure shows the mesh unit after local encryption (side view in the X-axis direction); Figure 16 The figure shows the locally encrypted grid unit (side view in the Y-axis direction); Figure 17 The partially encrypted mesh unit is shown (side view in the Z-axis direction).

[0095] The beneficial effects of the present invention are that, through the target position specified by the user, it can adaptively encrypt the target area, which is adaptive and flexible; by moving nodes and deleting zero-volume units and redundant nodes, the unit coordination principle is met, which can avoid the appearance of new nodes on the unit surface at the boundary of the encrypted area after encryption, and can solve the singularity problem in the force balance calculation and analysis of the newly added nodes; through step-by-step encryption, it can effectively reposition and process the area that needs to be encrypted, avoid unnecessary calculations for the entire grid model, improve the efficiency of grid encryption, and be highly efficient. In summary, it can achieve more flexible, efficient, and reasonable grid encryption at the position specified by the user, and can adapt to the requirements of different model scales.

[0096] It should be noted that when meshing a region, new nodes and elements are typically added, which can cause discontinuities at the boundaries of the mesh being meshed, disrupting the geometric continuity of the mesh model. The aforementioned embodiments of the present invention enable local meshing within a designated region without affecting the mesh surrounding the mesh being meshed, ensuring geometric continuity and facilitating maintenance. This addresses the maintenance challenge of geometric continuity.

[0097] It should be noted that when performing continuity-guaranteed adaptive mesh encryption, the generated unit volume may be too small or even zero. This problem may cause numerical instability, lead to inaccurate simulation results, and even render the numerical method invalid. In the above embodiments of the present invention, after the mesh is encrypted, geometric continuity is ensured by moving certain nodes to existing nodes, and when it is determined that the eight nodes of the hexahedron are in the same position, it is a zero-volume unit, which is deleted, thereby solving the zero-volume unit problem.

[0098] It should be noted that traditional adaptive mesh encryption technology usually requires users to perform detailed parameter settings and adjustments before mesh encryption. The above parameters may include gradient thresholds and encryption strategies, etc. This requires users to have an in-depth understanding of the model and simulation process, increases the threshold for use, and may also lead to subjective differences between different users when setting parameters, thereby affecting the accuracy of the simulation results. In the above embodiments of the present invention, users can specify the positions of virtual points, lines, surfaces or bodies, that is, they do not have to be actually defined as part of the geometric model. After the user flexibly specifies the area of ​​interest in the simulation or analysis, the unit position within the minimum range involved can be automatically found in the model for encryption based on the user-specified virtual position (which can be used as all or part of the target position) and the required unit scale. The mesh resolution of the model can be controlled more finely, flexibly and conveniently to meet specific numerical simulation requirements without being restricted by the geometric model. Furthermore, during mesh densification, after each densification step, it is necessary to effectively determine whether the scale of the largest cell in the area to be densified meets the user's desired cell scale. If not, the newly generated cell is searched for all cells within the minimum range that contains the target location, and these cells are re-identified as the area to be densified for the next level of densification. This cycle significantly improves efficiency. In summary, this allows for flexible, efficient, and convenient local densification of cell meshes.

[0099] The adaptive step-by-step mesh encryption device based on hexahedral mesh units provided by the present invention is described below. The adaptive step-by-step mesh encryption device based on hexahedral mesh units described below and the adaptive step-by-step mesh encryption method based on hexahedral mesh units described above can be referred to each other.

[0100] Figure 18Schematic diagram of the structure of the adaptive step-by-step grid encryption device based on hexahedral grid units provided by the present invention. Figure 18 As shown, the device includes an acquisition module 1801, a determination module 1802, a judgment module 1803 and an encryption module 1804, wherein:

[0101] An acquisition module 1801 is used to acquire an initial hexahedral mesh model, a target position, and a unit scale required by the user;

[0102] A determination module 1802 is configured to determine a minimum hexahedral mesh region containing a target position in the initial hexahedral mesh model as a region to be encrypted;

[0103] The judgment module 1803 is used to judge whether the size of the largest unit of the area to be encrypted meets the unit size required by the user. If so, the encryption ends; if not, the encryption module is executed;

[0104] The encryption module 1804 encrypts all the cells in the encryption area once, and repeatedly calls the determination module 1802 and the judgment module 1803 until the encryption is completed.

[0105] The adaptive step-by-step mesh encryption device based on hexahedral mesh units provided in an embodiment of the present invention is used to execute the above-mentioned adaptive step-by-step mesh encryption method based on hexahedral mesh units of the present invention. Its implementation method is consistent with the implementation method of the adaptive step-by-step mesh encryption method based on hexahedral mesh units provided by the present invention, and can achieve the same beneficial effects, which will not be repeated here.

[0106] This adaptive step-by-step mesh encryption device based on hexahedral mesh cells is used in the adaptive step-by-step mesh encryption method based on hexahedral mesh cells in the aforementioned embodiments. Therefore, the descriptions and definitions of the adaptive step-by-step mesh encryption method based on hexahedral mesh cells in the aforementioned embodiments can be used to understand the various execution modules in the embodiments of the present invention.

[0107] In some feasible implementations, the encryption module 1804 may include:

[0108] A unit division submodule is used to divide each hexahedral unit of the area to be encrypted into three equal parts in three directions to obtain 27 hexahedral subunits;

[0109] The node moving submodule is used to move each newly added node generated on the boundary of the current encryption area that does not overlap with the original node to the nearest original node on the boundary, so that the nodes of each subunit are all nodes of the adjacent units;

[0110] The deletion submodule is used to delete zero-volume grid cells and redundant nodes generated during the encryption process;

[0111] The Number Nodes submodule is used to renumber all nodes in the model.

[0112] In some feasible implementations, the judgment module 1803 is further configured to terminate encryption if the judgment result is "yes".

[0113] In some feasible implementations, after the encryption module 1804 , the method further includes: re-executing the determination module and the judgment module until the size of the largest unit in the area to be encrypted meets the unit size required by the user.

[0114] Figure 19 An example of a physical structure diagram of an electronic device is shown below. Figure 19 As shown, the electronic device may include: a processor 1901, a communications interface 1902, a memory 1903, and a communications bus 1904, wherein the processor 1901, the communications interface 1902, and the memory 1903 communicate with each other via the communications bus 1904. The processor 1901 may call logic instructions in the memory 1903 to execute an adaptive hierarchical mesh encryption method based on hexahedral mesh cells, the method comprising: an acquisition step: acquiring an initial hexahedral mesh model, a target location, and a user-required cell scale; a determination step: determining the minimum hexahedral mesh region containing the target location in the initial hexahedral mesh model as the region to be encrypted; a judgment step: determining whether the scale of the largest cell in the region to be encrypted meets the user-required cell scale; and an encryption step: if the judgment result is "no," encrypting all cells in the region to be encrypted.

[0115] In addition, the logic instructions in the above-mentioned memory 1903 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0116] The processor 1901 in the electronic device provided in an embodiment of the present invention can call the logic instructions in the memory 1903. Its implementation method is consistent with the implementation method of the adaptive step-by-step grid encryption method based on hexahedral grid units provided by the present invention, and can achieve the same beneficial effects, which will not be repeated here.

[0117] On the other hand, the present invention also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the adaptive step-by-step grid encryption method based on hexahedral grid units provided by the above methods, and the method includes: an acquisition step: obtaining the initial hexahedral grid model, the target position and the unit scale required by the user; a determination step: determining the minimum hexahedral grid area containing the target position in the initial hexahedral grid model as the area to be encrypted; a judgment step: judging whether the scale of the largest unit in the area to be encrypted meets the unit scale required by the user; an encryption step: if the judgment result is "no", all units in the area to be encrypted are encrypted once.

[0118] When the computer program product provided by the embodiment of the present invention is executed, the above-mentioned adaptive step-by-step grid encryption method based on hexahedral grid units is implemented. Its specific implementation method is consistent with the implementation method described in the embodiment of the aforementioned method, and can achieve the same beneficial effects, which will not be repeated here.

[0119] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the above-mentioned adaptive step-by-step grid encryption method based on hexahedral grid units, the method comprising: an acquisition step: acquiring an initial hexahedral grid model, a target position and a unit scale required by the user; a determination step: determining the minimum hexahedral grid area containing the target position in the initial hexahedral grid model as the area to be encrypted; a judgment step: judging whether the scale of the largest unit in the area to be encrypted meets the unit scale required by the user; an encryption step: if the judgment result is "no", all units in the area to be encrypted are encrypted once.

[0120] When the computer program stored on the non-transitory computer-readable storage medium provided by the embodiment of the present invention is executed, the above-mentioned adaptive step-by-step grid encryption method based on hexahedral grid units is implemented. Its specific implementation method is consistent with the implementation method described in the embodiment of the aforementioned method, and can achieve the same beneficial effects, which will not be repeated here.

[0121] It will be understood by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0122] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0123] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0124] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0125] The foregoing descriptions of specific exemplary embodiments of the present invention are for purposes of illustration and description. These descriptions are not intended to limit the invention to the precise forms disclosed, and it is apparent that many variations and modifications are possible in light of the foregoing teachings. The exemplary embodiments have been selected and described for the purpose of explaining the specific principles of the invention and their practical application, thereby enabling those skilled in the art to realize and utilize a variety of exemplary embodiments of the invention and various options and modifications. The scope of the invention is intended to be defined by the claims and their equivalents.

Claims

1. An adaptive step-by-step mesh refinement method based on hexahedral mesh units, characterized in that: The steps include: Acquisition step: obtaining the initial hexahedral mesh model, target position and unit scale required by the user; Determining step: determining the minimum hexahedral grid area containing the target location in the initial hexahedral grid model as the area to be encrypted; the minimum hexahedral grid unit area refers to the area consisting of the smallest number of combinations of all hexahedral grid units consisting of at least one hexahedral grid unit containing the target location; the initial model is used to depict the geometric structure of the ground, fault, mountain or river; Judgment step: judging whether the size of the largest unit in the area to be encrypted meets the unit size required by the user; Encryption step: If the judgment result is "no", all cells in the encryption area are encrypted once; The encryption of all units in the area to be encrypted includes: Equal unit division step: each hexahedral unit of the area to be encrypted is divided into three equal parts in three directions to obtain 27 hexahedral subunits; Node moving step: Move each newly added node that does not overlap with the original node on the boundary of the current encryption area to the nearest original node on the boundary, so that the nodes of each sub-unit are all nodes of the adjacent unit; Delete unit and node step: delete the zero-volume subunits and redundant nodes generated after the move node step; Number Nodes Step: Renumber all nodes in the hexahedral mesh model.

2. The adaptive step-by-step mesh encryption method based on hexahedral mesh units according to claim 1, characterized in that: After the judging step, the method further includes: If the judgment result is "yes", the encryption is terminated.

3. The adaptive step-by-step mesh encryption method based on hexahedral mesh units according to claim 1, characterized in that: After the encryption step, the method further comprises: The determining step and the judging step are re-executed until the size of the largest unit in the area to be encrypted meets the unit size required by the user.

4. An adaptive step-by-step grid encryption device based on hexahedral grid units, characterized in that: include: An acquisition module is used to obtain the initial hexahedral mesh model, target position and unit scale required by the user; a determination module, configured to determine a minimum hexahedral grid region containing the target location in the initial hexahedral grid model as a region to be encrypted; the minimum hexahedral grid unit region refers to a region consisting of the smallest number of combinations of hexahedral grid units consisting of at least one hexahedral grid unit containing the target location; the initial model is used to depict the geometric structure of the ground, fault, mountain, or river; A judgment module is used to judge whether the size of the largest unit in the area to be encrypted meets the unit size required by the user; The encryption module is used to encrypt all cells in the encryption area if the judgment result is "no"; The encryption module includes: A unit division submodule is used to divide each hexahedral unit of the area to be encrypted into three equal parts in three directions to obtain 27 hexahedral subunits; The node moving submodule is used to move each newly added node generated on the boundary of the current encryption area that does not overlap with the original node to the nearest original node on the boundary, so that the nodes of each subunit are all nodes of the adjacent units; Deletion submodule, used to delete zero-volume subunits and redundant nodes generated after moving nodes; The Number Nodes submodule is used to renumber all nodes in the hexahedral mesh model.

5. The adaptive step-by-step grid encryption device based on hexahedral grid units according to claim 4, characterized in that: The judgment module is further configured to terminate encryption if the judgment result is "yes".

6. The adaptive step-by-step grid encryption device based on hexahedral grid units according to claim 4, characterized in that: The encryption module further includes: The determination module and the judgment module are re-executed until the size of the largest unit in the area to be encrypted meets the unit size required by the user.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the steps of the adaptive step-by-step grid encryption method based on hexahedral grid units as claimed in any one of claims 1 to 3 are implemented.

8. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the adaptive hierarchical mesh encryption method based on hexahedral mesh units are implemented.

Images