Polyhedral mesh cutting method and system for three-dimensional geological modeling

Abstract

The invention provides a polyhedral mesh cutting method and system for three-dimensional geologic modeling, and belongs to the field of three-dimensional geologic modeling, and the method comprises the steps: S1, taking a surface mesh and a polyhedral mesh as input, and screening out an intersecting edge-face of a bounding box; s2, calculating all intersection points and intersection lines by traversing edge-facing; s3, the intersection points and the intersection lines are inserted into grid faces corresponding to the surface grids and the polyhedral grids and refined; and S4, segmenting the polyhedral unit intersected with the surface grid into an inner part and an outer part, and generating a cutting result grid according to the unit connectivity of the polyhedral grid. The method can be applied to the field of three-dimensional geological modeling, and modeling requirements of complex geological structures can be effectively processed.

Description

Technical Field

[0001] The present invention belongs to the fields of three-dimensional geological modeling, computational geometry, computer graphics, numerical simulation and calculation, and particularly relates to a polyhedron mesh cutting method and system for three-dimensional geological modeling. Background Art

[0002] Three-dimensional geological modeling is to quantitatively characterize the internal structure, physical parameters and variation characteristics of geological bodies by establishing a mathematical description based on geological data. Mesh cutting, also known as mesh Boolean operation, takes two (or multiple) geometric objects as input and outputs their union, intersection or difference. In three-dimensional geological modeling, mesh cutting is a basic tool for creating and editing geological models. There are multiple scenarios where it is necessary to cut geological body meshes. For example, when constructing underground facilities, it is required to cut the geological body to form a cavity such as a subway tunnel. Another example is that many geological bodies have complex structures, and it is very difficult to model them as a whole. To avoid overall modeling, an initial sedimentary geological model is usually generated based on horizons and sections, and local complex geological forms are modeled separately. Then, the intersection, union and difference between the models are calculated by means of mesh cutting to form the final mesh of the complex geological body model.

[0003] Mesh cutting takes two meshes as input and forms the corresponding result meshes of intersection, union and difference by combining the geometric elements of the two meshes. Generally speaking, mesh cutting is divided into two major steps: intersection calculation and extraction. The intersection calculation step calculates the intersection points and intersection lines generated by the intersection of the input meshes, embeds the intersection points and intersection lines into the two meshes participating in the cutting, and refines the meshes to ensure the consistency of mesh topology. To accelerate the calculation speed of intersection points and intersection lines, a preprocessing process of intersection detection is usually added before calculating the intersection points to screen out the geometric elements that may intersect. The extraction step first marks whether the mesh faces are inside or outside the other mesh, and then extracts the corresponding part of the cutting result from the set of geometric elements included in the two input meshes to form the result mesh.

[0004] In the field of three-dimensional geological modeling, the currently commonly used meshing methods all have their own problems: columnar meshes are not applicable to complex fault situations; stepped meshes cannot accurately describe faults and cannot simulate fault slip. In recent years, many researchers have used polyhedron meshes when meshing geological bodies. Compared with columnar meshes and stepped meshes, polyhedron meshes can not only accurately represent sections, but also be applicable to complex fault situations. Due to the above advantages of polyhedron meshes, they are very suitable for representing complex geological bodies and have good application prospects in the fields of three-dimensional geological modeling and numerical simulation.

[0005] However, most of the current mesh cutting methods are aimed at two surface meshes, or a surface mesh and a tetrahedral mesh, or a surface mesh and a regular hexahedral mesh. The elements of the geological body mesh are spatial polyhedrons in the general sense (not limited to tetrahedrons or regular hexahedrons). Therefore, the above methods cannot be used for cutting the geological body mesh and cannot meet the relevant application requirements. One current approach to implementing the cutting of the geological body mesh by the surface of the local model is to reduce this problem to the independent cutting of each element of the geological body mesh by the surface mesh of the local model and to achieve it by means of the cutting method for two surface meshes, resulting in the repeated calculation of intersection points and the generated result model not having topological consistency, making it difficult to effectively support subsequent processing and applications. Summary of the Invention

[0006] To solve the above technical problems, the present invention provides a polyhedral mesh cutting method for 3D geological modeling, including the following steps:

[0007] Step S1: Taking the surface mesh and the polyhedral mesh as inputs, screening out the edge-face pairs with intersecting bounding boxes;

[0008] Step S2: By traversing the edge-face pairs, calculating all intersection points and intersection lines;

[0009] Step S3: Inserting the intersection points and intersection lines into the corresponding mesh faces of the surface mesh and the polyhedral mesh and refining them;

[0010] Step S4: Cutting the polyhedral elements intersecting with the surface mesh into two parts, the inner and the outer, and generating a cutting result mesh according to the element connectivity of the polyhedral mesh.

[0011] Advantageous Effects:

[0012] 1. The polyhedral mesh cutting method for 3D geological modeling provided by the present invention can realize the modeling of complex geological bodies and meet the relevant application requirements:

[0013] With the in-depth research in the field of 3D geological modeling, the geological structures studied are becoming more and more complex. In order to express complex geological structures without loss, polyhedral meshes are usually used to model geological bodies. However, most of the current mesh cutting methods are aimed at two surface meshes, or a surface mesh and a tetrahedral mesh, or a surface mesh and a regular hexahedral mesh. The method of the present invention can directly handle the cutting of polyhedral meshes and surface meshes, generate high-quality cutting results, and can be better applied to complex geological modeling and application scenarios.

[0014] 2. Using the method of the present invention can generate a result mesh with accurate geometric topology and retain the attribute information of the input mesh:

[0015] Currently, for the cutting of polyhedral meshes and surface meshes, the polyhedral mesh elements intersecting with the surface mesh are generally converted into surface meshes, and the cutting of the polyhedral mesh and the surface mesh is converted into the cutting of two surface meshes, resulting in the repeated calculation of intersection points. When using floating-point types for calculation, topological errors may occur. In the method of the present invention, during the cutting process, the topological structure of the mesh is always maintained to ensure that the cutting result conforms to the actual topological structure. Moreover, the method of collaborative refinement is adopted to retain the attribute information of the input mesh (such as formation attributes), which can avoid problems such as model discontinuity or data loss caused by topological errors and improve the integrity and reliability of complex geological models. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 It is a schematic flowchart of a polyhedral mesh cutting method for three-dimensional geological modeling according to the present invention;

[0017] Figure 2 It is a schematic diagram of the intersection types of edges and faces;

[0018] Figure 3 It is a schematic diagram of the process of inserting intersection points and intersection lines into the mesh surface and refining;

[0019] Figure 4 It is a schematic diagram of a mine and ore body model;

[0020] Figure 5 It is a schematic diagram of the spatial position relationship between the mine and the ore body model;

[0021] Figure 6 It is a schematic diagram of the result after the mine model is cut by the ore body;

[0022] Figure 7 It is a structural block diagram of a polyhedral mesh cutting system for three-dimensional geological modeling according to the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0023] In order to make the objectives, technical solutions and advantages of the present invention clearer and more understandable, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0024] Embodiment 1

[0025] As Figure 1 shown, a polyhedral mesh cutting method for three-dimensional geological modeling provided by an embodiment of the present invention includes the following steps:

[0026] Step S1: Taking the surface mesh and the polyhedral mesh as inputs, screening out the edge-face pairs whose bounding boxes intersect;

[0027] Step S2: By traversing the edge-face pairs, calculate all the intersection points and intersection lines.

[0028] Step S3: Insert the intersection points and intersection lines into the mesh faces corresponding to the surface mesh and the polyhedral mesh and refine them.

[0029] Step S4: Cut the polyhedral cells intersecting the surface mesh into two parts, inner and outer, and generate the cutting result mesh according to the cell connectivity of the polyhedral mesh.

[0030] In one embodiment, the above Step S1: Taking the surface mesh and the polyhedral mesh as inputs, filter out the edge-face pairs intersecting the bounding boxes, specifically including:

[0031] Step S11: Obtain a polyhedral mesh representing a geological body and a surface mesh representing a local model.

[0032] The present invention requires a polyhedral mesh representing a geological body and a surface mesh representing a local model as inputs. The mesh discretizes the complex geometric structure in space into simple geometric elements and represents the geometric structure using a set of simple geometric elements. To maintain the topological information of the mesh, in the present invention, the topological structure of the surface mesh is implemented using the usual half-edge data structure, and the topological structure of the polyhedral mesh is implemented using the usual extended half-edge data structure. In the present invention, the intersection points generated by cutting may be generated by the surface mesh edges and the polyhedral mesh faces, or may be generated by the polyhedral mesh edges and the surface mesh faces. Therefore, two screenings are required. After screening, since the polyhedral mesh faces are not necessarily triangular faces and may be non-planar polygons and cannot directly participate in the calculation of intersection points, they need to be triangulated. Considering that the bounding box intersection is a necessary condition for the edge and face intersection, the edge-face pairs with non-intersecting bounding boxes cannot generate intersection points. Therefore, only those polyhedral mesh faces detected to interfere with the surface mesh edges need to be triangulated. On the other hand, since the triangulation of some mesh faces of the polyhedral mesh will introduce new polyhedral mesh edges, it is necessary to first perform the bounding box test of the surface mesh edges and the polyhedral mesh faces, and triangulate the polyhedral mesh faces detected to interfere with the surface mesh edges, and then perform the bounding box test of the polyhedral mesh edges and the surface mesh faces.

[0033] Step S12: Use two arrays of bounding boxes to record the AABB bounding boxes corresponding to all the edges of the surface mesh and all the faces of the polyhedral mesh respectively; use the bounding box test algorithm to perform the intersection detection. When it is detected that an edge of the surface mesh intersects the bounding box of a face of the polyhedral mesh, record the edge-face pair in an associative container 1, and triangulate the polyhedral mesh face to obtain the newly added triangulated face and add it to the associative container 1.

[0034] Use two arrays of bounding boxes to record the AABB (Axis Aligned Bounding Box) bounding boxes corresponding to all the edges of the surface mesh and all the faces of the polyhedral mesh respectively. Then, call the bounding box test algorithm of CGAL (Computational Geometry Algorithm Library) for intersection detection. When it is detected that an edge of the surface mesh intersects with the bounding box of a face of the polyhedral mesh, record the edge-face pair in an associative container 1. The key of the associative container 1 is the index of the edge, and the value is an array of face indices (the reason for being an array is that there may be multiple faces interfering with the current edge). After the execution is completed, triangulate the faces of the polyhedral mesh recorded in the associative container 1, and add the newly added faces after triangulation to the associative container 1.

[0035] Step S13: Use two arrays of bounding boxes to record the AABB bounding boxes corresponding to all the edges of the polyhedral mesh and all the faces of the surface mesh respectively. In the same way as in step S12, record the edges of the polyhedral mesh and the faces of the surface mesh where the bounding boxes intersect in an associative container 2.

[0036] In one embodiment, the above step S2: Calculate all the intersection lines of the intersection points by traversing the edge-face pairs, specifically including:

[0037] Step S21: Traverse the associative container 1 and the associative container 2; for each edge-face pair among them, use arithmetic filtering computational geometry assertions to judge the intersection type between the edge and the face. If there is an actual intersection, calculate the intersection point and record the intersection point information, including: the coordinate position of the intersection point; the relationship between the intersection point and the edge and face that generate the intersection point, including: the intersection point falls inside, on the edge, or on the vertex of the face, the intersection point falls inside or on the vertex of the edge; and the adjacent information of the intersection point;

[0038] Calculating the intersection point is the only geometric construction in the present invention and is located upstream of the cutting process. Therefore, to avoid errors, the coordinate position of the intersection point in the present invention is stored in an array in the rational number type (CGAL::Exact_predicates_exact_constructions_kernel::Point_3). The relationship between the intersection point and the edge and face that generate the intersection point is stored using associative containers. The keys of the associative containers are the global indices of the point, edge, and face respectively, and the value is the index of the intersection point that falls on the point, edge, and face. Since the point, edge, and face can come from the polyhedral mesh or the surface mesh, a total of six associative containers are required. The adjacent information of the intersection point records the two faces from the surface mesh and the polyhedral mesh that generate the intersection point and the intersection point id. In mesh cutting, the root cause of repeated intersection calculation is that multiple edge-face pairs generate the same intersection point. To ensure the uniqueness of the intersection point identifier, it is necessary to judge and record the intersection type between the edge and the face. There are multiple intersection types between the edge and the face: such asFigure 2 As shown, the two endpoints of an edge may be on the same side of a face or on opposite sides of the face; when the endpoints of the edge are on opposite sides of the face, there may or may not be an intersection point; the intersection point may fall inside the face, inside the edge, or on the vertex. The determination of the above various situations can be reduced to multiple calls of a basic function (CGAL::orientation), and the corresponding attribution situations can be directly combined according to the return values of multiple calls. This basic function is to determine whether a point is on the plane, on the left side or on the right side. Therefore, as long as this function can return a mathematically correct result, it can ensure the correct implementation of the caller's logic. To ensure correctness and improve efficiency, this step applies CGAL's arithmetic filtering mechanism (CGAL::Exact_predicates_inexact_constructions_kernel) to filter out a large number of situations that do not require precise calculation: first use approximate calculation and record the error. If the error does not affect the determination of the geometric assertion symbol, precise calculation is not triggered, and only when the result contains zero, the exact type is used to recalculate.

[0039] Step S22: Delete all edge-face pairs that generate the intersection point from the associative container 1 and the associative container 2.

[0040] In one embodiment, the above step S3: Insert the intersection line into the mesh faces corresponding to the surface mesh and the polyhedron mesh and refine them, specifically including:

[0041] Step S31: According to the intersection point information, find all intersection points that fall inside the edge, query a certain half-edge associated with the edge, and insert the intersection points into the edge in the order of the distance from the intersection point to the end point of the half-edge, breaking the edge, and the point farther from the end point is inserted first; after inserting the intersection point, adjust the corresponding half-edge predecessor and successor relationships;

[0042] Step S32: After the intersection point breaks the edges of the surface mesh and the polyhedron mesh, use the constrained Delaunay triangulation algorithm (CGAL::Constrained_Delaunay_triangulation_2) to refine each face with an intersection point in the surface mesh and the polyhedron mesh one by one, and then add the refinement results to the mesh, adjusting the in-face topology so that the surface mesh and the polyhedron mesh contain the points and edges corresponding to the intersection line.

[0043] Before step S3, the topologies of the surface mesh and the polyhedron mesh have not changed substantially (except that in step S2, some faces of the polyhedron mesh are replaced by refined triangles), and all intersection lines are recorded in the intersection point information. Therefore, during the mesh refinement process, it is necessary to add the intersection line to the faces of the surface mesh and the polyhedron mesh, refine the mesh faces and adjust the mesh topology.

[0044] AsFigure 3 As shown, it shows a schematic diagram of the process of inserting the intersection line into the grid surface and refining it.

[0045] In one embodiment, the above step S4: cutting the polyhedron unit intersecting with the surface grid into two parts, the inner and the outer, and generating the cutting result grid according to the unit connectivity of the polyhedron grid, specifically includes:

[0046] Step S41: For each intersection line loop where the polyhedron grid unit intersects with the surface grid, obtain the associated faces of this intersection line loop in the polyhedron grid unit and the surface grid, and mark its inner and outer attributes according to the normal vector information of the associated faces;

[0047] Step S42: Starting from the associated face, mark all the faces connected to it with the same inner and outer attributes as this associated face; when marking, only mark the faces located inside the polyhedron grid unit in the surface grid;

[0048] After the marking is completed, combine the faces of the polyhedron grid located inside the surface grid and the faces of the surface grid located inside the polyhedron grid unit to obtain the polyhedron grid unit intersecting with it and located inside the surface grid; combine the faces of the polyhedron grid located outside the surface grid and the faces of the surface grid located inside the polyhedron grid unit to obtain the polyhedron grid unit intersecting with it and located outside the surface grid;

[0049] Step S44: According to the connectivity of the polyhedron grid, starting from the polyhedron grid unit intersecting with the surface grid, extract the polyhedron grid units located inside and outside the surface grid that do not intersect with the surface grid respectively, so as to form a complete polyhedron grid located inside and outside the surface grid.

[0050] The following gives a specific application example:

[0051] When performing 3D modeling on a mine geological body with a complex ore body inside, first, an initial model of the mine needs to be generated based on the bedding planes and cross-sections, then the complex ore body is modeled separately, and then the difference operation between the models is calculated by means of grid cutting to generate the final geological model.

[0052] The input mine and ore body models are as Figure 4 shown. The initial mine model is on the left and the ore body model is on the right. The input model parameters are shown in Table 1. Among them, the initial mine model is a polyhedron grid composed of multiple units, and the ore body model is a surface grid. The faces in the ore body model are all triangles, and there are a large number of long and narrow triangles, which are prone to topological errors due to numerical errors during geometric calculations. Therefore, the effectiveness of this method can be verified.

[0053] Table 1 Input parameters of the ore body model

[0054] The spatial position relationship between the mine and ore body models is as Figure 5 shown. It can be seen that the ore body and the mine model intersect locally. Some parts fall inside the mine model, and some parts protrude from the upper surface of the mine model. The intersection situation is very complex.

[0055] Figure 6 shows the result after the initial mine model is cut by the ore body. After cutting, the mine model is hollowed out, revealing the layered geological body located inside the mine model. Figure 6 The polyhedron mesh after cutting is shown at the lower left, and the enlargement of the local area is shown at the upper right. Among them, the number 1 marked in the figure indicates that the polyhedron mesh far from the ore body at this place is not affected at all and maintains its original shape; the number 2 indicates that the polyhedron mesh surface and the grid edge of the ore body surface are triangulated due to bounding box interference, but there is no actual intersection point and it will not be further refined; the number 3 indicates that the polyhedron mesh surface at this place is not only triangulated but also further refined due to the existence of intersection points and intersection lines; the number 4 indicates that the polyhedron mesh unit at this place is located inside the grid of the ore body surface and is hollowed out.

[0056] From Figure 6 it can be seen that the present invention correctly calculates the intersection points and intersection lines of the mine and ore body models, refines the surfaces where the intersection points occur, and removes the geometric elements located inside the ore body model, while retaining the attribute information of the ore body model itself. This shows that the present invention is effective in dealing with complex 3D geological modeling and can generate a result grid with accurate geometric topology while retaining the attribute information of the input grid.

[0057] Embodiment 2

[0058] As Figure 7 shown, the embodiment of the present invention provides a polyhedron mesh cutting system for 3D geological modeling, including the following modules:

[0059] An edge-face pair acquisition module 51, configured to take the surface mesh and the polyhedron mesh as inputs and screen out the edge-face pairs with intersecting bounding boxes;

[0060] An intersection point and intersection line acquisition module 52, configured to calculate all intersection points and intersection lines by traversing the edge-face pairs;

[0061] A mesh surface refinement module 53, configured to insert the intersection points and intersection lines into the mesh surfaces corresponding to the surface mesh and the polyhedron mesh and refine them;

[0062] A cut result grid generation module 54, configured to cut the polyhedron units intersecting with the surface mesh into two parts, inside and outside, and generate a cut result grid according to the unit connectivity of the polyhedron mesh.

[0063] A polyhedron mesh cutting device for 3D geological modeling, comprising one or more electronic devices, wherein the one or more electronic devices are used to implement a polyhedron mesh cutting method, system and device for 3D geological modeling.

[0064] An electronic device, comprising: one or more processors; a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement a polyhedron mesh cutting method, system and device for 3D geological modeling.

[0065] A computer-readable storage medium having executable instructions stored thereon, which when executed by a processor cause the processor to implement a polyhedron mesh cutting method, system and device for 3D geological modeling.

[0066] A non-transitory computer-readable storage medium having a computer program stored thereon, which when executed by a processor implements a polyhedron mesh cutting method, system and device for 3D geological modeling.

[0067] The above are only specific embodiments of the present invention, enabling those skilled in the art to understand or implement the present application. Various modifications to these embodiments will be obvious to those skilled in the art, and the general principles defined herein can be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present invention will not be limited to these embodiments shown herein, but rather to the broadest scope consistent with the principles and novel features claimed herein.

Claims

1. A polyhedron mesh cutting method for three-dimensional geological modeling, characterized in that: include: Step S1: Taking the surface mesh and the polyhedral mesh as input, filter out the edge-faces where the bounding boxes intersect; Step S2: traversing the edge-face pairs to calculate all intersection points and intersection lines; Step S3: inserting the intersection points and intersection lines into the mesh surfaces corresponding to the surface mesh and the polyhedral mesh and refining them; Step S4: cutting the polyhedral units intersecting with the surface mesh into inner and outer parts, and generating a cutting result mesh according to the unit connectivity of the polyhedral mesh.

2. The polyhedron mesh cutting method for three-dimensional geological modeling according to claim 1, characterized in that: The step S1: using the surface mesh and the polyhedral mesh as input, screening out the edges-faces where the bounding boxes intersect, specifically includes: Step S11: obtaining a polyhedral mesh for representing a geological body and a surface mesh for representing a local model; Step S12: using two bounding box arrays to respectively record the AABB bounding boxes corresponding to all the edges of the surface mesh and all the faces of the polyhedral mesh; using a bounding box test algorithm to perform intersection detection, when it is detected that an edge of the surface mesh intersects with a face bounding box of the polyhedral mesh, the edge-face pair is recorded in an associative container 1, and the polyhedral mesh face is triangulated to obtain a newly added triangulated face, and added to the associative container 1; Step S13: Use two bounding box arrays to respectively record the AABB bounding boxes corresponding to all edges of the polyhedral mesh and all faces of the surface mesh, and use the same method as step S12 to record the polyhedral mesh edges and surface mesh faces where the bounding boxes intersect in the associative container 2.

3. The polyhedron mesh cutting method for three-dimensional geological modeling according to claim 2, characterized in that: The step S2: calculating all intersection points and intersection lines by traversing the edge-to-face pairs, specifically includes: Step S21: traverse the associative container 1 and the associative container 2; for each edge-face pair, use arithmetic filtering to calculate geometric assertions, determine the intersection type of the edge and the face, if they actually intersect, calculate the intersection point, and record the intersection point information, including: the coordinate position of the intersection point; the relationship between the intersection point and the edge and face that generate the intersection point, including: the intersection point falls inside the face, on the edge, or on the vertex, the intersection point falls inside the edge or on the vertex; and the adjacent information of the intersection point; Step S22: deleting all edge-face pairs that generate the intersection from the associative container 1 and the associative container 2.

4. The polyhedron mesh cutting method for three-dimensional geological modeling according to claim 3, characterized in that: The step S3: inserting the intersection points and intersection lines into the mesh surfaces corresponding to the surface mesh and the polyhedral mesh and refining them, specifically includes: Step S31: according to the intersection information, find all the intersection points that fall inside the edge, query a half-edge associated with the edge, and insert the intersection points into the edge in the order of distance from the end point of the half-edge, interrupt the edge, and insert the points farther from the end point first; after inserting the intersection points, adjust the predecessor and successor relationship of the corresponding half-edge; Step S32: After the edges of the surface mesh and the polyhedral mesh are interrupted at the intersection, the constrained Delaunay triangulation algorithm is used to refine the faces of the surface mesh and the polyhedral mesh with the intersection one by one, and then the refined results are added to the mesh, and the topology within the face is adjusted so that the surface mesh and the polyhedral mesh contain points and edges corresponding to the intersection points and intersection lines.

5. The polyhedron mesh cutting method for three-dimensional geological modeling according to claim 4, characterized in that: The step S4: cutting the polyhedral unit intersecting with the surface mesh into two parts, inner and outer parts, and generating a cutting result mesh according to the unit connectivity of the polyhedral mesh, specifically includes: Step S41: for each intersection line ring where the polyhedral mesh unit intersects with the surface mesh, obtain the associated surface of the intersection line ring in the polyhedral mesh unit and the surface mesh, and mark the internal and external attributes of the associated surface according to the normal vector information of the associated surface; Step S42: starting from the associated surface, marking all surfaces connected to it as having the same internal and external attributes as the associated surface; when marking, only the surfaces located inside the polyhedral mesh unit are marked in the surface mesh; Step S43: after the marking is completed, the faces in the polyhedral mesh located inside the surface mesh and the faces in the surface mesh located inside the polyhedral mesh unit are combined to obtain the polyhedral mesh unit located inside the surface mesh and intersecting with it; the faces in the polyhedral mesh located outside the surface mesh and the faces in the surface mesh located inside the polyhedral mesh unit are combined to obtain the polyhedral mesh unit located outside the surface mesh and intersecting with it; Step S44: Based on the connectivity of the polyhedral mesh, starting from the polyhedral mesh units intersecting with the surface mesh, the polyhedral mesh units located inside and outside the surface mesh and not intersecting with the surface mesh are extracted respectively, thereby forming a complete polyhedral mesh located inside and outside the surface mesh.

6. A polyhedron mesh cutting system for three-dimensional geological modeling, characterized in that: Includes the following modules: Get edge-to-face facing module, which takes surface mesh and polyhedral mesh as input and filters out edge-to-face faces where bounding boxes intersect; A module for obtaining intersection points and intersection lines is used to calculate all intersection points and intersection lines by traversing the edge-to-face pairs; A mesh surface refinement module, used for inserting the intersection points and intersection lines into the mesh surfaces corresponding to the surface mesh and the polyhedral mesh and refining them; The cutting result mesh generation module is used to divide the polyhedral units intersecting the surface mesh into inner and outer parts, and generate the cutting result mesh according to the unit connectivity of the polyhedral mesh.

7. A polyhedron mesh cutting device for three-dimensional geological modeling, characterized in that: The method comprises one or more electronic devices, wherein the one or more electronic devices are used to implement the method according to any one of claims 1 to 5.

8. An electronic device, characterized in that: include: one or more processors; A memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 5.

9. A computer-readable storage medium, characterized in that: Executable instructions are stored thereon, and when the instructions are executed by a processor, the processor implements the method according to any one of claims 1 to 5.

10. A non-transitory computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.

Images