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

Abstract

The invention discloses a self-adaptive step-by-step grid encryption method and device based on hexahedral grid units, and the method comprises the steps: obtaining an initial hexahedral grid model, a target position and a unit scale required by a user; determining a minimum hexahedral mesh region containing a target position in the initial hexahedral mesh model as a to-be-encrypted region; and judging whether the scale of the maximum unit of the to-be-encrypted area meets the unit scale required by the user, and if the judgment result is negative, performing primary encryption on all units of the to-be-encrypted area. According to the self-adaptive step-by-step grid encryption method and device based on the hexahedral grid units, encryption can be carried out in a needed area in a self-adaptive mode through the target position specified by the user, the flexibility of grid model construction can be improved, the area needing encryption can be effectively repositioned and processed, unnecessary calculation is avoided, and the encryption efficiency is improved. The grid encryption efficiency can be improved, and more flexible, efficient and reasonable grid unit encryption can be carried out.

Description

Technical Field

[0001] The 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 simulation and emulation in fields such as geophysics, appropriate grid resolution is crucial to accurately capture complex physical phenomena. Using uniformly encrypted grids for the entire model usually leads to waste of computing resources and inefficiency. However, the geometric singularities generated by local unit grid encryption make it difficult to ensure the stability and accuracy of the calculation. In order to improve the accuracy and efficiency of the simulation, a local unit grid encryption method that can ensure the stability and accuracy of the calculation is needed.

[0003] Traditional mesh encryption methods can generally be divided into two categories: one method is to automatically adjust the mesh resolution according to the simulation results (such as the gradient or change of physical quantities, etc.); the other method is to interact with the user, through graphical user interface (GUI) tools and scripts, etc., the user sets parameters and adaptively encrypts the mesh according to 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 the user specifies the model area for mesh encryption, the specified area is often a geometric body or collection existing in the model, and in order to ensure geometric continuity, the mesh around the encrypted area often also requires a certain degree of encryption, which can easily cause 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 of 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] The step of equally dividing the unit is as follows: each hexahedral unit of the area to be encrypted is equally divided into three parts in three directions to obtain 27 hexahedral subunits;

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

[0014] Deleting unit step: deleting zero-volume subunits and redundant nodes generated after moving nodes 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 executed again until the size of the largest unit of 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 comprises:

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

[0022] A determination module, used for determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as the area to be encrypted;

[0023] A judgment module, used to judge whether the size of the largest unit of 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] The 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 mobile node 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 position to the nearest original node on the boundary, so that the nodes of each subunit are the 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 a hexahedral mesh model.

[0030] In one implementation manner 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 any of the above-mentioned adaptive step-by-step grid encryption methods based on hexahedral grid units 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-mentioned adaptive step-by-step grid encryption methods based on hexahedral grid units.

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

[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 that, through the target position specified by the user, it can adaptively encrypt in the target area, and has adaptability and flexibility; through the operation of moving nodes and deleting zero volume units and redundant nodes, the unit coordination principle is met, and the appearance of new nodes on the boundary unit surface of the encrypted area after encryption can be avoided, and the singularity problem in the calculation and analysis of the force balance of the newly added nodes can be solved; through step-by-step encryption, the area to be encrypted can be effectively relocated and processed, and unnecessary calculations for the entire mesh model can be avoided, which can improve the efficiency of mesh encryption and has high efficiency. In summary, more flexible, efficient and reasonable mesh encryption can be achieved at the position specified by the user, and the scale requirements of different models can be adapted. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0037] Figure 2 This is one of the schematic diagrams of the effect of the adaptive step-by-step mesh encryption 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 encryption 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 encryption 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 encryption method based on hexahedral mesh units according to an embodiment of the present invention;

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

[0042] Figure 7 This is a sixth schematic diagram of the effect of the adaptive step-by-step mesh encryption 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 an adaptive step-by-step mesh encryption method based on hexahedral mesh units according to an embodiment of the present invention;

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

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

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

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

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

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

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

[0051] Fig.16 15 is a schematic diagram of the effect of an adaptive step-by-step mesh encryption method based on hexahedral mesh units according to an embodiment of the present invention;

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

[0053] Fig.18 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] Fig.19 is a schematic structural diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

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

[0056] Unless explicitly 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 device based on hexahedral mesh units according to the 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 a 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 embodiment of the present invention. The initial model can describe the geometric structure of the ground, fault, mountain or river.

[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), so each mesh unit is a hexahedral mesh unit.

[0063] The target position is the position or range where mesh encryption is required. The target position may include several positions and / or several ranges. Several refers to one or more.

[0064] The unit scale required by the user refers to the scale that the encrypted grid unit needs to reach. The scale of the grid unit can correspond to the length. For example, according to the numerical simulation and simulation requirements, the scale of different grid units can be 10 meters or 1 kilometer, etc. The specific value of the grid encryption scale is not limited in the 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 of 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 the density of the grid can be increased by encrypting the grid. In the embodiment of the present invention, encrypting refers to increasing the density of the grid.

[0068] Step 103, judgment step: judging whether the size of the largest unit of 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 the units in the area to be encrypted are encrypted once.

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

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

[0072] Specifically, it can be determined whether the scale b of the largest unit in the area to be encrypted reaches the unit scale a required by the user. That is, it can be determined whether b≤a is satisfied. 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 completed.

[0073] For example, the unit scale a required by the user 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 there is no need to perform grid encryption; 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 it is necessary to perform grid encryption on all units in the area to be encrypted.

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

[0075] Unit division step: divide each hexahedral unit of the area to be encrypted into three equal parts in the three directions of X, Y and Z axes to obtain 27 hexahedral subunits;

[0076] Steps for moving nodes: Each mesh unit before unit encryption is called an original mesh unit, and each newly generated unit after unit encryption is called a sub-unit of the original mesh unit. The vertex of each original mesh unit is called an original node, and the vertex of each sub-unit is a newly added node. The newly added nodes can be divided into two categories: one is generated on the surface of the original hexahedral mesh unit; the other is generated inside the body of the original hexahedral mesh unit.

[0077] The newly added nodes generated on the surface of the original hexahedral grid unit may 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 in the 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 subunit are the nodes of the adjacent units.

[0079] Delete unit and node step: Delete zero-volume mesh units and redundant nodes generated after the node moving step. Zero-volume mesh units refer to hexahedral mesh units with 8 nodes located at the same position, which are obtained by moving the newly added nodes and stretching the corresponding hexahedral subunits.

[0080] Number Nodes Step: Renumber all nodes in the model. By renumbering all nodes in the model, you can ensure consistency in node naming conventions 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 is satisfied).

[0083] It can be 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. Each time a level of mesh encryption is performed on the area to be encrypted, b will be reduced once.

[0084] In order to facilitate the understanding of the above-mentioned embodiments of the present invention, the effect of mesh encryption is described below in conjunction with a specific scenario.

[0085] According to different needs of users, the grid encryption method provided in the above embodiments of the present invention can be used in different scenarios such as point-like rapid hierarchical encryption of a single unit, line-like rapid hierarchical encryption of a string of unit groups, and surface-like 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; if a certain long and narrow fault area needs to be encrypted, a string of unit group encryption technology can be used; if a certain block area needs to be encrypted, a row of unit group encryption technology can be used.

[0087] Figures 2 to 7 An example of point-like rapid hierarchical encryption of a single unit is shown. In the initial hexahedral mesh model with 48 units, units No. 1, 11, 21, and 31 (the above units to be encrypted corresponding to the target position specified by the user are taken as an example, but it is not limited to the above units) are selected for three-level encryption. After each level of encryption, the scale b of the largest unit is reduced to 1 / 3 of the original. After three levels of encryption, the scale b of the largest unit is reduced to 1 / 27 of the original mesh.

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

[0089] It is understandable that the units 1, 11, 21, and 31 are illustrative examples, and one or more units can be selected according to user needs in actual applications. For example, if a user needs to encrypt a certain drilling location, the longitude and latitude of the drilling location can be input as the target range, and the unit containing the point can be found in the initial hexahedral mesh model as the area to be encrypted.

[0090] in, Figure 2 The initial hexahedral mesh model is shown; Figure 3 The locally encrypted grid cell is shown (isoscopic view); Figure 4 The locally encrypted grid unit is shown (side view in the X-axis direction); Figure 5 The locally encrypted grid unit is shown (side view in the Y-axis direction); Figure 6 The locally encrypted grid unit is shown (side view in the Z-axis direction); Figure 7 Unit No. 1 is shown after 3 levels of encryption (isotropic view).

[0091] Figures 8 to 12 An example of linear rapid hierarchical encryption of a group of cells is shown. In an initial hexahedral mesh model with 48 cells, cells No. 31, 32, 33, 34, 35, 36, 4, 10, 16, and 22 (taking the above cells containing the area to be encrypted corresponding to the target position specified by the user as an example, but not limited to the above cells) are selected for three-level encryption. After each level of encryption, the maximum cell size b is reduced to 1 / 3 of the original. After three levels of encryption, the maximum cell size b is reduced to 1 / 27 of the original grid.

[0092] in, Figure 8 The initial hexahedral mesh model is shown; Fig. 9 The locally encrypted grid cell is shown (isoscopic view); Fig.10 The locally encrypted grid unit is shown (side view in the X-axis direction); Fig.11 The locally encrypted grid unit is shown (side view in the Y-axis direction); Fig.12 The partially encrypted mesh unit is shown (side view in the Z-axis direction).

[0093] Figures 13 to 17 The example of realizing local area mesh encryption by means of planar rapid hierarchical encryption of multiple rows of unit groups is shown. In the initial hexahedral mesh model with 72 units, units No. 4, 5, 6, 10, 11, 12 and No. 28, 29, 30, 34, 35, 36 are selected (the above-mentioned units in the area to be encrypted corresponding to the target position specified by the user are taken as an example, but it is not limited to the above-mentioned units), and the selected units are encrypted along the common surface of the two groups of units. After the second-level encryption, the maximum unit size b on both sides of the common surface is reduced to 1 / 9 of the original mesh.

[0094] in, Fig.13 The initial hexahedral mesh model is shown; Fig.14 The locally encrypted grid cell is shown (isoscopic view); Fig.15 The locally encrypted grid unit is shown (side view in the X-axis direction); Fig.16 The locally encrypted grid unit is shown (side view in the Y-axis direction); Fig.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 in 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, and the appearance of new nodes on the unit surface at the boundary of the encrypted area can be avoided after encryption, and the singularity problem in the calculation and analysis of the force balance of the newly added nodes can be solved; through step-by-step encryption, the area to be encrypted can be effectively relocated and processed, and unnecessary calculations of the entire grid model can be avoided, which can improve the efficiency of grid encryption and have high efficiency. In summary, more flexible, efficient and reasonable grid encryption can be achieved at the position specified by the user, and it can adapt to the requirements of different model scales.

[0096] It should be noted that when meshing a certain area, new nodes and units are usually added, which may cause discontinuity at the boundary of the meshing area, destroying the geometric continuity of the mesh model. In the above embodiments of the present invention, local meshing can be performed in a designated area without affecting the mesh around the meshing area, which can ensure geometric continuity and is easy to maintain, thereby solving the problem of geometric continuity maintenance.

[0097] It should be noted that when performing continuity-guaranteeing 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 encrypting the mesh, 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, that is, a zero volume unit, it is deleted, thereby solving the zero volume unit problem.

[0098] It should be noted that the 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 leads to the need for users to have a deep understanding of the model and simulation process, increases the threshold for use, and may also cause 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 position 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 according to the virtual position specified by the user (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. Moreover, in the process of mesh encryption, after each encryption, it is necessary to effectively determine whether the scale of the largest unit in the area to be encrypted reaches the unit scale required by the user; if not, continue to search for all units within the minimum range containing the target location in the newly generated unit, and re-determine it as the area to be encrypted, and perform the next level of encryption. This cycle can significantly improve efficiency. In summary, flexible, efficient, and convenient local encryption of unit meshes can be achieved.

[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 referenced to each other.

[0100] Fig.18Schematic diagram of the structure of the adaptive step-by-step mesh encryption device based on hexahedral mesh units provided by the present invention. Fig.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 a user;

[0102] A determination module 1802 is used to determine the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as the area 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 it does, the encryption ends; if it does not, the encryption module is executed;

[0104] The encryption module 1804 encrypts all the units 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 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] The adaptive step-by-step mesh encryption device based on hexahedral mesh units is used in the adaptive step-by-step mesh encryption method based on hexahedral mesh units in the aforementioned embodiments. Therefore, the description and definition in the adaptive step-by-step mesh encryption method based on hexahedral mesh units in the aforementioned embodiments can be used for understanding each execution module in the embodiments of the present invention.

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

[0108] The 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 mobile node 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 position to the nearest original node on the boundary, so that the nodes of each subunit are the 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, the encryption module 1804 further includes: 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.

[0114] Fig.19 An example of a physical structure diagram of an electronic device is shown in FIG. Fig.19 As shown, the electronic device may include: a processor 1901, a communication interface 1902, a memory 1903 and a communication bus 1904, wherein the processor 1901, the communication interface 1902 and the memory 1903 communicate with each other through the communication bus 1904. The processor 1901 may call the logic instructions in the memory 1903 to execute an adaptive step-by-step mesh encryption method based on hexahedral mesh units, the method comprising: an acquisition step: acquiring an initial hexahedral mesh model, a target position and a unit scale required by a user; a determination step: determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh 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", encrypting all units in the area to be encrypted once.

[0115] In addition, the logic instructions in the above-mentioned memory 1903 can be implemented in the form of software functional units and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, 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, and the computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a 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: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[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: 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.

[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 recorded 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 mesh encryption method based on hexahedral mesh units, the method comprising: an acquisition step: acquiring an initial hexahedral mesh model, a target position and a unit scale required by a user; a determination step: determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as an 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 recorded in the embodiment of the aforementioned method, and can achieve the same beneficial effects, which will not be repeated here.

[0121] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, 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 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 flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, 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 flowchart and / or block diagram. 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 capable of directing a computer or other programmable data processing device to operate 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 A 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 operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0125] The foregoing description of specific exemplary embodiments of the present invention is for the purpose of illustration and demonstration. These descriptions are not intended to limit the present invention to the precise form disclosed, and it is clear that many changes and variations can be made based on the above teachings. The purpose of selecting and describing the exemplary embodiments is to explain the specific principles of the present invention and its practical application, so that those skilled in the art can realize and utilize various different exemplary embodiments of the present invention and various different selections and changes. The scope of the present invention is intended to be limited by the claims and their equivalents.

Claims

1. An adaptive step-by-step mesh encryption 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 mesh area containing the target position in the initial hexahedral mesh model as the area to be encrypted; Judgment step: judging whether the size of the largest unit of 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.

2. The adaptive step-by-step mesh encryption method based on hexahedral mesh units according to claim 1, characterized in that: The encryption of all units in the area to be encrypted includes: The step of equally dividing the unit is as follows: each hexahedral unit of the area to be encrypted is equally divided into three parts in three directions to obtain 27 hexahedral subunits; Node moving step: move each newly added node generated on the boundary of the encrypted area that does not overlap with the original node to the nearest original node on the boundary, so that the nodes of each sub-unit are the nodes of the adjacent unit; Deleting unit and node steps: deleting zero-volume subunits and redundant nodes generated after moving nodes; Number Nodes Step: Renumber all nodes in the hexahedral mesh model.

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

4. 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 executed again until the size of the largest unit of the area to be encrypted meets the unit size required by the user.

5. An adaptive step-by-step mesh encryption device based on hexahedral mesh units, characterized in that: include: An acquisition module is used to obtain an initial hexahedral mesh model, a target position, and a unit scale required by the user; A determination module, used for determining the minimum hexahedral mesh area containing the target position in the initial hexahedral mesh model as the area to be encrypted; A judgment module, used to judge whether the size of the largest unit of the area to be encrypted meets the unit size required by the user; The encryption module is used to encrypt all the units in the encryption area if the judgment result is "no".

6. The adaptive step-by-step mesh encryption device based on hexahedral mesh units according to claim 5, characterized in that: The encryption module comprises: The 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 mobile node 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 position to the nearest original node on the boundary, so that the nodes of each subunit are the 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 a hexahedral mesh model.

7. The adaptive step-by-step mesh encryption device based on hexahedral mesh units according to claim 5 or 6, characterized in that: The judgment module is also used to end the encryption if the judgment result is "yes".

8. The adaptive step-by-step mesh encryption device based on hexahedral mesh units according to claim 5, characterized in that: After the encryption module, the following is also included: 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.

9. 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 mesh encryption method based on hexahedral mesh units as described in any one of claims 1 to 4 are implemented.

10. 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 step-by-step mesh encryption method based on hexahedral mesh units as claimed in any one of claims 1 to 4 are implemented.

Images