Digital geological tunnel three-dimensional model generation and application method, device and electronic equipment

Abstract

The present disclosure relates to a digital geological tunnel three-dimensional model generation and application method and device and electronic equipment, and relates to the technical field of digital mine, and comprises the following steps: reading a pretreated tunnel contour line; performing triangulation processing on the tunnel contour line to generate initial triangulation network data meeting the empty circle condition; performing traversal marking on the initial triangulation network data according to the principle of topology to obtain constrained edges and unconstrained edges; identifying a tunnel opening edge from the constrained edges, and drawing a tunnel profile contour line on the tunnel opening edge and the unconstrained edges; for each triangle in the initial triangulation network, in response to the tunnel profile contour line, repeatedly performing a target operation until the traversal of all triangles is completed, to generate target triangulation network data; and transmitting the target triangulation network data to a front end for rendering to generate a digital geological tunnel three-dimensional model. The present disclosure avoids manual operation, saves manpower and time cost, reduces labor intensity, avoids manual operation errors, and improves model accuracy and reliability.

Description

Technical Field

[0001] This disclosure relates to the field of digital mining technology, specifically to a method, apparatus, and electronic equipment for generating and applying a three-dimensional model of a digital geological tunnel. Background Technology

[0002] Mine geological management is a core aspect of mining operations, and its level of informatization and visualization directly affects mine production safety and operational efficiency. Currently, traditional mine geological management relies primarily on two-dimensional drawings and manual records, which suffers from significant drawbacks such as unintuitive information expression, low data management efficiency, and susceptibility to errors. In particular, two-dimensional drawings struggle to accurately depict the three-dimensional spatial morphology of underground structures such as tunnels, causing considerable inconvenience for construction planning, safety assessments, and decision-making.

[0003] With the development of 3D visualization and digital twin technologies, constructing high-precision 3D models of digital geological tunnels has become crucial for realizing the digitalization and intelligentization of mines. These models can intuitively and completely present the spatial layout and structural details of the tunnels, forming the foundation for building a mine digital twin system. However, current methods for generating 3D models of digital geological tunnels still heavily rely on manual operations, such as manual drawing, triangulation, and feature annotation. These methods are not only time-consuming and labor-intensive, but also prone to introducing human error, leading to reduced model accuracy and reliability. Summary of the Invention

[0004] In view of this, this disclosure provides a method, apparatus and electronic device for generating and applying a three-dimensional model of a digital geological tunnel. The main purpose is to solve the technical problem that the current method for generating three-dimensional models of digital geological tunnels still relies heavily on manual operation, which is not only time-consuming and labor-intensive, but also prone to introducing human error, resulting in reduced model accuracy and reliability.

[0005] According to a first aspect of this disclosure, a method for generating a three-dimensional model of a digital geological tunnel is provided, the method comprising:

[0006] Read the tunnel outline from the current tunneling status map, eliminate the intersections in the tunnel outline, and optimize the tunnel outline.

[0007] The processed tunnel outline is used as a constraint condition for constrained Delaunay triangulation to generate initial triangulation data that satisfies the empty circularity condition, wherein the empty circularity condition is that the circumcircle of any triangle does not contain other points and any four points are not concyclic.

[0008] The initial triangular network data is traversed according to topological principles, and the edges in the initial triangular network data are marked as constrained edges and unconstrained edges.

[0009] According to the preset geometric criteria, the sides of the tunnel entrance are identified from the constrained sides. On the sides of the tunnel entrance and the unconstrained sides, the tunnel profile outline is drawn based on the given arch height parameter data and waist height parameter data, using the geometric construction principle of the three-center arch.

[0010] Traverse each triangle in the initial triangulation. For each triangle, in response to the tunnel profile outline, repeat the target operation until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel 3D model.

[0011] The generated target triangular network data is transmitted to the front end for rendering to generate the digital geological tunnel 3D model.

[0012] According to a second aspect of this disclosure, a method for applying a three-dimensional model of a digital geological tunnel is provided, the method comprising:

[0013] Input the current tunneling status map, waist height parameter data, and arch height parameter data into the digital geological tunnel 3D model to generate the application result set of the tunnel 3D model. The application result set includes tunnel profile map, tunnel excavation volume, and tunnel filling volume.

[0014] According to a third aspect of this disclosure, an apparatus for generating a three-dimensional model of a digital geological tunnel is provided, the apparatus comprising:

[0015] The reading module is used to read the tunnel outline in the current tunneling status map, eliminate the intersections in the tunnel outline, and optimize the tunnel outline.

[0016] The first generation module is used to perform constrained Delaunay triangulation processing on the processed tunnel outline as a constraint condition to generate initial triangular network data that satisfies the empty circularity condition, wherein the empty circularity condition is that the circumcircle of any triangle does not contain other points, and any four points are not concyclic.

[0017] The marking module is used to traverse the initial triangulation data according to the principles of topology and mark the edges in the initial triangulation data as constrained edges and unconstrained edges.

[0018] The drawing module is used to identify the sides of the tunnel entrance from the constrained sides according to the preset geometric criteria, and draw the tunnel profile outline on the sides of the tunnel entrance and the unconstrained sides based on the given arch height parameter data and waist height parameter data, using the geometric construction principle of the three-center arch.

[0019] The execution module is used to traverse each triangle in the initial triangulation. For each triangle, in response to the tunnel profile outline, the target operation is repeatedly executed until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel 3D model.

[0020] The rendering module is used to transmit the generated target triangular network data to the front end for rendering, so as to generate the digital geological tunnel 3D model.

[0021] According to a fourth aspect of this disclosure, an application device for a three-dimensional model of a digital geological tunnel is provided, the device comprising:

[0022] The second generation module is used to input the current tunneling status map, waist height parameter data, and arch height parameter data into the digital geological tunnel 3D model to generate the application result set of the tunnel 3D model. The application result set includes tunnel profile map, tunnel excavation volume, and tunnel filling volume.

[0023] According to a fifth aspect of this disclosure, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method for generating a three-dimensional digital geological tunnel model of the first aspect described above, or the method for applying a three-dimensional digital geological tunnel model of the second aspect described above.

[0024] According to a sixth aspect of this disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to cause a computer to execute the method for generating a three-dimensional digital geological tunnel model of the first aspect, or the method for applying a three-dimensional digital geological tunnel model of the second aspect.

[0025] This disclosure provides a method, apparatus, and electronic device for generating and applying a three-dimensional model of a digital geological tunnel. Compared with existing technologies, this disclosure first reads the tunnel outline from the current tunneling status map, eliminates intersections in the tunnel outline, and optimizes the tunnel outline. The optimized tunnel outline is then used as a constraint for constrained Delaunay triangulation to generate initial triangulation data that satisfies the condition of empty circularity. The condition of empty circularity is that the circumcircle of any triangle does not contain other points, and any four points are not concyclic. Based on topological principles, the initial triangulation data is traversed to obtain the desired results. Edges are marked as constrained and unconstrained edges. According to preset geometric criteria, the edges of the tunnel entrance are identified from the constrained edges. On the edges of the tunnel entrance and the unconstrained edges, based on the given arch height and waist height parameters, the geometric construction principle of the three-center arch is used to draw the tunnel profile outline. Each triangle in the initial triangular mesh is traversed. For each triangle, in response to the tunnel profile outline, the target operation is repeated until all triangles are traversed, generating the target triangular mesh data of the complete digital geological tunnel 3D model. The generated target triangular mesh data is transmitted to the front end for rendering to generate the digital geological tunnel 3D model.

[0026] By applying the solution disclosed herein, the tunnel outline in the current tunneling status map is first automatically read, then the intersections in the tunnel outline are automatically eliminated, and the outline is optimized. The whole process avoids the errors and inconsistencies that may occur when manually drawing and modifying the outline, greatly saving manpower and time costs and reducing labor intensity.

[0027] The processed tunnel outline is used as a constraint condition for constrained Delaunay triangulation to generate initial triangulation data. Based on topological principles, the edges in the initial triangulation data are automatically marked as constrained edges and unconstrained edges. This automated processing can ensure the accuracy and consistency of these basic tasks, avoid errors that may be caused by manual operation, and improve processing efficiency.

[0028] Based on preset geometric criteria, the edges of the tunnel entrance are automatically identified from the constrained edges. Then, on the edges of the tunnel entrance and the unconstrained edges, the tunnel profile outline is automatically drawn based on the given arch height and waist height parameters and the geometric construction principle of the three-center arch. This automated processing can complete these tasks accurately and quickly, reducing errors in manual judgment and drawing, and improving the accuracy and reliability of the model.

[0029] By traversing each triangle in the initial triangulation, and for each triangle, in response to the tunnel profile outline, the target operation is repeatedly performed until all triangles have been traversed, automatically generating the target triangulation data of the complete digital geological tunnel 3D model. This method ensures that the entire target triangulation data generation process does not require manual intervention, ensuring the consistency and integrity of the model construction, avoiding omissions or errors that may occur when manually building the model, and improving the efficiency and quality of model generation.

[0030] By employing constrained Delaunay triangulation, the processed tunnel contour lines are used as constraints to generate initial triangular mesh data. Constrained Delaunay triangulation can better adapt to complex tunnel contours, and the generated triangular mesh can more accurately describe the tunnel's geometry. This method can generate more reasonable triangular meshes for tunnels with complex shapes and topologies, improving the model's ability to represent complex tunnel structures and enabling the model to more accurately reflect the actual tunnel conditions. Attached Figure Description

[0031] The accompanying drawings, which are incorporated in and form a part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure.

[0032] To more clearly illustrate the technical solutions in the embodiments of this disclosure or the prior art, the accompanying drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0033] Figure 1 A flowchart illustrating a method for generating a three-dimensional model of a digital geological tunnel provided in an embodiment of this disclosure;

[0034] Figure 2 This is a current state diagram of tunneling provided in an embodiment of the present disclosure;

[0035] Figure 3 A schematic diagram of the intersection of a tunnel outline provided in an embodiment of this disclosure;

[0036] Figure 4 This is a diagram showing the result of an elimination process provided in an embodiment of this disclosure;

[0037] Figure 5 A tunnel outline diagram provided in an embodiment of this disclosure;

[0038] Figure 6 This is a triangulation result diagram generated within a tunnel outline, provided by an embodiment of the present disclosure;

[0039] Figure 7 This is a topology connection attribute marking diagram provided in an embodiment of the present disclosure;

[0040] Figure 8 This is a schematic diagram of a tunnel entrance provided in an embodiment of the present disclosure;

[0041] Figure 9 A schematic diagram of a method for drawing a tunnel profile outline according to an embodiment of this disclosure;

[0042] Figure 10 This is a tunnel profile outline generation result diagram provided in an embodiment of the present disclosure;

[0043] Figure 11 A triangulation network data diagram of a tunnel profile provided in an embodiment of this disclosure;

[0044] Figure 12 This is a model result diagram provided in an embodiment of the present disclosure;

[0045] Figure 13 A flowchart illustrating another method for generating a three-dimensional model of a digital geological tunnel provided in this embodiment of the present disclosure;

[0046] Figure 14 A schematic diagram of the structure of a device for generating a three-dimensional model of a digital geological tunnel provided in an embodiment of this disclosure;

[0047] Figure 15 This is a schematic diagram of the structure of an application device for a three-dimensional model of a digital geological tunnel provided in an embodiment of this disclosure. Detailed Implementation

[0048] The exemplary embodiments of this disclosure are described below with reference to the accompanying drawings, including various details of the embodiments to aid understanding. These should be considered merely exemplary. Therefore, those skilled in the art will recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of this disclosure. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description. It should be noted that, unless otherwise specified, the embodiments of this disclosure and the features described therein can be combined with each other.

[0049] The following describes, with reference to the accompanying drawings, a method, apparatus, and electronic equipment for generating and applying three-dimensional models of digital geological tunnels according to embodiments of the present disclosure.

[0050] To address the current method of generating 3D models of digital geological tunnels, which still heavily relies on manual operation—a method that is time-consuming, labor-intensive, and prone to human error, leading to reduced model accuracy and reliability—this embodiment provides a method for generating 3D models of digital geological tunnels. Figure 1 As shown, the method includes:

[0051] Step 101: Read the tunnel outline in the current tunneling status map, eliminate the intersections in the tunnel outline, and optimize the tunnel outline.

[0052] Among them, the tunneling status map can be an engineering drawing drawn based on actual measurement data during the construction of underground projects such as mines and tunnels. It reflects the spatial location, geometric shape, size and interrelationship of the excavated parts of underground roadways (including tunnels, chambers, etc.) at a specific point in time.

[0053] The tunnel outline can be a closed or open line used to define the excavation boundary or design boundary of the tunnel in the current tunneling plan. For a standard arched tunnel, its outline is usually composed of a straight line at the bottom (representing the tunnel floor) and an arc at the top (representing the tunnel arch). In the plan view (top view), the tunnel outline is represented by two parallel lines, representing the two side walls of the tunnel.

[0054] An intersection point refers to an illegal overlap between two line segments that should not intersect. This is usually caused by drawing errors, data accuracy issues, or overlapping of lines from different layers, which disrupts the continuity and uniqueness of the roadway boundary and is a type of topological error.

[0055] In this embodiment of the disclosure, reading the tunnel outline from the current tunneling status map, eliminating intersections in the tunnel outline, and optimizing the tunnel outline are the first and crucial foundational steps in the entire 3D modeling process. The current tunneling status map is typically a 2D drawing created using CAD software, which includes the tunnel's projected outline on a plane, such as... Figure 2 As shown. However, due to human drawing errors, format compatibility issues during data import and export, or the overlay of drawings from different surveying stages, these contour lines often have problems such as irregular intersections, breaks, or incorrect connections. If these flawed contour lines are used directly for subsequent triangulation and 3D modeling, it will lead to the generation of incorrect geometric structures, or even cause the entire modeling process to fail.

[0056] Therefore, the purpose of this step is to clean and repair the original, potentially defective, tunnel outline data, making it a clean set of data with a clear topological structure, accurate geometry, and the ability to be correctly understood and processed by computer programs.

[0057] Specifically, such as Figure 3 As shown, Figure 3 This is a schematic diagram of the intersection points of the tunnel outlines. From... Figure 3As can be seen, the original tunnel outline intersects unreasonably at the circles, disrupting the continuous boundary that the tunnel should have. To eliminate such intersections, this step may specifically include the following sub-steps:

[0058] Step 1: Set the endpoints of the tunnel outline as nodes and the segments of the tunnel outline as edges, and construct a directed graph based on the nodes and edges.

[0059] Specifically, the system first traverses all tunnel outlines, each with two endpoints. The system extracts all endpoints as nodes in graph theory. Simultaneously, the line segments connecting these endpoints are treated as edges. To represent the tunnel's direction of extension or connectivity, each edge is assigned a direction, thus constructing a directed graph. This directed graph serves as a mathematical and structured representation of the original tunnel outlines within the computer, transforming the graph problem into a graph theory problem that can be analyzed using mature algorithms.

[0060] Step 2: Use the topological sorting algorithm to detect the directed graph and determine whether there are cycles in the directed graph. Cycles are used to represent the intersection points of the roadway outline.

[0061] In a well-constructed directed graph, a healthy, non-intersecting network of lane outlines should have a topology consisting of a series of non-intersecting simple closed loops (i.e., the boundaries of individual lanes) or a tree-like branching structure. This structure is a manifestation of a directed acyclic graph, meaning that there are no loops.

[0062] This step can use a topological sorting algorithm for detection. Topological sorting is a sorting algorithm for directed acyclic graphs (DAGs), which arranges all nodes in the graph into a linear sequence such that for any directed edge (U, V), node U precedes node V. If a cycle exists in the directed graph, since each node in the cycle has a predecessor node, it is impossible to find a node without in-degree as the sorting starting point. Therefore, the nodes in the cycle cannot be topologically sorted. Thus, when the topological sorting algorithm fails or cannot sort all nodes, it can be determined that a cycle exists in the directed graph. In this application scenario, the appearance of a cycle is a direct mathematical representation of the intersection points of the lane outline. For example, Figure 1 The intersection points in the graph will form a small loop in the corresponding directed graph.

[0063] Step 3: If a loop is detected in the directed graph, the connection order of the roadway outline is adjusted to eliminate the intersections in the roadway outline.

[0064] In this embodiment of the disclosure, once a loop is detected, the system locates the area where the intersection is located. Next, the system can automatically execute a repair strategy. The core of this strategy can be adjusting the connection sequence of the tunnel outline. Specifically, the system can analyze the edges constituting the loop, identify the original or erroneous connection relationships, and re-plan the connection method of these edges according to the geometric principle that the tunnel should extend continuously along the centerline or boundary. For example, in... Figure 1 At the intersection, two line segments that should be parallel or sequentially connected mistakenly intersect. The system can disconnect the incorrect connection and connect the endpoints of the line segments to the correct, adjacent endpoints, thereby breaking the loop and finding the connection scheme that best suits the actual tunnel layout.

[0065] Step 4: Update the tunnel outline according to the connection sequence of the adjusted tunnel outline.

[0066] In this embodiment of the disclosure, after adjusting the connection order, the system can generate a new set of tunnel outline data based on the new and correct topological relationships. The intersections in this set of data have been eliminated, and the tunnel outline becomes continuous, clear, and logically consistent. For example... Figure 4 As shown, Figure 4 To eliminate the processed result image. Compare. Figure 1 As can be seen, the intersection at the crossroads has been corrected, and the tunnel outline has formed a clear and independent boundary.

[0067] Step 102: Use the processed tunnel outline as a constraint condition to perform constrained Delaunay triangulation to generate initial triangulation data that satisfies the empty circularity condition. The empty circularity condition is that the circumcircle of any triangle does not contain other points, and any four points are not concyclic.

[0068] In this embodiment, step 102 is the geometric construction core of the entire 3D modeling process. After optimization in step 101, a set of clear, accurate, and non-intersecting tunnel outlines is obtained. However, these tunnel outlines are merely a collection of line segments; they define the boundaries of the tunnels but do not fill their interior areas. To construct the 3D model, a mesh composed of triangles needs to be generated on the 2D plane enclosed by these tunnel outlines; this process is called triangulation.

[0069] However, while conventional triangulation methods can fill in regions, the quality of the generated triangles varies greatly, with some being excessively long or irregularly shaped. These low-quality triangles can cause difficulties in subsequent steps such as alleyway entrance identification, arch structure generation, and 3D rendering, and may even lead to algorithm failure.

[0070] To address this issue, this disclosure employs constrained Delaunay triangulation. This method, based on classic Delaunay triangulation, introduces the concept of constraints, making it particularly suitable for this application scenario.

[0071] Specifically, the execution process of this step is as follows:

[0072] First, the processed and updated tunnel contour lines from step 101 are used as input data. These tunnel contour lines are set as constraint edges during the triangulation process. This means that in the final generated triangular mesh, these tunnel contour lines must exist as edges of triangles and cannot be destroyed or ignored by the triangulation algorithm. This ensures that the generated triangular mesh accurately preserves the boundary features of the original tunnels, such as... Figure 5 As shown.

[0073] This disclosure allows for triangulation within a region bounded by the tunnel contour line using an incremental insertion algorithm based on edge flipping. This algorithm strictly adheres to the empty circle condition when generating each new triangle. This means the algorithm can dynamically adjust the connection method of the triangles, ensuring that for any triangle in the mesh, its circumcircle does not contain any other data points. Simultaneously, the algorithm avoids the situation where four points are concyclic, preventing the Delaunay triangulation results from being non-unique and thus affecting the stability of the model.

[0074] After the above subdivision process, the system can finally generate a triangular mesh covering the entire internal area of ​​the tunnel, i.e., the initial triangular mesh data, such as... Figure 6 As shown, the initial triangulation data not only contains the vertex coordinates of all triangles, but also records the connection relationships (i.e., edges) between vertices and the adjacency relationships between triangles. Because it satisfies the empty circle condition, the triangles in the initial triangulation generally tend to be equilateral triangles, achieving optimal shape and avoiding overly elongated obtuse triangles. This lays a high-quality geometric foundation for subsequent geometric analysis and 3D modeling.

[0075] Through this step, this disclosure successfully transforms discrete contour lines into a high-quality, structured triangular mesh, achieving a leap from lines to surfaces. Its strategy of constraining Delaunay triangulation and ensuring void circularity conditions greatly improves the accuracy and reliability of triangulation, providing solid data support for subsequent complex operations such as automated identification of tunnel entrances and generation of arched structures.

[0076] Step 103: Traverse the initial triangular network data according to the principles of topology, and mark the edges in the initial triangular network data as constrained edges and unconstrained edges.

[0077] In this embodiment of the disclosure, a key step is to semantically process the initial triangulation data generated in step 102. Although the initial triangulation is geometrically accurate, from an information theory perspective, it loses the most important information from the original input, namely, which line segments are the original tunnel outlines. The purpose of this disclosure is to reinject this crucial information into the triangulation data structure.

[0078] Specifically, the marking process mainly includes:

[0079] Edges in the initial triangulation data that coincide with the roadway outline are marked as constraint edges, which are represented as external links in the topology.

[0080] Edges in the initial triangular network data that do not coincide with the roadway outline are marked as unconstrained edges, which are represented as internal links in the topology.

[0081] In this embodiment of the disclosure, when performing constrained Delaunay triangulation (i.e., step 102), the processed tunnel contour lines can be used as constraint inputs. That is, when generating the triangular mesh, it must be ensured that these original contour line segments will ultimately appear completely in the generated triangular mesh, without being segmented or replaced by new diagonals. Therefore, marking constraint edges is essentially a matching and identification process. The system can traverse all edges in the initial triangular mesh data and compare the coordinates of the two endpoints of each edge with the original input tunnel contour line segments. If an edge in a triangular mesh completely coincides with an original tunnel contour line segment (i.e., the endpoint coordinates are the same or within a very small error range), then that edge is marked as a constraint edge.

[0082] Corresponding to constrained edges, all edges in the initial triangulation that do not coincide with any original tunnel contour lines are marked as unconstrained edges. These edges are automatically generated connecting lines during the triangulation process to divide the polygonal region enclosed by the entire contour lines into individual triangles. Their function is to fill and connect, not to define boundaries, such as... Figure 7 As shown.

[0083] Step 104: Based on the preset geometric criteria, identify the edges of the tunnel entrance from the constrained edges. On the edges of the tunnel entrance and the unconstrained edges, draw the tunnel profile outline according to the given arch height parameter data and waist height parameter data, using the geometric construction principle of the three-center arch.

[0084] In this embodiment, the identification of the tunnel entrance is not based on simple image recognition or manual designation, but on a preset geometric judgment logic. Specifically, identifying the edges of the tunnel entrance from the constraint edges according to preset geometric criteria may include:

[0085] Traverse all triangles in the initial triangulation data after marking, and obtain candidate triangles containing the first constraint edge and the second constraint edge, where the first constraint edge is any one of the two constraint edges in the candidate triangle, and the second constraint edge is the other constraint edge in the candidate triangle.

[0086] If a third constraint edge is obtained that is connected to the second constraint edge but does not belong to the candidate triangle, then calculate the first included angle between the second constraint edge and the third constraint edge, and calculate the second included angle between the second constraint edge and the first constraint edge;

[0087] If the first included angle satisfies the condition that the angle difference with the first target angle is less than the first preset angle difference, and the second included angle satisfies the condition that the angle difference with the second target angle is less than the second preset angle difference, then the first constrained edge is determined to be the edge of the alleyway entrance and is marked.

[0088] If a third constraint edge that is connected to the second constraint edge and does not belong to a candidate triangle is not obtained, then a fourth constraint edge that is connected to the first constraint edge and does not belong to a candidate triangle is obtained.

[0089] Calculate the third angle between the first constraint edge and the fourth constraint edge;

[0090] If the third included angle satisfies the condition that the angle difference with the third target angle is less than the third preset angle difference, and the second included angle satisfies the condition that the angle difference with the second target angle is less than the second preset angle difference, then the second constraint edge is determined to be the edge of the alleyway entrance and is marked.

[0091] First, step 1: Traverse all triangles in the initial triangulation data marked in step 103. During the traversal, triangles containing two constraint edges can be selected. These triangles typically appear at the corners or intersections of tunnels and are the most likely geometric signals at tunnel entrances, thus being selected as candidate triangle ΔABC.

[0092] After obtaining the candidate triangle, its two internal constraint edges are named for ease of description and calculation. One is arbitrarily designated as the first constraint edge (i.e., edge 1), and the other as the second constraint edge (i.e., edge 2). It is important to emphasize that "first" and "second" are merely designations to distinguish the two variables and do not imply any priority or order.

[0093] Step 2: Next, check the second constraint edge to determine if there is another edge connected to it, but this edge does not belong to the current candidate triangle. If such an edge exists, and it is also a constraint edge (representing another section of the tunnel wall), then it is recorded as the third constraint edge (i.e., edge 3). The third constraint edge can represent the tunnel wall extending from the second constraint edge.

[0094] Step 3: The first included angle (∠a) between the second constraint edge and the third constraint edge can be calculated, where the first included angle can be used to reflect the straightness of the roadway extending from the second constraint edge.

[0095] Simultaneously, the second included angle (∠b) between the second constraint edge and the first constraint edge can be calculated. The second included angle can be used to reflect the intersection angle of the two original walls at the corner.

[0096] The two included angles can be compared with the preset geometric criteria. Specifically, it can be determined whether the difference between the first included angle (∠a) and the first target angle (e.g., 180 degrees) is less than the difference between the first preset angle (e.g., 10 degrees). This is equivalent to determining whether the first included angle (∠a) is close to 180 degrees, that is, whether the third constraint side is close to collinear with the second constraint side. If they are collinear, it means that the direction of the tunnel entrance is straight.

[0097] It can be determined whether the difference between the second included angle (∠b) and the second target angle (e.g., 90 degrees) is less than the difference between the second preset angle (e.g., 15 degrees), which is equivalent to determining whether the second included angle (∠b) is close to 90 degrees. If it is close to 90 degrees, it means that the two original walls are close to perpendicular to each other.

[0098] If both of the above conditions are met, the geometric structure can be determined as a tunnel entrance. At this point, the first constraint edge is officially identified as the tunnel entrance edge and is specially marked. Subsequently, the algorithm returns to step 1 to continue searching for the next candidate triangle.

[0099] Step 4: If a third constraint edge connected to the second constraint edge cannot be found, the direction of the tunnel entrance can be determined by the first constraint edge. At this point, the strategy can be switched to check the first constraint edge instead.

[0100] We can try to find another constraint edge that is connected to the first constraint edge but does not belong to the candidate triangle, and mark it as the fourth constraint edge. If the fourth constraint edge also does not exist, it means that the current candidate triangle may be an invalid structure or an isolated corner, and we can abandon this triangle and return to step 1 to continue traversing.

[0101] Step 5: If the fourth constraint edge exists, the third included angle (∠c) between the first constraint edge and the fourth constraint edge can be calculated. Its purpose is the same as that of the first included angle, which is to determine the straightness of the extension direction of the tunnel entrance.

[0102] The angle between the first and second constraint edges (i.e., the second angle (∠b)) can be calculated again, with the purpose of determining the intersection angle at the corner.

[0103] It can determine whether the difference between the third included angle (∠c) and the third target angle (e.g., 180 degrees) is less than the difference between the third preset angle (e.g., 10 degrees), and at the same time determine whether the difference between the second included angle (∠b) and the second target angle (e.g., 90 degrees) is less than the difference between the second preset angle (e.g., 15 degrees).

[0104] If both conditions are met, the second constraint edge is determined to be the edge of the alleyway entrance and marked, then return to step 1 to continue traversing.

[0105] Through the aforementioned staged judgment process, this disclosure can simulate the observation logic of human experts, automatically and reliably identifying all tunnel edges that conform to geometric definitions from complex triangular networks. This provides the most crucial geometric feature information for ultimately constructing a three-dimensional tunnel network model with correct topological relationships, such as... Figure 8 As shown.

[0106] In this embodiment of the disclosure, after successfully identifying the roadway entrance edge, a standardized cross-sectional shape that conforms to engineering reality is assigned to each edge that constitutes the roadway network skeleton (including the identified roadway entrance edge and the previously marked unconstrained edge), that is, the roadway profile outline is drawn, realizing the key geometric construction step of converting from a two-dimensional plan view to a three-dimensional solid model.

[0107] Specifically, at the edges and unconstrained edges of the tunnel entrance, based on the given arch height and waist height parameters, the tunnel profile outline is drawn using the geometric construction principle of a three-centered arch, which may include:

[0108] Construct a basic rectangle with the span of the tunnel as the length and the arch height as the width, where the span corresponds to the side length of the tunnel entrance or the unconstrained side.

[0109] Within the basic rectangle, the first, second, and third centers of the arch are determined sequentially by drawing angle bisectors of the preset angles.

[0110] Based on the first center, the second center, the third center and their corresponding radii, draw the outline of the tunnel arch formed by the smooth connection of multiple circular arcs;

[0111] At both ends of the tunnel arch outline, extend downwards by a given waist height to draw the tunnel sidewall outline.

[0112] The complete tunnel profile outline is formed by the tunnel arch outline and the sidewall outline.

[0113] For embodiments of this disclosure, such as Figure 9As shown, first draw a basic rectangle (i.e., rectangle AFEG) with the span and arch height as its length and width. The span is the length of the side or unconstrained side of the tunnel entrance. Connect CA with the perpendicular bisector CD of the length. Draw the angle bisectors of angles ∠GCA and ∠GAC. The intersection of the two angle bisectors (i.e., M) is the point where the perpendicular bisectors are drawn from M to the opposite side (i.e., AC). Extend this perpendicular line so that it intersects the perpendicular bisector (i.e., CD) of the basic rectangle. This intersection point is the center of the first circle (point O).

[0114] At the same time, the intersection of this perpendicular line (MO) and the long side of the basic rectangle (AF) is the center of the second circle. ).

[0115] With center O and radius OM (the distance from O to the intersection of the angle bisectors), draw the first arc (MCK). Using the second circle as the center, the distance from the second circle's center to the vertex of the rectangle ( A) is the radius, draw the second arc (i.e., arc AM);

[0116] Connect CF, and draw the angle bisectors of ∠ECF and ∠EFC. The intersection of the two angle bisectors is K. Draw a perpendicular line from this intersection point K to CF, and extend this perpendicular line until it intersects the perpendicular bisector of the basic rectangle (i.e., CD). This intersection point is the center of the third circle. ).by Using the third center as the center, the distance from the third center to the vertex of the rectangle (i.e., Using F as the radius, draw the third arc (i.e., arc FK) to obtain the complete tunnel arch outline (AMCKF) formed by the smooth connection of the three arcs (arc AM, arc MCK, arc FK).

[0117] The tunnel not only has an arched ceiling but also vertical walls (sidewalls). The algorithm extends downwards from both ends of the generated arched ceiling profile based on the waist height parameter given by the user.

[0118] Specifically, the extension of GA is AB, and the length of AB is the waist height; the extension of EF is FH, and the length of FH is the waist height, forming the two sidewall outlines of the tunnel (AB and FH).

[0119] Ultimately, the cross-sectional profile of the tunnel (AMCKFHB) formed by the tunnel arch profile (AMCKF) and the two sidewall profiles (AB and FH) is called the arch, as shown below. Figure 10 As shown.

[0120] Step 105: Traverse each triangle in the initial triangulation. For each triangle, in response to the tunnel profile outline, repeat the target operation until all triangles have been traversed, generating the target triangulation data of the complete digital geological tunnel 3D model.

[0121] In this embodiment, each triangle in the initial triangulation is traversed. For each triangle, in response to the tunnel profile outline, the target operation is repeatedly performed until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel 3D model. This process is not a simple stretching or Boolean operation, but rather, based on the topological relationship of the initial triangulation, it efficiently constructs the surface model of the 3D tunnel in a piecewise filling manner. The specific implementation logic is as follows:

[0122] Traverse each triangle in the initial triangulation. For each triangle, determine whether the three sides of the triangle contain constraint edges that are not at the entrance of the tunnel.

[0123] If included, obtain the roadway profile outline corresponding to the non-roadway entrance constraint edge and its two adjacent non-constraint edges to form a three-sided surface.

[0124] Triangulation is performed on the three sides, and the above operation is repeated until all triangles are traversed, generating the target triangular network data of the complete digital geological tunnel 3D model.

[0125] First, iterate through each triangle in the initial triangular network data generated in step 102. For the triangle currently being traversed, check the properties of its three sides to see if the triangle contains at least one constraint edge that is not at the entrance of the tunnel. The constraint edge that is not at the entrance of the tunnel can represent a standard, continuous wall inside the tunnel.

[0126] Once a triangle is determined to meet the conditions (i.e., it contains constraint edges that are not at the entrance of the alley), the target operation will be executed:

[0127] First, determine the constraint edges in the triangle that are not at the tunnel entrance. Then, obtain the other two unconstrained edges that are connected to this baseline edge and belong to the same triangle, since a triangle cannot contain three constraint edges at the same time. The two unconstrained edges represent the direction of extension from the wall baseline to the center of the tunnel.

[0128] Draw the corresponding tunnel profile outline (arch) for all constrained and unconstrained edges. The profile outline extracted in three-dimensional space will serve as three boundaries, thereby defining a complex, curved three-sided surface in three-dimensional space.

[0129] The three-sided surface formed by three complex curves cannot be directly rendered by a computer. Therefore, triangulation is required. This involves generating a series of new, tiny triangles within the surface, using this set of small triangles to accurately approximate and represent the complex surface. This process generates a large amount of vertex and triangle data, which forms part of the final 3D model.

[0130] Repeat this process until all triangles in the initial triangulation have been traversed, generating the target triangulation data for the complete 3D digital geological tunnel model. This provides complete geometric data for the subsequent construction of the 3D model, such as... Figure 11 As shown.

[0131] Step 106: Transmit the generated target triangular network data to the front end for rendering to generate a digital geological tunnel 3D model.

[0132] In this embodiment, the front-end application can use the real-time 3D development platform Unity. After receiving the transmitted target triangulation data, the Unity engine's built-in resource loading system can parse the file content and reconstruct the mesh object in memory, which consists of tens of thousands of vertices, normals, texture coordinates, and triangle indices.

[0133] Once the mesh object is successfully created in the Unity scene, the engine's rendering pipeline begins to work. It can render the 3D tunnel model in real time based on user-preset or default materials, lighting, shadows, and camera parameters. The real-time rendering process may include geometric transformations, lighting calculations, rasterization, etc., ultimately outputting the calculated pixel image to the monitor, allowing the user to see a three-dimensional, realistic digital geological tunnel model.

[0134] Among them, geometric transformation can be the transformation of model vertices from the local coordinate system to the world coordinate system, and then to the camera coordinate system;

[0135] Lighting calculations can calculate the color and brightness of each pixel based on the position and intensity of light sources in the scene and the material of the model;

[0136] Rasterization is the process of converting three-dimensional geometric primitives (triangles) into pixels on a two-dimensional screen.

[0137] Thanks to Unity's powerful interactive capabilities, users can not only observe the model statically, but also freely roam using a mouse, keyboard, or touchscreen.

[0138] The system can initiate an automated model validation process during or before model rendering and display. This process can traverse the target triangulation data to check for common geometric topology errors, such as anomalies like self-intersections or open edges.

[0139] In this case, self-intersection can occur when some facets of the model mistakenly cross other facets;

[0140] An open edge is an edge that should be shared by two triangles, but is only owned by one triangle, creating a hole in the model.

[0141] For detected standard errors, the system can automatically handle them by calling preset repair algorithms. For example, it can automatically fill holes formed by open edges or delete isolated geometric elements, greatly improving the efficiency of model post-processing.

[0142] For some complex or non-standard anomalies, automatic repair may not be able to solve the problem perfectly. In such cases, the system provides manual repair tools, allowing users to directly select the erroneous geometric elements in the 3D view and perform fine-grained operations such as editing, deletion, and reconstruction to ensure the geometric integrity and topological correctness of the final model. Figure 12 As shown.

[0143] The above embodiment describes the generation process of a three-dimensional model of a digital geological tunnel. Furthermore, to fully illustrate the implementation of this embodiment, this embodiment also provides a method for applying the three-dimensional model of a digital geological tunnel. For example... Figure 13 As shown, the method includes:

[0144] Step 201: Input the current tunneling status map, waist height parameter data, and arch height parameter data into the digital geological tunnel 3D model to generate the application result set of the tunnel 3D model. The application result set includes tunnel profile map, tunnel excavation volume, and tunnel filling volume.

[0145] In this embodiment of the disclosure, based on the current tunneling status map as the basic data, after optimization by removing intersections, a digital geological tunnel 3D model is generated according to the input waist height parameter data and arch height parameter data. The generated digital geological tunnel 3D model provides a more accurate tunnel profile in the design of medium and deep holes. At the same time, the tunnel excavation volume can be calculated through the tunnel model, and it can provide a basis for calculating the tunnel filling volume in the filling method mining process.

[0146] As one possible approach, the digital geological tunnel 3D model can be used to cut the model cross section along a preset cutting plane to generate a tunnel profile, and to perform volume integration calculation on the solid space surrounded by the initial triangular network data to obtain the tunnel excavation volume, and to calculate the tunnel filling volume based on the tunnel excavation volume and in combination with a preset filling coefficient or the actual filling body model.

[0147] Based on the above Figure 1 The specific implementation of the method shown in this embodiment provides a device for generating a three-dimensional model of a digital geological tunnel, such as... Figure 14 As shown, the device includes: a reading module 31, a first generation module 32, a marking module 33, a drawing module 34, an execution module 35, and a rendering module 36;

[0148] The reading module 31 is used to read the tunnel outline in the current tunneling status map, eliminate the intersections in the tunnel outline, and optimize the tunnel outline.

[0149] The first generation module 32 is used to perform constrained Delaunay triangulation processing on the processed tunnel outline as a constraint condition to generate initial triangular network data that satisfies the empty circularity condition, wherein the empty circularity condition is that the circumcircle of any triangle does not contain other points, and any four points are not concyclic.

[0150] The marking module 33 is used to traverse the initial triangular network data according to the topological principle and mark the edges in the initial triangular network data as constrained edges and unconstrained edges.

[0151] The drawing module 34 is used to identify the side of the tunnel entrance from the constrained side according to the preset geometric criteria, and draw the tunnel profile outline on the side of the tunnel entrance and the unconstrained side according to the given arch height parameter data and waist height parameter data, using the geometric construction principle of the three-center arch.

[0152] The execution module 35 is used to traverse each triangle in the initial triangulation. For each triangle, in response to the tunnel profile outline, the target operation is repeatedly executed until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel three-dimensional model.

[0153] The rendering module 36 is used to transmit the generated target triangular network data to the front end for rendering, so as to generate the digital geological tunnel three-dimensional model.

[0154] In a specific application scenario, the reading module 31 can be used to set the endpoints of the tunnel outline as nodes and the line segments of the tunnel outline as edges, and construct a directed graph based on the nodes and edges; use a topological sorting algorithm to detect whether there is a cycle in the directed graph, wherein the cycle is used to represent the existence of intersections in the tunnel outline; if a cycle is detected in the directed graph, the connection order of the tunnel outline is adjusted to eliminate the intersections in the tunnel outline; and the tunnel outline is updated according to the adjusted connection order of the tunnel outline.

[0155] In a specific application scenario, the marking module 33 can be used to mark the edges of the initial triangulation data that coincide with the roadway outline as the constrained edges, wherein the constrained edges are represented as external links in the topology; and to mark the edges of the initial triangulation data that do not coincide with the roadway outline as the unconstrained edges, wherein the unconstrained edges are represented as internal links in the topology.

[0156] In a specific application scenario, the drawing module 34 can be used to traverse all triangles in the marked initial triangulation data to obtain candidate triangles containing a first constraint edge and a second constraint edge, wherein the first constraint edge is any one of the two constraint edges in the candidate triangle, and the second constraint edge is the other constraint edge in the candidate triangle; if a third constraint edge connected to the second constraint edge but not belonging to the candidate triangle is obtained, then a first angle between the second constraint edge and the third constraint edge is calculated, and a second angle between the second constraint edge and the first constraint edge is calculated; if the first angle satisfies the condition that the angle difference with the first target angle is less than a first preset angle difference... If the second included angle satisfies that the angle difference with the second target angle is less than the second preset angle difference, then the first constraint edge is determined to be the edge of the tunnel entrance and marked; if no third constraint edge connected to the second constraint edge and not belonging to the candidate triangle is obtained, then a fourth constraint edge connected to the first constraint edge and not belonging to the candidate triangle is obtained; calculate the third included angle between the first constraint edge and the fourth constraint edge; if the third included angle satisfies that the angle difference with the third target angle is less than the third preset angle difference, and the second included angle satisfies that the angle difference with the second target angle is less than the second preset angle difference, then the second constraint edge is determined to be the edge of the tunnel entrance and marked.

[0157] In a specific application scenario, the drawing module 34 can be used to construct a basic rectangle with the span of the tunnel as the length and the arch height as the width, wherein the span corresponds to the side length of the side or unconstrained side of the tunnel entrance; within the basic rectangle, by drawing the angle bisectors of preset angles, the first, second, and third centers of the arch are determined sequentially; based on the first, second, and third centers and their corresponding radii, the tunnel arch outline is drawn, which is smoothly connected by multiple arc segments; at both ends of the tunnel arch outline, a given waist height is extended downwards to draw the tunnel sidewall outline; the tunnel arch outline and the sidewall outline together constitute the complete tunnel profile outline.

[0158] In a specific application scenario, the execution module 35 can be used to traverse each triangle in the initial triangulation. For each triangle, it determines whether the three sides of the triangle contain constraint edges that are not at the tunnel entrance. If they do, it obtains the tunnel profile outline corresponding to the constraint edges that are not at the tunnel entrance and the two adjacent unconstrained edges to form a three-sided surface. The three-sided surface is then triangulated, and the above operation is repeated until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel 3D model.

[0159] It should be noted that other corresponding descriptions of the functional units involved in the digital geological tunnel 3D model generation device provided in this embodiment can be found in [reference]. Figure 1 The corresponding descriptions of the Chinese methods will not be repeated here.

[0160] Furthermore, as Figure 13 The specific implementation of the method shown in this embodiment provides an application device for a three-dimensional model of a digital geological tunnel, such as... Figure 15 As shown, the device includes: a second generation module 41;

[0161] The second generation module 41 is used to input the current tunneling status map, waist height parameter data and arch height parameter data into the digital geological tunnel three-dimensional model to generate the application result set of the tunnel three-dimensional model, wherein the application result set includes tunnel profile map, tunnel excavation volume and tunnel filling volume.

[0162] It should be noted that other corresponding descriptions of the functional units involved in the application device for a digital geological tunnel 3D model provided in this embodiment can be found in [reference needed]. Figure 13 The corresponding descriptions in [the document] will not be repeated here.

[0163] The above are merely specific embodiments of this disclosure, enabling those skilled in the art to understand or implement this disclosure. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this disclosure. Therefore, this disclosure is not to be limited to these embodiments, but is to be accorded the widest scope consistent with the principles and novel features claimed herein.

Claims

1. A method for generating a three-dimensional model of a digital geological tunnel, characterized in that, include: Read the tunnel outline from the current tunneling status map, eliminate the intersections in the tunnel outline, and optimize the tunnel outline. The processed tunnel outline is used as a constraint condition for constrained Delaunay triangulation to generate initial triangulation data that satisfies the empty circularity condition, wherein the empty circularity condition is that the circumcircle of any triangle does not contain other points and any four points are not concyclic. The initial triangular network data is traversed according to topological principles, and the edges in the initial triangular network data are marked as constrained edges and unconstrained edges. According to the preset geometric criteria, the sides of the tunnel entrance are identified from the constrained sides. On the sides of the tunnel entrance and the unconstrained sides, the tunnel profile outline is drawn based on the given arch height parameter data and waist height parameter data, using the geometric construction principle of the three-center arch. Traverse each triangle in the initial triangulation. For each triangle, in response to the tunnel profile outline, repeat the target operation until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel 3D model. The generated target triangular network data is transmitted to the front end for rendering to generate the digital geological tunnel 3D model; The step of identifying the edges of the alleyway entrance from the constrained edges according to preset geometric criteria specifically includes: Traverse all triangles in the initial triangulation data after marking, and obtain candidate triangles containing a first constraint edge and a second constraint edge, wherein the first constraint edge is any one of the two constraint edges in the candidate triangle, and the second constraint edge is the other constraint edge in the candidate triangle; If a third constraint edge is obtained that is connected to the second constraint edge but does not belong to the candidate triangle, then calculate the first included angle between the second constraint edge and the third constraint edge, and calculate the second included angle between the second constraint edge and the first constraint edge; If the first included angle satisfies the condition that the angle difference with the first target angle is less than the first preset angle difference, and the second included angle satisfies the condition that the angle difference with the second target angle is less than the second preset angle difference, then the first constrained edge is determined to be the edge of the alleyway entrance and is marked. If a third constraint edge that is connected to the second constraint edge and does not belong to the candidate triangle is not obtained, then a fourth constraint edge that is connected to the first constraint edge and does not belong to the candidate triangle is obtained. Calculate the third included angle between the first constraint edge and the fourth constraint edge; If the third included angle satisfies the condition that the angle difference with the third target angle is less than the third preset angle difference, and the second included angle satisfies the condition that the angle difference with the second target angle is less than the second preset angle difference, then the second constraint edge is determined to be the edge of the alleyway entrance and is marked.

2. The method according to claim 1, characterized in that, The process of reading the tunnel outline from the current tunneling status map, eliminating intersections in the tunnel outline, and optimizing the tunnel outline specifically includes: The endpoints of the tunnel outline are set as nodes, and the line segments of the tunnel outline are set as edges. A directed graph is constructed based on the nodes and the edges. The directed graph is detected using a topological sorting algorithm to determine whether there are cycles in the directed graph, wherein the cycles are used to characterize the intersection points of the roadway outline; If a loop is detected in the directed graph, the connection order of the tunnel outline is adjusted to eliminate the intersections in the tunnel outline. The tunnel outline is updated according to the connection sequence of the adjusted tunnel outline.

3. The method according to claim 1, characterized in that, The step of marking the edges in the initial triangulation data as constrained edges and unconstrained edges specifically includes: The edges in the initial triangulation data that coincide with the roadway outline are marked as constraint edges, wherein the constraint edges are represented as external link edges in the topology; The edges in the initial triangulation data that do not coincide with the roadway outline are marked as unconstrained edges, wherein the unconstrained edges are represented as internal links in the topology.

4. The method according to claim 1, characterized in that, Based on the given arch height and waist height parameters, and using the geometric construction principle of a three-centered arch, the tunnel profile outline is drawn at the edge of the tunnel entrance and the unconstrained edge. Specifically, this includes: A basic rectangle is constructed with the span of the tunnel as the length and the arch height as the width, wherein the span corresponds to the side length of the side or unconstrained side of the tunnel entrance. Within the basic rectangle, the first, second, and third centers of the arch are determined sequentially by drawing angle bisectors on the preset angles. Based on the first center, the second center, the third center and their corresponding radii, draw the outline of the tunnel arch formed by the smooth connection of multiple circular arcs; At both ends of the tunnel arch outline, extend downwards by a given waist height to draw the tunnel sidewall outline. The tunnel profile outline is formed by the tunnel arch outline and the sidewall outline.

5. The method according to claim 1, characterized in that, The process involves traversing each triangle in the initial triangulation network. For each triangle, in response to the tunnel profile outline, the target operation is repeatedly performed until all triangles are traversed, generating the target triangulation network data of a complete digital geological tunnel 3D model. Specifically, this includes: Traverse each triangle in the initial triangulation. For each triangle, determine whether the three sides of the triangle contain constraint edges that are not at the entrance of the alley. If included, the confined edge of the non-tunnel entrance and the tunnel profile outline corresponding to each of the two adjacent unconstrained edges are obtained to form a three-sided surface. The three sides are triangulated, and the above operation is repeated until all triangles are traversed, generating the target triangular network data of the complete digital geological tunnel 3D model.

6. A method for applying a three-dimensional model of a digital geological tunnel, characterized in that, Applied to the method of any one of claims 1-5, comprising: Input the current tunneling status map, waist height parameter data, and arch height parameter data into the digital geological tunnel 3D model to generate the application result set of the tunnel 3D model. The application result set includes tunnel profile map, tunnel excavation volume, and tunnel filling volume.

7. A device for generating a three-dimensional model of a digital geological tunnel, characterized in that, include: The reading module is used to read the tunnel outline in the current tunneling status map, eliminate the intersections in the tunnel outline, and optimize the tunnel outline. The first generation module is used to perform constrained Delaunay triangulation processing on the processed tunnel outline as a constraint condition to generate initial triangular network data that satisfies the empty circularity condition, wherein the empty circularity condition is that the circumcircle of any triangle does not contain other points, and any four points are not concyclic. The marking module is used to traverse the initial triangulation data according to the principles of topology and mark the edges in the initial triangulation data as constrained edges and unconstrained edges. The drawing module is used to identify the sides of the tunnel entrance from the constrained sides according to the preset geometric criteria, and draw the tunnel profile outline on the sides of the tunnel entrance and the unconstrained sides based on the given arch height parameter data and waist height parameter data, using the geometric construction principle of the three-center arch. The execution module is used to traverse each triangle in the initial triangulation. For each triangle, in response to the tunnel profile outline, the target operation is repeatedly executed until all triangles are traversed, generating the target triangulation data of the complete digital geological tunnel 3D model. The rendering module is used to transmit the generated target triangular network data to the front end for rendering, so as to generate the digital geological tunnel three-dimensional model; The drawing module is specifically used to traverse all triangles in the marked initial triangulation data and obtain candidate triangles containing a first constraint edge and a second constraint edge, wherein the first constraint edge is any one of the two constraint edges in the candidate triangle and the second constraint edge is the other constraint edge in the candidate triangle. If a third constraint edge is obtained that is connected to the second constraint edge but does not belong to the candidate triangle, then calculate the first included angle between the second constraint edge and the third constraint edge, and calculate the second included angle between the second constraint edge and the first constraint edge; If the first included angle satisfies the condition that the angle difference with the first target angle is less than the first preset angle difference, and the second included angle satisfies the condition that the angle difference with the second target angle is less than the second preset angle difference, then the first constrained edge is determined to be the edge of the alleyway entrance and is marked. If a third constraint edge that is connected to the second constraint edge and does not belong to the candidate triangle is not obtained, then a fourth constraint edge that is connected to the first constraint edge and does not belong to the candidate triangle is obtained. Calculate the third included angle between the first constraint edge and the fourth constraint edge; If the third included angle satisfies the condition that the angle difference with the third target angle is less than the third preset angle difference, and the second included angle satisfies the condition that the angle difference with the second target angle is less than the second preset angle difference, then the second constraint edge is determined to be the edge of the alleyway entrance and is marked.

8. An application device for a three-dimensional model of a digital geological tunnel, characterized in that, Applied to the apparatus of claim 7, comprising: The second generation module is used to input the current tunneling status map, waist height parameter data, and arch height parameter data into the digital geological tunnel 3D model to generate the application result set of the tunnel 3D model. The application result set includes tunnel profile map, tunnel excavation volume, and tunnel filling volume.

9. An electronic device, characterized in that, include: processor; Memory used to store the processor's executable instructions; The processor is configured to execute the instructions to implement the method for generating a three-dimensional model of a digital geological tunnel as described in any one of claims 1 to 5, or the method for applying a three-dimensional model of a digital geological tunnel as described in claim 6.

Images