Rock mass structural surface processing method and device, electronic equipment and readable storage medium

By representing the recombinant vertex data of the rock mass structure surface in the form of a string array and depositing it into the HashSet collection object, the problem of low repetition data removal efficiency in the rock mass in situ mechanical simulation experiment is solved, and efficient and accurate data processing is achieved , ensuring the smooth progress of simulation tests.

CN119066227APending Publication Date: 2024-12-03ZHONGYE-CHANGTIAN INT ENG CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202310638265.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-06-01
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In rock mass in situ mechanics simulation experiments, multiple repeated structural surface models resulted in the failure of iterative calculations. The prior art eliminated duplicate data by comparing the coordinates of triangle vertices, but it is inefficient and time-consuming.

Method used

The string array data structure is used to represent the recombinant vertex data and store it in the HashSet collection object to filter duplicate data to achieve the acquisition of non-repeated vertex data.

Benefits of technology

The efficiency and accuracy of eliminating repeated structural surface data is improved, and the comparison workload is reduced, ensuring the smooth progress of the in-situ simulation test of rock mass.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119066227A_ABST
    Figure CN119066227A_ABST
Patent Text Reader

Abstract

The invention relates to the field of mine engineering, and discloses a rock mass structural plane processing method and device, electronic equipment and a readable storage medium, and the rock mass structural plane processing method comprises the following steps: obtaining recombined vertex data of all structural planes generated after rock mass subdivision; the recombined vertex data is expressed in the form of a character string array data structure; combining the recombined vertex data of each structural surface to obtain combined vertex data; and storing the combined vertex data into a HashSet set object, and filtering repeated combined vertex data to obtain non-repeated vertex data of the structural surface. According to the method, the recombined vertex data, represented in the form of the character string array data structure, of all the structural surfaces are merged, and then the merged vertex data are stored in the HashSet set object for filtering, so that the repeated vertex data of the structural surfaces are eliminated, the processing efficiency is higher, the accuracy is higher, the comparison workload is small, and the comparison efficiency is improved. The rock mass in-situ simulation test can be carried out smoothly, and the method can be applied to engineering more easily.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of mining engineering, and in particular to a method, device, electronic equipment and computer-readable storage medium for processing rock mass structural surfaces. Background Art

[0002] The occurrence and development degree of joints and fissures are important factors affecting the mechanical parameters of rock mass. In order to obtain accurate physical and mechanical parameters of rock mass, conducting in-situ mechanical simulation tests of complex rock mass is an effective solution. The three-dimensional visualization model used for the in-situ rock mass physical and mechanical parameter simulation test consists of two parts. The first part is the tetrahedron model after the three-dimensional rock space is divided; the second part is the three-dimensional space weak surface model attached to the surface of the tetrahedron model. When reconstructing the weak surface model of a rock mass with many structural surfaces in three-dimensional space, it is inevitable to generate multiple repeated structural surface (weak surface) models at the same position. However, using repeated structural surface models for in-situ mechanical simulation tests of rock mass will inevitably lead to the failure of iterative calculations. Therefore, the repeated structural surface data must be eliminated before the simulation test.

[0003] In order to obtain more accurate simulation test results, for rock masses with multiple repeated structural surfaces, it is necessary to remove the repeated structural surface data. The units that make up the structural surface are triangular units, and the triangles are controlled by the coordinates of three vertices. For multiple repeated structural surfaces at the same position, the existing technology uses the three vertices X, Y, and Z coordinates of the triangles that make up the structural surface to compare them respectively. When the X, Y, and Z coordinates of the three vertices are completely consistent, it is considered that the triangle has been repeated, and the triangle is deleted, that is, the structural surface is deleted. Since the arrangement order of the three vertices is different, the same position will have the same triangle. Therefore, in order to successfully realize the comparison of triangles, 18 variables must be compared in turn. The comparison workload is large, time-consuming, and inefficient, and it may even affect the progress of the simulation work.

[0004] Therefore, how to solve the above technical problems should be the focus of technical personnel in this field. Summary of the invention

[0005] The purpose of the present application is to provide a method, device, electronic device and computer-readable storage medium for processing rock mass structural surfaces, so as to improve the efficiency of eliminating repeated structural surfaces.

[0006] In order to solve the above technical problems, the present application provides a method for processing a rock mass structural surface, comprising:

[0007] Obtaining reorganized vertex data of all structural surfaces generated after rock mass segmentation; the reorganized vertex data is represented in the form of a string array data structure;

[0008] Merging the reorganized vertex data of each of the structural surfaces to obtain merged vertex data;

[0009] The merged vertex data are stored in a HashSet collection object, and repeated merged vertex data are filtered to obtain non-repeated vertex data of the structural surface.

[0010] Optionally, before merging the reorganized vertex data of each of the structural faces, the method further includes:

[0011] Determine whether the reorganized vertex data of each of the structural surfaces are arranged in a preset order; the preset order is that the vertex identifiers of the structural surfaces are arranged in ascending order or in descending order;

[0012] If the reorganized vertex data of each of the structural surfaces are not arranged according to the preset order, sorting the reorganized vertex data of each of the structural surfaces according to the preset order to obtain sorted vertex data corresponding to the structural surface;

[0013] Accordingly, merging the reorganized vertex data of each of the structural faces includes:

[0014] The sorted vertex data of each of the structure faces are merged.

[0015] Optionally, before obtaining the reorganized vertex data of all structural surfaces generated after the rock mass is divided, the following steps are also included:

[0016] storing the to-be-processed vertex data of all the structural surfaces in a first linked list structure, wherein the first linked list structure includes a plurality of first nodes, and each of the first nodes stores the to-be-processed vertex data of one structural surface;

[0017] The to-be-processed vertex data in each of the first nodes is stored in the form of the string array data structure to obtain the reorganized vertex data.

[0018] Optionally, after sorting the reorganized vertex data of each structural surface according to the preset order to obtain sorted vertex data corresponding to the structural surface, the method further includes:

[0019] The sorted vertex data of each of the structural faces are stored in a second linked list structure, wherein the second linked list structure includes a plurality of second nodes, and each of the second nodes stores the sorted vertex data of one of the structural faces.

[0020] Optionally, before storing the merged vertex data into the HashSet collection object, the method further includes:

[0021] Create the HashSet collection object.

[0022] Optionally, after obtaining the non-repetitive vertex data of the structural surface, the method further includes:

[0023] Extract the non-repeated vertex data of the structure surface from the HashSet collection object;

[0024] Convert the retrieved vertex data into double-precision floating-point vertex data;

[0025] The double-precision floating-point vertex data is used to construct a mechanical model corresponding to the structural surface.

[0026] Optionally, before extracting the non-repeated vertex data of the structure surface from the HashSet collection object, the method further includes:

[0027] Establishing a third linked list structure; the third linked list structure includes a plurality of third nodes;

[0028] The extracted vertex data of the structural surface are correspondingly stored in the third node of the third linked list structure.

[0029] The present application also provides a rock structure surface processing device, comprising:

[0030] An acquisition module is used to obtain reorganized vertex data of all structural surfaces generated after rock mass segmentation; the reorganized vertex data is represented in the form of a string array data structure;

[0031] A merging module, used for merging the reorganized vertex data of each structural surface to obtain merged vertex data;

[0032] The filtering module is used to store the merged vertex data into a HashSet collection object, filter the repeated merged vertex data, and obtain non-repeated vertex data of the structural surface.

[0033] The present application also provides an electronic device, comprising:

[0034] Memory for storing computer programs;

[0035] A processor is used to implement the steps of any of the above-mentioned methods for processing rock mass structural surfaces when executing the computer program.

[0036] The present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of any one of the above-mentioned methods for processing rock mass structural surfaces are implemented.

[0037] The present application provides a method for processing rock mass structural surfaces, comprising: obtaining reorganized vertex data of all structural surfaces generated after rock mass segmentation; representing the reorganized vertex data in the form of a string array data structure; merging the reorganized vertex data of each structural surface to obtain merged vertex data; storing the merged vertex data in a HashSet collection object, filtering duplicate merged vertex data, and obtaining non-duplicate vertex data of the structural surface.

[0038] It can be seen that when removing repeated structural surfaces, the processing method of the present application merges the reorganized vertex data of all structural surfaces represented by a string array data structure, and then stores the merged vertex data in a HashSet collection object for filtering. The repeated merged vertex data cannot continue to be stored in the HashSet collection object, thereby eliminating the vertex data of the repeated structural surfaces. There is no need to compare the vertex data, the processing efficiency is higher, the accuracy is higher, and the comparison workload is small, which ensures the smooth progress of the in-situ simulation test of the rock mass and is easier to apply in engineering.

[0039] In addition, the present application also provides a device, an electronic device and a computer-readable storage medium having the above advantages. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the embodiments of the present application or the technical solutions of the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0041] Figure 1 A flow chart of a method for processing a rock mass structural surface provided in an embodiment of the present application;

[0042] Figure 2 A flow chart of another method for processing a rock mass structural surface provided in an embodiment of the present application;

[0043] Figure 3 A schematic diagram of sorted vertex data provided by an embodiment of the present application;

[0044] Figure 4 A schematic diagram of a second linked list structure storing sorted vertex data provided by an embodiment of the present application;

[0045] Figure 5 A schematic diagram of the structure of a first linked list structure provided in an embodiment of the present application;

[0046] Figure 6A schematic diagram of a weak face string data structure provided in an embodiment of the present application;

[0047] Figure 7 A flow chart of another method for processing a rock mass structural surface provided in an embodiment of the present application;

[0048] Figure 8 A schematic diagram of each weak face vertex data provided in an embodiment of the present application after being put into a linked list;

[0049] Fig. 9 A data structure diagram of the reorganized character strings of each vertex provided in an embodiment of the present application;

[0050] Fig.10 A sorted string data structure diagram provided in an embodiment of the present application;

[0051] Fig.11 A structural block diagram of a rock mass structural surface processing device provided in an embodiment of the present application;

[0052] Fig.12 A structural block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0053] In order to enable those skilled in the art to better understand the present application, the present application is further described in detail below in conjunction with the accompanying drawings and specific implementation methods. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application.

[0054] As mentioned in the background technology section, in order to obtain more accurate simulation test results, for rock masses with multiple repeated structural surfaces, it is necessary to eliminate the repeated structural surface data. All data need to be compared in sequence, which is labor-intensive, time-consuming, inefficient, and may even affect the progress of the simulation work.

[0055] In view of this, this application provides a method for treating rock mass structural surface, please refer to Figure 1 ,include:

[0056] Step S101: obtaining reorganized vertex data of all structural surfaces generated after rock mass segmentation; the reorganized vertex data is represented in the form of a string array data structure.

[0057] The structural plane is the weak plane within the rock mass, and the weak plane is a triangle.

[0058] The reorganized vertex data of a structural surface includes the data of three vertices. A vertex has three coordinate values: X, Y, and Z. Each vertex coordinate value is arranged in the order of coordinates X, Y, and Z, separated by commas. For a structural surface, the data format of three vertices can be as follows:

[0059] The data structure format of the string array of the first vertex coordinate arrangement is:

[0060] point1_X, point1_Y, point1_Z

[0061] The string array data structure format of the second vertex coordinate arrangement is:

[0062] point2_X, point2_Y, point2_Z

[0063] The data structure format of the string array of the third vertex coordinate arrangement is:

[0064] Point3_X, point3_Y, point3_Z

[0065] Step S102: merging the reorganized vertex data of each of the structural surfaces to obtain merged vertex data.

[0066] When the reorganized vertex data of the structural surface are arranged in a preset order, the reorganized vertex data of the structural surface can be directly merged, that is, the coordinates of three vertices represented in the string array data structure format of a structural surface are merged. The coordinates of each vertex can be separated by a comma or other symbols. The format of the merged vertex data is as follows:

[0067] point1_X,point1_Y,point1_Z,point2_X,point2_Y,point2_Z,point3_X,point3_Y,point3_Z

[0068] Step S103: storing the merged vertex data into a HashSet collection object, filtering out duplicate merged vertex data, and obtaining non-duplicate vertex data of the structural surface.

[0069] The HashSet collection object can be understood as a container that determines the collection object. In the process of storing the merged vertex data in the HashSet collection object, if the subsequently stored merged vertex data is repeated with the already stored merged vertex data, the subsequently stored merged vertex data cannot be stored in the HashSet collection object, that is, the duplicate merged vertex data is filtered out.

[0070] Optionally, as an implementable method, before storing the merged vertex data into the HashSet collection object, the method further includes:

[0071] Create the HashSet collection object.

[0072] The processing method of this embodiment, when eliminating repeated structural surfaces, merges the reorganized vertex data of all structural surfaces represented by the form of string array data structure, and then stores the merged vertex data in a HashSet collection object for filtering. The repeated merged vertex data cannot continue to be stored in the HashSet collection object, thereby eliminating the vertex data of the repeated structural surfaces. There is no need to compare between the vertex data, the processing efficiency is higher, the accuracy is higher, and the comparison workload is small, which ensures the smooth progress of the in-situ simulation test of the rock mass and is easier to apply in engineering.

[0073] Please refer to Figure 2 Based on the above embodiments, in one embodiment of the present application, a method for processing a rock mass structural surface includes:

[0074] Step S201: obtaining reorganized vertex data of all structural surfaces generated after rock mass segmentation; the reorganized vertex data is represented in the form of a string array data structure.

[0075] Step S202: determining whether the reorganized vertex data of each structural surface is arranged in a preset order;

[0076] The preset order is that the vertex identifiers of the structural surface are arranged in ascending order or in descending order.

[0077] A structural surface includes three vertices, each vertex corresponds to a vertex identifier. The vertex identifier can be a number, such as 1, 2, 3; or a letter, such as a, b, c; or other identifiers with a sequence.

[0078] When the vertices are numbered, the ascending order is 1, 2, 3, and the descending order is 3, 2, 1. When the vertices are lettered, the ascending order is a, b, c, and the descending order is c, b, a.

[0079] Step S203: If the reorganized vertex data of each of the structural surfaces are not arranged according to the preset order, the reorganized vertex data of each of the structural surfaces are sorted according to the preset order to obtain sorted vertex data corresponding to the structural surface.

[0080] For example, when the vertex identifiers are numbers and the preset order is in ascending order, the schematic diagram of the sorted vertex data of a structural surface is as follows: Figure 3 shown.

[0081] In one embodiment of the present application, after sorting the reorganized vertex data of each of the structural surfaces according to the preset order to obtain sorted vertex data corresponding to the structural surface, the method further includes:

[0082] The sorted vertex data of each of the structural faces are stored in a second linked list structure, wherein the second linked list structure includes a plurality of second nodes, and each of the second nodes stores the sorted vertex data of one of the structural faces.

[0083] Assuming that the number of structural faces is n, the number of second nodes is n, and the schematic diagram of the second linked list structure storing sorted vertex data is as follows: Figure 4 shown.

[0084] Step S204: merging the sorted vertex data of each of the structural surfaces to obtain merged vertex data.

[0085] Step S205: If the reorganized vertex data of each of the structural surfaces are arranged according to the preset order, the reorganized vertex data of each of the structural surfaces are merged to obtain merged vertex data.

[0086] Step S206: storing the merged vertex data into a HashSet collection object, filtering out duplicate merged vertex data, and obtaining non-duplicate vertex data of the structural surface.

[0087] Based on any of the above embodiments, in one embodiment of the present application, before obtaining the reorganized vertex data of all structural surfaces generated after the rock mass is segmented, the method further includes:

[0088] storing the to-be-processed vertex data of all the structural surfaces in a first linked list structure, wherein the first linked list structure includes a plurality of first nodes, and each of the first nodes stores the to-be-processed vertex data of one structural surface;

[0089] The to-be-processed vertex data in each of the first nodes is stored in the form of the string array data structure to obtain the reorganized vertex data.

[0090] Assuming the number of structural faces is n, the number of first nodes is n, and the structural diagram of the first linked list structure is as follows: Figure 5 shown.

[0091] One structure surface corresponds to one vertex data to be processed, and one vertex data to be processed includes the coordinates of three vertices.

[0092] The data format of the vertex data to be processed on the structure surface is as follows:

[0093] int tri_ID; / / The address of the triangle, using a positive integer type

[0094] double point1_X; / / Define the X coordinate of the first vertex of the triangle

[0095] double point1_Y; / / Define the Y coordinate of the first vertex of the triangle

[0096] double point1_Z; / / Define the Z coordinate of the first vertex of the triangle

[0097] double point2_X; / / Define the X coordinate of the second vertex of the triangle

[0098] double point2_Y; / / Define the Y coordinate of the second vertex of the triangle

[0099] double point2_Z; / / Define the Z coordinate of the second vertex of the triangle

[0100] double point3_X; / / Define the X coordinate of the third vertex of the triangle

[0101] double point3_Y; / / Define the Y coordinate of the third vertex of the triangle

[0102] double point3_Z; / / Define the Z coordinate of the third vertex of the triangle

[0103] Taking three vertices as a unit, the storage structure can be as follows Figure 6 shown.

[0104] Based on any of the above embodiments, in one embodiment of the present application, please refer to Figure 7 , the treatment methods of rock mass structural surface include:

[0105] Step S301: obtaining reorganized vertex data of all structural surfaces generated after rock mass segmentation; the reorganized vertex data is represented in the form of a string array data structure.

[0106] Step S302: merging the reorganized vertex data of each of the structural surfaces to obtain merged vertex data.

[0107] Step S303: storing the merged vertex data into a HashSet collection object, filtering out duplicate merged vertex data, and obtaining non-duplicate vertex data of the structural surface.

[0108] Step S304: extract the non-repeated vertex data of the structural surface from the HashSet collection object.

[0109] The format for extracting vertex data is as follows:

[0110] A,B,C,D,E,F,G,H,I

[0111] Among them, A represents the X coordinate of the first vertex of the weak surface, B represents the Y coordinate of the first vertex of the weak surface, C represents the Z coordinate of the first vertex of the weak surface, D represents the X coordinate of the second vertex of the weak surface, E represents the Y coordinate of the second vertex of the weak surface, F represents the Z coordinate of the second vertex of the weak surface, G represents the X coordinate of the third vertex of the weak surface, H represents the Y coordinate of the third vertex of the weak surface, and I represents the Z coordinate of the third vertex of the weak surface.

[0112] As an implementable method, before taking out the non-repeated vertex data of the structural surface from the HashSet collection object, it also includes:

[0113] Establishing a third linked list structure; the third linked list structure includes a plurality of third nodes;

[0114] The extracted vertex data of the structural surface are correspondingly stored in the third node of the third linked list structure.

[0115] Step S305: converting the retrieved vertex data into double-precision floating-point vertex data.

[0116] The extracted data are separated according to the comma separator, and the first separated data is used as the X coordinate of the first vertex of the newly created weak surface data, the second data is used as the Y coordinate of the first vertex of the newly created weak surface data, the third data is used as the Z coordinate of the first vertex of the newly created weak surface data, the fourth data is used as the X coordinate of the second vertex of the newly created weak surface data, the fifth data is used as the Y coordinate of the second vertex of the newly created weak surface data, the sixth data is used as the Z coordinate of the second vertex of the newly created weak surface data, the seventh data is used as the X coordinate of the third vertex of the newly created weak surface data, the eighth data is used as the Y coordinate of the third vertex of the newly created weak surface data, and the eighth data is used as the Z coordinate of the third vertex of the newly created weak surface data.

[0117] After converting the vertex data from string type to double-precision floating point type, you can assign values ​​to all weak face vertices according to the following expression:

[0118] point1_X = A;

[0119] point1_y = B;

[0120] point1_Z = C;

[0121] point2_x = D;

[0122] point2_Y=E;

[0123] point2_Z = F;

[0124] point3_X = G;

[0125] point3_Y = H;

[0126] point3_Z=I.

[0127] Step S306: constructing a mechanical model corresponding to the structural surface using the double-precision floating-point vertex data.

[0128] The format for constructing a weak surface mechanics model is as follows:

[0129] Interface Face_ID element p1 point1_X point1_Y point1_Z p2point2_Xpoint2_Y point2_Z p3 point3_X point3_Y point3_Z

[0130] The method for processing rock mass structural surfaces in this embodiment efficiently removes (filters) in-situ repeated weak surfaces formed in the process of reconstructing three-dimensional weak surfaces in the in-situ simulation test of rock mass, and then further uses the removed data to construct a weak surface model.

[0131] The following is an explanation of the method for processing the rock mass structural surface of the present application using a specific case. In this embodiment, a small amount of weak surface data is used for introduction.

[0132] A series of weak surfaces are generated during the reconstruction of complex 3D visualization weak surfaces. The weak surfaces are saved in text format. The original data is as follows:

[0133] 1. Weak surface 1, point 1, 0.5 0.4 1.21196322282225, point 2, 0.6666666666666670.51.02966415776388, point 3, 0.666666666666667 0.4 1.18931157990386

[0134] 2. Weak surface 2, point 1, 0.5 0.4 1.21196322282225, point 2, 0.666666666666670.41.18931157990386, point 3, 0.66666666666667 0.5 1.02966415776388

[0135] 3. Weak surface 3, point 1, 0.83333333333333 0.4 1.16665993698546, point 2, 0.66666666666667 0.5 1.02966415776388, point 3, 0.666666666666670.41.18931157990386

[0136] 4. Weak surface 4, point 1, 0.666666666666667 0.5 1.02966415776388, point 2, 0.83333333333333 0.4 1.16665993698546, point 3, 0.6666666666666670.41.18931157990386

[0137] 5. Weak surface 5, point 1, 0.166666666666667 0.6 0.93797166437909, point 2, 0.33333333333333 0.6 0.91532002146069, point 3, 0.333333333333330.70.75567259932071

[0138] 6. Weak surface 6, point 1, 0.33333333333333 0.7 0.75567259932071, point 2, 0.16666666666667 0.6 0.93797166437909, point 3, 0.333333333333330.60.91532002146069

[0139] Step 1: Define the data structure and data organization of the weak surface

[0140] according to Figure 5 The data structure shown in the figure puts the 6 weak face data into a linked list. The vertex data of each weak face and their relationship are as follows: Figure 8 shown.

[0141] Step 2: Reorganize the data of each vertex

[0142] The first weak side

[0143] The string format of the first point coordinate arrangement is:

[0144] 0.5,0.4,1.21196322282225

[0145] The string format of the coordinate arrangement of the second point is:

[0146] 0.666666666666667,0.5,1.02966415776388 The string format of the coordinate arrangement of the third point: 0.66666666666667,0.4,1.18931157990386 The second weak surface

[0147] The string format of the coordinate arrangement of the first point: 0.5,0.4,1.21196322282225

[0148] The string format of the coordinate arrangement of the second point: 0.666666666666667,0.4,1.18931157990386 The string format of the coordinate arrangement of the third point: 0.66666666666667,0.5,1.02966415776388 The third weak surface

[0149] The string format of the coordinate arrangement of the first point: 0.83333333333333, 0.4, 1.16665993698546 The string format of the coordinate arrangement of the second point: 0.66666666666667, 0.5, 1.02966415776388 The string format of the coordinate arrangement of the third point: 0.66666666666667, 0.4, 1.18931157990386 The fourth weak surface

[0150] The string format of the coordinate arrangement of the first point: 0.666666666666667, 0.5, 1.02966415776388 The string format of the coordinate arrangement of the second point 0.83333333333333, 0.4, 1.16665993698546 The string format of the coordinate arrangement of the third point 0.66666666666667, 0.4, 1.18931157990386 The fifth weak surface

[0151] The string format of the coordinate arrangement of the first point: 0.166666666666667, 0.6, 0.93797166437909 The string format of the coordinate arrangement of the second point: 0.33333333333333, 0.6, 0.91532002146069 The string format of the coordinate arrangement of the third point:

[0152] 0.33333333333333, 0.7, 0.75567259932071

[0153] The 6th weak side

[0154] The string format of the first point coordinate arrangement is:

[0155] 0.33333333333333, 0.7, 0.75567259932071

[0156] The string format of the coordinate arrangement of the second point is:

[0157] 0.166666666666667, 0.6, 0.93797166437909

[0158] The string format of the coordinate arrangement of the third point is:

[0159] 0.33333333333333, 0.6, 0.91532002146069

[0160] The data structure of each vertex string after reorganization is as follows Fig. 9 shown.

[0161] Step 3: Reconstruct string-type triangle weak face vertex data

[0162] For each unit of the weak surface, the strings composed of the three vertices X, Y, and Z are sorted according to the vertex. The strings can be sorted in ascending or descending order. After sorting, each node is saved in a new linked list. The string data structure after sorting is shown in Fig.10 shown.

[0163] The first weak side

[0164] 0.5, 0.4, 1.21196322282225

[0165] 0.666666666666667, 0.4, 1.18931157990386

[0166] 0.666666666666667, 0.5, 1.02966415776388

[0167] The second weak side

[0168] 0.5, 0.4, 1.21196322282225

[0169] 0.666666666666667, 0.4, 1.18931157990386

[0170] 0.666666666666667, 0.5, 1.02966415776388

[0171] The third weak side

[0172] 0.666666666666667, 0.4, 1.18931157990386

[0173] 0.666666666666667, 0.5, 1.02966415776388

[0174] 0.83333333333333, 0.4, 1.16665993698546

[0175] The fourth weak side

[0176] 0.666666666666667, 0.4, 1.18931157990386

[0177] 0.666666666666667, 0.5, 1.02966415776388

[0178] 0.83333333333333, 0.4, 1.16665993698546

[0179] The fifth weak point

[0180] 0.166666666666667, 0.6, 0.93797166437909

[0181] 0.33333333333333, 0.6, 0.91532002146069

[0182] 0.33333333333333, 0.7, 0.75567259932071

[0183] The 6th weak side

[0184] 0.166666666666667, 0.6, 0.93797166437909

[0185] 0.33333333333333, 0.6, 0.91532002146069

[0186] 0.33333333333333, 0.7, 0.75567259932071

[0187] Step 4: Filter weak face data consisting of strings

[0188] Merge the three strings in each vertex of the sorted weak surface data, using commas to separate the vertex data. The merged weak surface data are as follows:

[0189] The first weak side

[0190] 0.5,0.4,1.21196322282225,0.666666666666667,0.4,1.18931157990386,0.66666666666667,0.5,1.02966415776388

[0191] The second weak side

[0192] 0.5,0.4,1.21196322282225,0.666666666666667,0.4,1.18931157990386,0.66666666666667,0.5,1.02966415776388

[0193] The third weak side

[0194] 0.666666666666667,0.4,1.18931157990386,0.666666666666667,0.5,1.02966415776388,0.83333333333333,0.4,1.16665993698546

[0195] The fourth weak side

[0196] 0.666666666666667,0.4,1.18931157990386,0.666666666666667,0.5,1.02966415776388,0.83333333333333,0.4,1.16665993698546

[0197] The fifth weak point

[0198] 0.166666666666667,0.6,0.93797166437909,0.33333333333333,0.6,0.91532002146069,0.33333333333333,0.7,0.75567259932071

[0199] The 6th weak side

[0200] 0.166666666666667,0.6,0.93797166437909,0.33333333333333,0.6,0.91532002146069,0.33333333333333,0.7,0.75567259932071

[0201] Create a HashSet collection object, and use the fact that the HashSet container can only store non-repeating data to store all sorted weak face data information into the HashSet collection object. The collection object stores unordered non-repeating vertex string data.

[0202] The weak surface information in the collection object is as follows:

[0203] The first weak side

[0204] 0.5,0.4,1.21196322282225,0.666666666666667,0.4,1.18931157990386,0.66666666666667,0.5,1.02966415776388

[0205] The second weak side

[0206] 0.666666666666667,0.4,1.18931157990386,0.666666666666667,0.5,1.02966415776388,0.83333333333333,0.4,1.16665993698546

[0207] The third weak side

[0208] 0.166666666666667,0.6,0.93797166437909,0.33333333333333,0.6,0.91532002146069,0.33333333333333,0.7,0.75567259932071

[0209] Step 5: Data decoding

[0210] Create a new weak face data linked list. See the linked list node data structure for details. Figure 4 As shown. Take out the vertex data one by one from the HashSet collection object, convert the data from string type to double-precision floating point type, and assign values ​​to all weak face vertices according to the following expression. The data after assignment is as follows:

[0211] The first weak side

[0212] point1_x=0.5;

[0213] point1_y=0.4;

[0214] point1_Z=1.21196322282225;

[0215] point2_X=0.66666666666667;

[0216] point2_Y=0.5;

[0217] point2_Z=1.02966415776388;

[0218] point3_X=0.66666666666667;

[0219] point3_Y=0.5;

[0220] point3_Z=1.02966415776388;

[0221] Second weakness

[0222] point1_X=0.66666666666667;

[0223] point1_Y=0.4;

[0224] point1_Z=1.18931157990386;

[0225] point2_X=0.66666666666667;

[0226] point2_Y=0.5;

[0227] point2_Z=1.02966415776388;

[0228] point3_X=0.83333333333333;

[0229] point3_Y=0.4;

[0230] point3_Z=1.16665993698546;

[0231] Third weakness

[0232] point1_X=0.16666666666667;

[0233] point1_Y=0.6;

[0234] point1_Z=0.93797166437909;

[0235] point2_X=0.33333333333333;

[0236] point2_Y=0.6;

[0237] point2_Z=0.91532002146069;

[0238] point3_X=0.33333333333333;

[0239] point3_y=0.7;

[0240] point3_Z=0.75567259932071;

[0241] Step 6: Constructing the weak surface mechanics model

[0242] Take out the weak surface vertex data one by one and construct the weak surface mechanical model according to the following format:

[0243] interface 1element p1 0.5 0.4 1.21196322282225p20.66666666666667 0.41.18931157990386p3 0.66666666666667 0.5 1.02966415776388

[0244] interface 2element p1 0.66666666666667 0.4 1.18931157990386p20.66666666666667 0.5 1.02966415776388p3 0.833333333333330.4 1.16665993698546

[0245] interface 3element p1 0.16666666666667 0.6 0.93797166437909p20.33333333333333 0.6 0.91532002146069p3 0.333333333333330.7 0.75567259932071

[0246] The following is an introduction to a rock structure surface processing device provided in an embodiment of the present application. The rock structure surface processing device described below and the rock structure surface processing method described above can be referred to each other.

[0247] Fig.11 The structural block diagram of the rock mass structural surface processing device provided in the embodiment of the present application is shown in FIG. Fig.11 The rock mass structural surface treatment device may include:

[0248] The acquisition module 100 is used to obtain the reorganized vertex data of all structural surfaces generated after the rock mass is divided; the reorganized vertex data is represented in the form of a string array data structure;

[0249] A merging module 200, configured to merge the reorganized vertex data of each structural surface to obtain merged vertex data;

[0250] The filtering module 300 is used to store the merged vertex data into a HashSet collection object, filter out duplicate merged vertex data, and obtain non-duplicate vertex data of the structural surface.

[0251] The processing device for rock structural surfaces of the present embodiment is used to implement the aforementioned processing method for rock structural surfaces. Therefore, the specific implementation method of the processing device for rock structural surfaces can be seen in the embodiment part of the processing method for rock structural surfaces in the previous text. For example, the acquisition module 100, the merging module 200, and the filtering module 300 are respectively used to implement steps S101, S102, and S103 in the aforementioned processing method for rock structural surfaces. Therefore, its specific implementation method can refer to the description of the corresponding embodiments of each part, which will not be repeated here.

[0252] Optionally, also include:

[0253] A judgment module, used to judge whether the reorganized vertex data of each of the structural surfaces are arranged in a preset order; the preset order is that the vertex identifiers of the structural surfaces are arranged in ascending order or in descending order;

[0254] A sorting module, configured to sort the reorganized vertex data of each structural surface according to the preset order if the reorganized vertex data of each structural surface is not arranged according to the preset order, so as to obtain sorted vertex data corresponding to the structural surface;

[0255] Correspondingly, the merging module 200 is specifically used to merge the sorted vertex data of each of the structural surfaces.

[0256] Optionally, also include:

[0257] A first storage module, used for storing the to-be-processed vertex data of all the structural surfaces in a first linked list structure, wherein the first linked list structure includes a plurality of first nodes, and each of the first nodes stores the to-be-processed vertex data of one structural surface;

[0258] The second storage module is used to store the to-be-processed vertex data in each of the first nodes in the form of the string array data structure to obtain the reorganized vertex data.

[0259] Optionally, also include:

[0260] A third storage module is used to store the sorted vertex data of each of the structural surfaces in a second linked list structure, wherein the second linked list structure includes a plurality of second nodes, and each of the second nodes stores the sorted vertex data of one of the structural surfaces.

[0261] Optionally, also include:

[0262] A creation module is used to create the HashSet collection object.

[0263] Optionally, also include:

[0264] An extraction module, used for extracting non-repeated vertex data of the structural surface from the HashSet collection object;

[0265] A conversion module, used for converting the retrieved vertex data into double-precision floating-point vertex data;

[0266] A construction module is used to construct a mechanical model corresponding to the structural surface using the double-precision floating-point vertex data.

[0267] Optionally, also include:

[0268] An establishing module, used for establishing a third linked list structure; the third linked list structure includes a plurality of third nodes;

[0269] The fourth storage module is used to store the extracted vertex data of the structural surface in the third node of the third linked list structure.

[0270] The electronic device provided in the embodiment of the present application is introduced below. The electronic device described below and the method for processing the rock structure surface described above can be referenced to each other.

[0271] Fig.12 The structural block diagram of the rock mass structural surface processing device provided in the embodiment of the present application, the electronic device includes:

[0272] A memory 11, used for storing computer programs;

[0273] The processor 12 is used to implement the steps of the method for processing the rock mass structural surface described in any of the above embodiments when executing the computer program.

[0274] The computer-readable storage medium provided in the embodiment of the present application is introduced below. The computer-readable storage medium described below and the method for processing the rock structure surface described above can be referenced to each other.

[0275] The present application provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the method for processing a rock mass structural surface described in any of the above embodiments are implemented.

[0276] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part.

[0277] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0278] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0279] The above is a detailed introduction to the rock structure surface processing method, device, electronic device and readable storage medium provided by the present application. Specific examples are used herein to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method and core idea of ​​the present application. It should be pointed out that for ordinary technicians in this technical field, without departing from the principles of the present application, several improvements and modifications can be made to the present application, and these improvements and modifications also fall within the scope of protection of the claims of the present application.

Claims

1. A method for processing a rock mass structural surface, characterized in that: include: Obtain the reconstructed vertex data of all structural surfaces generated after rock mass segmentation; The reorganized vertex data is represented in the form of a string array data structure; Merging the reorganized vertex data of each of the structural surfaces to obtain merged vertex data; The merged vertex data are stored in a HashSet collection object, and repeated merged vertex data are filtered to obtain non-repeated vertex data of the structural surface.

2. The method for treating a rock mass structural surface according to claim 1, characterized in that: Before merging the reorganized vertex data of each of the structural faces, the method further includes: Determine whether the reorganized vertex data of each of the structural surfaces are arranged in a preset order; the preset order is that the vertex identifiers of the structural surfaces are arranged in ascending order or in descending order; If the reorganized vertex data of each of the structural surfaces are not arranged according to the preset order, sorting the reorganized vertex data of each of the structural surfaces according to the preset order to obtain sorted vertex data corresponding to the structural surface; Accordingly, merging the reorganized vertex data of each of the structural faces includes: The sorted vertex data of each of the structure faces are merged.

3. The method for treating a rock mass structural surface according to claim 1, characterized in that: Before obtaining the reconstructed vertex data of all structural surfaces generated after rock mass segmentation, it also includes: storing the to-be-processed vertex data of all the structural surfaces in a first linked list structure, wherein the first linked list structure includes a plurality of first nodes, and each of the first nodes stores the to-be-processed vertex data of one structural surface; The to-be-processed vertex data in each of the first nodes is stored in the form of the string array data structure to obtain the reorganized vertex data.

4. The method for treating a rock mass structural surface according to claim 2, characterized in that: After sorting the reorganized vertex data of each structural surface according to the preset order to obtain sorted vertex data corresponding to the structural surface, the method further includes: The sorted vertex data of each of the structural faces are stored in a second linked list structure, wherein the second linked list structure includes a plurality of second nodes, and each of the second nodes stores the sorted vertex data of one of the structural faces.

5. The method for treating a rock mass structural surface according to claim 1, characterized in that: Before storing the merged vertex data into the HashSet collection object, the method further includes: Create the HashSet collection object.

6. The method for treating a rock mass structural surface according to any one of claims 1 to 5, characterized in that: After obtaining the non-repetitive vertex data of the structural surface, the method further includes: Extract the non-repeated vertex data of the structure surface from the HashSet collection object; Convert the retrieved vertex data into double-precision floating-point vertex data; The double-precision floating-point vertex data is used to construct a mechanical model corresponding to the structural surface.

7. The method for treating a rock mass structural surface according to claim 6, characterized in that: Before taking out the non-repeated vertex data of the structure surface from the HashSet collection object, the method further includes: Establishing a third linked list structure; the third linked list structure includes a plurality of third nodes; The extracted vertex data of the structural surface is correspondingly stored in the third node of the third linked list structure.

8. A rock structure surface processing device, characterized in that: include: An acquisition module is used to obtain the reconstructed vertex data of all structural surfaces generated after rock mass segmentation; The reorganized vertex data is represented in the form of a string array data structure; A merging module, used for merging the reorganized vertex data of each structural surface to obtain merged vertex data; The filtering module is used to store the merged vertex data into a HashSet collection object, filter the repeated merged vertex data, and obtain non-repeated vertex data of the structural surface.

9. An electronic device, characterized in that: include: Memory for storing computer programs; A processor is used to implement the steps of the method for processing a rock mass structural surface as claimed in any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method for processing a rock mass structural surface according to any one of claims 1 to 7 are implemented.

Citation Information

Patent Citations

  • Rock mass structural plane identification and occurrence classification method based on point cloud data

    CN111553292A

  • Data deduplication method, device and equipment and computer readable storage medium

    CN112463784A

  • Three-dimensional reconstruction method and device

    CN114373041A

  • Cubic network model-based point cloud surface reconstruction method and system

    CN115187749A