A method for optimizing hexahedral grid singular structure and related products

By calculating the layer structure and edge optimization energy of the hexahedral mesh, performing layer deletion and expansion operations, and using the Laplace algorithm to optimize the singular structure of the hexahedral mesh, the singular lines are aligned with the mesh feature lines, thus solving the singular line alignment problem and improving the accuracy of numerical simulation and the safety of engineering modeling.

CN118468613BActive Publication Date: 2024-11-05DALIAN UNIV OF TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410932017.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2023-12-29
Filing Date
2024-07-12
Publication Date
2024-11-05
Estimated Expiration
2044-07-12

AI Technical Summary

Technical Problem

Existing technologies have failed to effectively address the alignment issue between singular lines and model feature lines when optimizing singular structures of hexahedral meshes, leading to safety hazards such as stress concentration and fatigue cracks.

Method used

By calculating the optimized energy of the layer structure and edges in the hexahedral mesh, performing layer deletion and layer expansion operations, and combining the feature-preserving Laplacian algorithm, the singular structure of the hexahedral mesh is finally optimized so that the singular lines are aligned with the mesh feature lines.

Benefits of technology

It improves the degree of mesh structuring, enhances the accuracy and efficiency of numerical simulation, avoids problems such as stress concentration and fatigue cracks, and ensures structural safety and stability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118468613B_ABST
    Figure CN118468613B_ABST
Patent Text Reader

Abstract

The present application discloses a method and related products for optimizing the singular structure of a hexahedral mesh, and relates to the technical field of hexahedral mesh optimization. The method comprises: obtaining a hexahedral mesh to be optimized; calculating the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh to be optimized; performing a layer deletion operation and / or a layer expansion operation based on the optimization energy of the layer structure and the optimization energy of the edge to perform an initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result; and finally optimizing the initial optimization result using a feature-preserving Laplace algorithm to optimize the singular structure of the hexahedral mesh. Using the scheme of the present application, the singular structure of the hexahedral mesh can be optimized to the maximum extent, so that the singular lines are aligned with the grid feature lines.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the technical field of hexahedral mesh optimization. More specifically, the present application relates to a method, a computing device and a computer-readable storage medium for optimizing a hexahedral mesh singular structure. Background Art

[0002] Hexahedral mesh is a commonly used discretization method in engineering modeling and simulation. However, in actual engineering, due to design requirements, material properties and other factors, the structural shape and load distribution may cause the hexahedral mesh to be distorted or singular in some areas. These singular structures may cause stress concentration, fatigue cracks and other problems, affecting the safety and stability of the structure.

[0003] In order to solve these problems, hexahedral mesh singular structure optimization technology came into being. Hexahedral mesh singular structure optimization is an advanced technology used in the engineering field. It aims to improve the mesh structuring degree by adjusting the topological connection method of the hexahedral mesh, thereby improving the accuracy and efficiency of numerical simulation. The current commonly used methods ignore the key step of aligning the singular lines with the model feature lines. How to maximize the mesh singular structure while aligning the singular lines with the model feature lines is the focus of hexahedral mesh singular structure optimization.

[0004] In view of this, there is an urgent need to provide a solution for optimizing the singular structure of the hexahedral mesh, which can maximize the optimization of the singular structure of the hexahedral mesh and align the singular lines with the grid feature lines. Summary of the invention

[0005] In order to at least solve one or more of the technical problems mentioned above, the present application proposes a solution for optimizing the hexahedral grid singular structure in multiple aspects.

[0006] In a first aspect, the present application provides a method for optimizing a hexahedral mesh singular structure, comprising: obtaining a hexahedral mesh to be optimized; calculating the optimization energy of a layer structure and the optimization energy of an edge in the hexahedral mesh to be optimized; performing a layer deletion operation and / or a layer expansion operation based on the optimization energy of the layer structure and the optimization energy of the edge to perform an initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result; and finally optimizing the initial optimization result using a feature-preserving Laplace algorithm to complete the optimization of the hexahedral mesh singular structure, wherein the optimization energy of the layer structure in the hexahedral mesh to be optimized is calculated by the following operations: according to the optimization energy of the edge Determine the optimization energy of the boundary edges of the layer structure in the hexahedral mesh to be optimized and the optimization energy of the internal edges of the layer structure; and calculate the optimization energy of the layer structure in the hexahedral mesh to be optimized based on the optimization energy of the boundary edges and the optimization energy of the internal edges; wherein the optimization energy of the edges in the hexahedral mesh to be optimized is calculated by the following operations: calculate the current degree and ideal degree of the edges in the hexahedral mesh to be optimized; and calculate the optimization energy of the edges in the hexahedral mesh to be optimized based on the difference between the current degree and the ideal degree, wherein the current degree is the number of hexahedral meshes around the edge, and the ideal degree is the number of target angles for dividing the hexahedral mesh space around the edge.

[0007] In one embodiment, performing a layer deletion operation and / or a layer expansion operation based on the optimization energy of the layer structure and the optimization energy of the edge to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result includes: sorting all layer structures based on the optimization energy of the layer structure, and judging whether the optimization energy of the layer structure is greater than or equal to a first preset value; performing a layer deletion operation according to whether the optimization energy of the layer structure is greater than or equal to the first preset value to simplify the layer structure with the largest optimization energy; sorting the optimization energy of the edges in the hexahedral mesh after the simplified layer structure, and judging whether the absolute value of the optimization energy of the edges in the hexahedral mesh after the simplified layer structure is greater than a second preset value; and performing a layer expansion operation according to whether the absolute value of the optimization energy of the edges in the hexahedral mesh after the simplified layer structure is greater than a second preset value to expand the edges with the largest optimization energy, until the optimization energy of all layer structures is less than the first preset value and the absolute value of the optimization energy of all edges in the hexahedral mesh after the simplified layer structure is less than or equal to the second preset value, so as to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result.

[0008] In another embodiment, performing a layer deletion operation based on whether the optimization energy of the layer structure is greater than or equal to a first preset value includes: in response to the optimization energy of the layer structure being greater than or equal to the first preset value, merging parallel edges in the corresponding layer structure to perform the layer deletion operation.

[0009] In another embodiment, performing a layer expansion operation based on whether the absolute value of the optimized energy of the edge in the hexahedral mesh after the simplification of the layer structure is greater than a second preset value includes: in response to the absolute value of the optimized energy of the edge in the hexahedral mesh after the simplification of the layer structure being greater than the second preset value, starting to screen the initial face of the layer expansion operation with the corresponding edge, so as to perform the layer expansion operation based on the screened initial face.

[0010] In another embodiment, the initial surface of the layer expansion operation is screened by the following operations: determining whether the corresponding edge is an internal edge or a boundary edge of the layer structure; in response to the corresponding edge being an internal edge of the layer structure, bisecting the hexahedral mesh around the corresponding edge; or in response to the corresponding edge being a boundary edge of the layer structure, expanding from the corresponding edge to the boundary edge of the target ideality, and expanding the edge that does not reach the target ideality toward the internal edge of the layer structure, so as to screen the initial surface of the layer expansion operation.

[0011] In another embodiment, the initial optimization result is finally optimized using the feature-preserving Laplace algorithm to complete the optimization of the hexahedral mesh singular structure, including: traversing and optimizing the coordinates of all points in the initial optimization result; and mapping the coordinates of the optimized points to the hexahedral mesh to be optimized to complete the optimization of the hexahedral mesh singular structure.

[0012] In a second aspect, the present application provides a computing device comprising: a processor configured to execute program instructions; and a memory configured to store the program instructions, wherein when the program instructions are loaded and executed by the processor, the processor executes the method for optimizing a hexahedral mesh singular structure according to any embodiment of the first aspect.

[0013] In a third aspect, the present application provides a computer-readable storage medium having program instructions stored therein. When the program instructions are loaded and executed by a processor, the processor executes the method for optimizing hexahedral mesh singular structures according to any embodiment of the first aspect.

[0014] Through the scheme for optimizing the singular structure of the hexahedral mesh provided above, the embodiment of the present application calculates the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh to be optimized to perform layer deletion operation and / or layer expansion operation, thereby maximally simplifying the singular lines in the hexahedral mesh, improving the degree of mesh structuring, and obtaining the initial optimization result. Then, the initial optimization result of the hexahedral mesh to be optimized is finally optimized using the feature-preserving Laplace algorithm, which can pull the deformation caused by topology optimization back to the original surface of the mesh, maintain the characteristics of the hexahedral mesh, and align the singular lines with the mesh feature lines. Furthermore, the embodiment of the present application starts to screen the initial face of the layer expansion operation with the corresponding edge, thereby optimizing the internal singular lines, retaining the singular lines required by the boundary at the boundary, and pushing the singular lines not required by the boundary to the inside, so as to achieve a fast and robust layer expansion operation, while providing an operating space for the deletion operation. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] By reading the detailed description below with reference to the accompanying drawings, the above and other purposes, features and advantages of the exemplary embodiments of the present application will become easy to understand. In the accompanying drawings, several embodiments of the present application are shown in an exemplary and non-limiting manner, and the same or corresponding reference numerals represent the same or corresponding parts, wherein:

[0016] Figure 1 is an exemplary flowchart showing a method for optimizing a hexahedral mesh singular structure according to an embodiment of the present application;

[0017] Figure 2 is an exemplary flowchart showing an overall process for optimizing a hexahedral mesh singular structure according to an embodiment of the present application;

[0018] Figure 3 is an exemplary schematic diagram showing a layer deletion operation according to an embodiment of the present application;

[0019] Figure 4 is an exemplary schematic diagram showing a layer expansion operation according to an embodiment of the present application;

[0020] Figure 5 is an exemplary schematic diagram showing a layer deletion operation for a nut model according to an embodiment of the present application;

[0021] Figure 6 is an exemplary schematic diagram showing a layer expansion operation for a nut model according to an embodiment of the present application;

[0022] Figure 7 is an exemplary schematic diagram showing initial optimization and final optimization of a hexahedral mesh of a nut model according to an embodiment of the present application;

[0023] Figure 8It is an exemplary structural block diagram showing a computing device for optimizing hexahedral mesh singular structures according to an embodiment of the present application. DETAILED DESCRIPTION

[0024] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present application.

[0025] It should be understood that the terms "include" and "comprising" used in the specification and claims of the present application indicate the presence of described features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or collections thereof.

[0026] It should also be understood that the terms used in this application specification are only for the purpose of describing specific embodiments and are not intended to limit the present application. As used in this application specification and claims, unless the context clearly indicates otherwise, the singular forms of "a", "an" and "the" are intended to include plural forms. It should also be further understood that the term "and / or" used in this application specification and claims refers to any combination of one or more of the associated listed items and all possible combinations, and includes these combinations.

[0027] As used in this specification and claims, the term "if" can be interpreted as "when" or "upon" or "in response to determining" or "in response to detecting," depending on the context. Similarly, the phrases "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "upon determination" or "in response to determining" or "upon detection of [described condition or event]" or "in response to detecting [described condition or event]," depending on the context.

[0028] The specific implementation of the present application is described in detail below with reference to the accompanying drawings.

[0029] Figure 1 FIG. 1 is an exemplary flowchart of a method 100 for optimizing a hexahedral grid singular structure according to an embodiment of the present application. Figure 1As shown in FIG. 1 , at step S101, a hexahedral mesh to be optimized is obtained. In an implementation scenario, a three-dimensional model of an object can be obtained, and a hexahedral mesh for the object can be obtained according to the three-dimensional model. The aforementioned object may include, but is not limited to, for example, a building, a vehicle, furniture (such as a table, a chair, etc.), a vessel (such as pottery, porcelain, etc.), a mechanical structure or component (such as Figure 5 In some embodiments, the hexahedral mesh can be obtained by performing surface mesh reconstruction on the three-dimensional model of the object, for example. That is, the hexahedral mesh can be obtained by performing surface mesh reconstruction on the three-dimensional model of any object, and the hexahedral mesh includes a plurality of hexagons formed by connecting a plurality of points and edges (i.e., feature lines).

[0030] Based on the obtained hexahedral mesh to be optimized, at step S102, the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh to be optimized are calculated. In one implementation scenario, the optimization energy of the boundary edge of the layer structure in the hexahedral mesh to be optimized and the optimization energy of the internal edge of the layer structure are determined according to the optimization energy of the edge, and then the optimization energy of the layer structure in the hexahedral mesh to be optimized is calculated based on the optimization energy of the boundary edge and the optimization energy of the internal edge. In other words, the optimization energy of the layer structure in the hexahedral mesh includes the optimization energy of its internal edge and boundary edge.

[0031] In one embodiment, the optimization energy of the edge in the hexahedral mesh to be optimized can be calculated by the following operations: calculating the current degree and ideal degree of the edge in the hexahedral mesh to be optimized, and calculating the optimization energy of the edge in the hexahedral mesh to be optimized based on the difference between the current degree and the ideal degree, wherein the current degree is the number of hexahedral meshes around the edge, and the ideal degree is the number of target angles for dividing the hexahedral mesh space around the edge. As an example, assuming that the edge in the hexahedral mesh is The current degree of , the ideality in the hexahedral mesh is denoted by , then the optimization energy of each edge ,in , that is, the aforementioned target angle is the angle at which the hexahedral grid space is divided around the current edge Angles of 90° are included.

[0032] According to the above-obtained optimization energy of each edge, the optimization energy of the boundary edge and the optimization energy of the internal edge in each layer structure can be determined. Has a finite number of parallel sides and , after performing the layer deletion operation, the parallel edges are merged into one edge From this, the simplified energy of each edge e can be defined as , the simplified energy It can be expressed as: . Referring to the above edge optimization energy, we can see that .in, .in ,and .

[0033] This allows the optimization of the energy of the boundary edges in the layer structure to be obtained. ,Should It can be defined as .in, represents the boundary edge in s, .

[0034] In one implementation scenario, the optimized energy of the internal edges in the layer structure is For example, ,in represents the internal edge in s. Furthermore, the optimization energy of the layer structure can be obtained ,Should , k represents the parallel edge index in each layer structure.

[0035] After obtaining the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh to be optimized, in step S103, a layer deletion operation and / or a layer expansion operation are performed based on the optimization energy of the layer structure and the optimization energy of the edge to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result.

[0036] In one embodiment, all layer structures are sorted based on the optimization energy of the layer structure, and it is determined whether the optimization energy of the layer structure is greater than or equal to a first preset value; a layer deletion operation is performed according to whether the optimization energy of the layer structure is greater than or equal to the first preset value to simplify the layer structure with the largest optimization energy. Next, the optimization energy of the edges in the hexahedral mesh after the simplified layer structure is sorted, and it is determined whether the absolute value of the optimization energy of the edges in the hexahedral mesh after the simplified layer structure is greater than a second preset value, and then a layer expansion operation is performed according to whether the absolute value of the optimization energy of the edges in the hexahedral mesh after the simplified layer structure is greater than the second preset value to expand the edges with the largest optimization energy, until the optimization energy of all layer structures is less than the first preset value and the absolute value of the optimization energy of all edges in the hexahedral mesh after the simplified layer structure is less than or equal to the second preset value, so as to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result.

[0037] In some embodiments, the first preset value may be, for example, 0, and the second preset value may be, for example, 1. The optimization energies in the layers are sorted, and the layer structures are simplified in order of energy from high to low. By judging whether there is a layer structure whose optimization energy is greater than or equal to a first preset value (for example, 0), a layer deletion operation is performed to simplify the layer structure with the largest optimization energy. In an implementation scenario, in response to the optimization energy of the layer structure being greater than or equal to the first preset value, the parallel edges in the corresponding layer structure are merged to perform a layer deletion operation. That is, when there is a layer structure whose optimization energy is greater than or equal to 0, the parallel edges in the corresponding layer structure whose optimization energy is greater than or equal to 0 are merged to perform a layer deletion operation. When there is no layer structure whose optimization energy is greater than or equal to the first preset value, the subsequent layer expansion operation is continued.

[0038] According to the simplified hexahedral mesh, the optimized energy of all edges in the simplified hexahedral mesh is sorted. Specifically, all edges are calculated. The absolute value of the optimized energy ,Will according to Then, it is determined whether the absolute value of the optimized energy of the edge in the hexahedral mesh after the layer structure is simplified is greater than a second preset value (e.g., 1). In one implementation scenario, in response to the absolute value of the optimized energy of the edge in the hexahedral mesh after the layer structure is simplified being greater than the second preset value, the initial face of the layer expansion operation is screened with the corresponding edge, so as to perform the layer expansion operation according to the screened initial face.

[0039] In one implementation scenario, it is determined whether the corresponding edge is an internal edge or a boundary edge of the layer structure, and in response to the corresponding edge being an internal edge of the layer structure, the hexahedral mesh around the corresponding edge is bisected. Alternatively, in response to the corresponding edge being a boundary edge of the layer structure, the corresponding edge is extended to the boundary edge of the target ideality, and the edge that does not reach the target ideality is extended to the internal edge of the layer structure to screen the initial face of the layer extension operation. More specifically, in the execution of the layer extension operation, the initial face is selected starting from the current initial edge according to the absolute value sorting of the optimization energy of the aforementioned edges. If the initial edge is an internal edge, during the screening process, the initial face is made to bisect the hexahedron around the current edge as much as possible. If the initial edge is a boundary edge, the initial edge is extended to the boundary edge whose ideality is not 1 (that is, the aforementioned target ideality) and then the edge whose ideality is not 1 is extended inward to bisect the hexahedron around the current edge as much as possible.

[0040] It can be understood that the initial face will divide the hexahedral mesh into multiple polyhedrons. In some embodiments, the polyhedrons on both sides of the initial edge can be divided into two marks, and then the initial face can be screened using the cutting graph algorithm, and the subsequent layer expansion (or layer insertion) operation can be performed based on the screened initial face. That is, it is determined whether there is an edge with an absolute value of edge energy greater than 1. Through the layer insertion operation, the layer expansion optimizes the edge with the largest energy. By repeating the aforementioned operation until the optimization energy of all layer structures is less than the first preset value and the absolute value of the optimization energy of all edges in the hexahedral mesh after simplifying the layer structure is less than or equal to the second preset value, the initial optimization result is obtained by performing initial optimization on the hexahedral mesh to be optimized. That is, until there are no layers or edges that can be optimized, the initial optimization result is obtained.

[0041] Further, at step S104, the initial optimization result is finally optimized using the feature-preserving Laplace algorithm to optimize the hexahedral mesh singular structure. In one embodiment, the coordinates of all points in the initial optimization result are traversed and optimized, and then the coordinates of the optimized points are mapped to the hexahedral mesh to be optimized to optimize the hexahedral mesh singular structure. In an implementation scenario, the following formula can be used to traverse all points in the initial optimization result Coordinates: Based on the optimized coordinate points, the optimized edges can be obtained, and the optimized coordinate points can be mapped back to the points of the original hexahedral mesh by mapping the optimized edges (feature lines) back to the feature lines of the original hexahedral mesh. In some embodiments, when the sum of the moving distances of all points is less than a preset threshold, the final optimization result is obtained, and the optimization of the hexahedral mesh singular structure is completed.

[0042] In combination with the above description, it can be known that the embodiment of the present application first calculates the current degree, ideal degree and the number of angles around each edge that can be used to divide the hexahedral grid space of the input hexahedral grid edge, and then defines the optimization energy of the edge according to the difference between the ideal degree and the current degree. The optimization energy of the layer structure in the hexahedral grid is determined by the optimization energy of the edge, and the optimization energy is minimized by using the hexahedral grid layer deletion and layer expansion operations to obtain the initial optimization result of the optimized grid singular structure. Furthermore, the initial optimization result is finally optimized using the feature-preserving Laplace algorithm to complete the optimization of the hexahedral grid singular structure.

[0043] Based on this, the embodiment of the present application provides a powerful simplification strategy, which can optimize the hexahedral mesh singular structure to the maximum extent by using the layer insertion and layer deletion methods, and the final optimization using the feature-preserving Laplace algorithm can maintain the characteristics of the hexahedral mesh, so that the singular lines are aligned with the mesh feature lines. In addition, the embodiment of the present application optimizes the internal singular lines by screening the initial surface of the layer expansion operation starting with the corresponding edge, retaining the singular lines required by the boundary at the boundary, and pushing the singular lines not required by the boundary to the inside, so as to achieve fast and robust layer expansion operations, while providing operating space for the deletion operation. Based on the optimized hexahedral mesh of the present application, the accuracy and efficiency of the numerical simulation of the structural model in engineering modeling and simulation can be improved, avoiding the safety hazards caused by the distortion or singularity of the hexahedral mesh, which causes stress concentration, fatigue cracks and other problems in the structure in the actual engineering.

[0044] Figure 2 FIG. 1 is an exemplary flowchart showing an overall process for optimizing a hexahedral mesh singular structure according to an embodiment of the present application. Figure 2 As shown in , at step S201, a hexahedral mesh to be optimized is obtained. As mentioned above, the hexahedral mesh can be obtained by reconstructing a surface mesh for any three-dimensional model, and the hexahedral mesh includes a plurality of hexagons formed by connecting a plurality of points and edges (ie, feature lines).

[0045] Next, at step S202, the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh are calculated. In one implementation scenario, the current degree of the edge in the hexahedral mesh can be calculated. and ideality , based on Calculate the optimization energy of all edges and determine the optimization energy of all layer structures based on the optimization energy of the edges The optimization energy Optimized energy of internal edges in included layer structures and the optimized energy of the boundary edges in the layer structure For more details on the optimization energy calculation of the layer structure, please refer to the above Figure 1 The description of is not repeated here in this application.

[0046] After obtaining the optimization energy of the layer structure and the optimization energy of the edge, at step S203, all layer structures are sorted according to the optimization energy of the layer structure, and at step S204, it is determined whether there is a layer structure whose optimization energy is greater than or equal to 0. If there is a layer structure whose optimization energy is greater than or equal to 0, at step S205, a layer deletion operation is performed to simplify the layer structure with the largest optimization energy (e.g. Figure 3As shown), and repeat the above step S204. In one implementation scenario, parallel edges in corresponding layer structures with optimization energies greater than or equal to 0 are merged to perform a layer deletion operation.

[0047] When the optimization energy of the non-layer structure is greater than or equal to 0, at step S206, the optimization energies of the edges in the hexahedral mesh after the simplified layer structure are sorted, and at step S207, it is determined whether there is an edge whose absolute value of the optimization energy is greater than 1. When the absolute value of the optimization energy of the existing edge is greater than 1, at step S208, a layer expansion operation is performed to expand the edge with the largest optimization energy (e.g. Figure 4 As shown in the foregoing, it can be known that the initial surface of the layer expansion operation can be screened starting from the corresponding edge, so that the layer expansion operation can be performed according to the screened initial surface. When the absolute value of the optimization energy of the non-existent edge is greater than 1, at step S209, it is determined whether there is still a layer structure or edge that can be optimized.

[0048] The figure further shows that when there is no layer structure or edge that can be optimized, the initial optimization of the hexahedral mesh is completed, and at step S210, the initial optimization result is finally optimized using the feature-preserving Laplace algorithm. Specifically, by traversing the coordinates of all points in the initial optimization result, the coordinates of the optimized points are mapped to the hexahedral mesh to be optimized to complete the optimization of the hexahedral mesh singular structure, and at step S211, the final optimized hexahedral mesh is returned. When there is a layer structure or edge that can be optimized, the aforementioned steps S203 to S209 are repeated until there is no layer structure or edge that can be optimized, and the initial optimization result is finally optimized using the feature-preserving Laplace algorithm, and the final optimized hexahedral mesh is returned.

[0049] Figure 3 FIG. 1 is an exemplary schematic diagram showing a layer deletion operation according to an embodiment of the present application. Figure 3 As shown in , the deletion operation of the corresponding layer structure is performed from left to right. Figure 4 FIG. 1 is an exemplary schematic diagram showing a layer expansion operation according to an embodiment of the present application. Figure 4 As shown in , the expansion operations of the corresponding layer structures are performed sequentially from left to right.

[0050] Combine the following Figure 5-Figure 7 , taking the industrial part nut model as an example, the implementation scheme of this application is described by taking the optimization implementation of its hexahedral mesh singular structure as an example.

[0051] Figure 5 FIG. 1 is an exemplary schematic diagram showing a layer deletion operation for a nut model according to an embodiment of the present application. Figure 5As shown in the figure, taking the nut model as an example, first obtain the hexahedral mesh of the nut model, including surface points and edges. In the figure, many lines in the hexahedral mesh on the left are curved, indicating the existence of singular structures. Next, calculate the optimization energy of the edge Among them, the ideality of the edge of the hexahedral mesh is , the current degree of the edge In this scenario, the ideal degree of other boundary edges is 2, and the current degree may be any degree. The ideal degree of internal edges is 4, and the current degree may be any degree. Further, the optimization energy of all layer structures in the grid is calculated and sorted, and all layer structures with optimization energy greater than 0 are deleted. The deletion process is as follows: Figure 5 As shown, the layer deletion operation is performed from left to right.

[0052] Figure 6 is an exemplary schematic diagram showing the layer expansion operation for the nut model according to an embodiment of the present application. When there is no layer structure with an optimization energy greater than 0, the optimization energy of all edges in the grid is calculated and sorted, and the energy is optimized by using the layer insertion (or expansion) operation. For example, Figure 6 As shown, the layer expansion operation is performed from left to right. Further, by repeating the above steps until there is no edge or layer structure that can be optimized, the initial optimization of the hexahedral mesh is achieved to obtain the initial optimization result (for example Figure 7 left figure).

[0053] Figure 7 is an exemplary schematic diagram showing the initial optimization and final optimization of the hexahedral mesh of the nut model according to an embodiment of the present application. Figure 7 The left figure in the middle shows the initial optimization result obtained by initial optimization of the hexahedral mesh. Figure 7 The middle right figure shows the final optimization result obtained by performing the final optimization on the hexahedral mesh. In one embodiment, the final optimization result is obtained by performing the final optimization on the mesh using the feature-preserving Laplace algorithm.

[0054] Based on this, the embodiment of the present application first calculates the current degree, ideal degree and the number of angles around each edge that can divide the hexahedral grid space, and then defines the optimization energy according to the difference between the ideal degree and the current degree, and minimizes the optimization energy and optimizes the grid singular structure by using the hexahedral grid layer deletion and layer insertion operations. The embodiment of the present application has a powerful simplification strategy, which uses the layer deletion operation to simplify the hexahedral grid singular structure to the greatest extent. The embodiment of the present application also has a robust insertion strategy, which uses the layer insertion algorithm to optimize the highly singular lines, which can keep the model's appearance features, align the singular lines with the feature lines, and provide operating space for the layer deletion operation. In addition, the embodiment of the present application can optimize the hexahedral grid singular structure to the greatest extent by using the layer insertion and layer deletion methods.

[0055] The above solution of the embodiment of the present application can be implemented by means of program instructions. Therefore, the present application also provides a computing device for optimizing the singular structure of a hexahedral grid, such as Figure 8 shown.

[0056] Figure 8 8 is an exemplary structural block diagram showing a computing device 800 for optimizing a hexahedral mesh singular structure according to an embodiment of the present application. Figure 8 As shown in , the computing device 800 may include a processor 801 and a memory 802, wherein the processor 801 and the memory 802 communicate with each other via a bus. The memory 802 stores computer instructions for optimizing the singular structure of a hexahedral mesh. When the computer instructions are executed by the processor 801, the device 800 implements the method steps described in the above text in combination with the accompanying drawings: obtaining a hexahedral mesh to be optimized; calculating the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh to be optimized; performing a layer deletion operation and / or a layer expansion operation based on the optimization energy of the layer structure and the optimization energy of the edge to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result; and finally optimizing the initial optimization result using the feature-preserving Laplace algorithm to optimize the singular structure of the hexahedral mesh to complete the optimization.

[0057] The above-mentioned device may correspond to a computing device having various processing functions. For example, the computing device may be implemented as various types of devices, including but not limited to a personal computer (PC), a server device, a mobile device, etc.

[0058] The processor is configured to execute program instructions to control all functions of the computing device. For example, the processor controls all functions of the computing device by executing a program stored in a memory on the computing device. The processor can be implemented by a central processing unit (CPU), a graphics processing unit (GPU), an application processor (AP), an artificial intelligence processor chip (IPU), etc. provided in the computing device. However, the present application is not limited thereto.

[0059] The memory is used to store various data processed in the computing device. For example, the memory can store processed data and data to be processed in the computing device. The memory can store data that has been processed or to be processed by the processor. In addition, the memory can store program instructions such as applications, drivers, etc. to be driven by the computing device. For example: the memory can store various programs related to the operation and processing of encrypted data to be executed by the processor. The memory can be DRAM, but the present application is not limited to this. The memory can include at least one of a volatile memory or a non-volatile memory. The non-volatile memory can include a read-only memory (ROM), a programmable ROM (PROM), an electrically programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), a flash memory, a phase change RAM (PRAM), a magnetic RAM (MRAM), a resistive RAM (RRAM), a ferroelectric RAM (FRAM), etc. The volatile memory can include a dynamic RAM (DRAM), a static RAM (SRAM), a synchronous DRAM (SDRAM), a PRAM, an MRAM, a RRAM, a ferroelectric RAM (FeRAM), etc. In an embodiment, the memory may include at least one of a hard disk drive (HDD), a solid state drive (SSD), a high-density flash memory (CF), a secure digital (SD) card, a micro secure digital (Micro-SD) card, a mini secure digital (Mini-SD) card, an extreme digital (xD) card, caches, or a memory stick.

[0060] In summary, the specific functions implemented by the memory and processor of the device provided in the implementation mode of this specification can be explained in comparison with the aforementioned implementation modes in this specification, and can achieve the technical effects of the aforementioned implementation modes, so they will not be repeated here.

[0061] In an embodiment of the present application, a computer-readable storage medium is also provided, in which program instructions for optimizing hexahedral mesh singular structures are stored. When the program instructions are loaded and executed by a processor, the processor executes the method described in the embodiment of the present application.

[0062] Computer readable storage media can be, for example, but not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or components, or any combination thereof. More specific examples (non-exhaustive examples) of computer readable storage media can include, for example: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In this article, a computer readable storage medium can be any tangible medium containing or storing a program that can be used by an instruction execution system, device, or device or used in combination with it.

[0063] Although multiple embodiments of the present disclosure have been shown and described herein, it will be apparent to those skilled in the art that such embodiments are provided by way of example only. Those skilled in the art may think of many changes, modifications, and alternatives without departing from the thought and spirit of the present disclosure. It should be understood that in the process of practicing the present disclosure, various alternatives to the embodiments of the present disclosure described herein may be adopted. The attached claims are intended to define the scope of protection of the present disclosure, and therefore cover equivalents or alternatives within the scope of these claims.

[0064] In addition, the collection and acquisition of various data in this application complies with relevant laws and regulations and is authorized by the data provider. Any organization or individual that needs to obtain external data must obtain authorization in accordance with the law and ensure data security. It is not allowed to illegally collect, use, process, or transmit unauthorized or unprotected data, or to illegally buy, sell, provide, or disclose unauthorized or unprotected data.

Claims

1. A method for optimizing singular structures of hexahedral meshes, It is characterized in that include: Acquire a hexahedral mesh to be optimized, wherein the hexahedral mesh is obtained by performing surface mesh reconstruction on a three-dimensional model of the object; Calculating the optimization energy of the layer structure and the optimization energy of the edge in the hexahedral mesh to be optimized; Performing a layer deletion operation and / or a layer expansion operation based on the optimization energy of the layer structure and the optimization energy of the edge, so as to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result; as well as The initial optimization result is finally optimized using the feature-preserving Laplace algorithm to optimize the hexahedral mesh singular structure. The optimization energy of the layer structure in the hexahedral mesh to be optimized is calculated by the following operations: Determining the optimization energy of the boundary edge of the layer structure and the optimization energy of the internal edge of the layer structure in the hexahedral mesh to be optimized according to the optimization energy of the edge; as well as calculating the optimization energy of the layer structure in the hexahedral mesh to be optimized based on the optimization energy of the boundary edge and the optimization energy of the internal edge, The optimization energy of the layer structure is expressed by the following formula: in represents the optimization energy of internal edges in the layer structure, represents the optimization energy of the boundary edge in the layer structure, and k represents the parallel edge index in each layer structure; The optimization energy of the boundary edge is expressed by the following formula: in Represents the boundary edge The simplified energy, ; The optimization energy of the internal edge is expressed by the following formula: in represents the internal edges in s; The optimization energy of the edges in the hexahedral mesh to be optimized is calculated by the following operations: Calculating the current degree and ideal degree of the edges in the hexahedral mesh to be optimized; and The optimization energy of the edge in the hexahedral mesh to be optimized is calculated based on the difference between the current degree and the ideal degree, wherein the current degree is the number of hexahedral meshes around the edge, and the ideal degree is the number of target angles for dividing the hexahedral mesh space around the edge. The performing of a layer deletion operation and / or a layer expansion operation based on the optimization energy of the layer structure and the optimization energy of the edge to perform initial optimization on the hexahedral mesh to be optimized to obtain an initial optimization result includes: sorting all layer structures based on the optimization energy of the layer structures, and determining whether the optimization energy of the layer structures is greater than or equal to a first preset value; Performing a layer deletion operation according to whether the optimization energy of the layer structure is greater than or equal to a first preset value to simplify the layer structure with the maximum optimization energy; sorting the optimized energies of the edges in the hexahedral mesh after simplifying the layer structure, and determining whether the absolute value of the optimized energies of the edges in the hexahedral mesh after simplifying the layer structure is greater than a second preset value; and A layer expansion operation is performed according to whether the absolute value of the optimization energy of the edges in the hexahedral mesh after the simplification of the layer structure is greater than a second preset value to expand the edges with the largest optimization energy. The operation is stopped until the optimization energy of all layer structures is less than the first preset value and the absolute value of the optimization energy of all edges in the hexahedral mesh after the simplification of the layer structure is less than or equal to the second preset value, so as to perform initial optimization on the hexahedral mesh to be optimized and obtain an initial optimization result.

2. The method according to claim 1, It is characterized in that The layer deletion operation is performed according to whether the optimization energy of the layer structure is greater than or equal to a first preset value, including: In response to the optimization energy of the layer structure being greater than or equal to the first preset value, parallel edges in the corresponding layer structure are merged to perform the layer deletion operation.

3. The method according to claim 2, It is characterized in that The performing of the layer expansion operation according to whether the absolute value of the optimized energy of the edge in the hexahedral mesh after the simplified layer structure is greater than a second preset value comprises: In response to the absolute value of the optimized energy of the edge in the hexahedral mesh after the simplified layer structure being greater than the second preset value, the initial surface of the layer expansion operation is screened with the corresponding edge to perform the layer expansion operation according to the screened initial surface.

4. The method according to claim 3, It is characterized in that The initial surface of the layer expansion operation is filtered by the following operations: Determine whether the corresponding edge is an internal edge or a boundary edge of the layer structure; In response to the corresponding edge being an internal edge of the layer structure, bisecting the hexahedral mesh around the corresponding edge; or In response to the corresponding edge being a boundary edge of the layer structure, the corresponding edge is expanded to the boundary edge of the target ideality, and the edge that does not reach the target ideality is expanded toward the internal edge of the layer structure to screen the initial surface of the layer expansion operation.

5. The method according to claim 1, It is characterized in that The method of finally optimizing the initial optimization result by using the feature-preserving Laplace algorithm to optimize the hexahedral mesh singular structure includes: Traversing and optimizing the coordinates of all points in the initial optimization result; and The coordinates of the optimized points are mapped to the hexahedral mesh to be optimized to complete the optimization of the hexahedral mesh singular structure.

6. A computing device, It is characterized in that include: a processor configured to execute program instructions; as well as A memory configured to store the program instructions, which, when loaded and executed by the processor, enables the processor to execute the method for optimizing hexahedral grid singular structures according to any one of claims 1-5.

7. A computer-readable storage medium, It is characterized in that Program instructions are stored therein, and when the program instructions are loaded and executed by a processor, the processor executes the method for optimizing the hexahedral grid singular structure according to any one of claims 1-5.