CN117173357A - Mine three-dimensional geological modeling and layered cutting method - Google Patents
Mine three-dimensional geological modeling and layered cutting method Download PDFInfo
- Publication number
- CN117173357A CN117173357A CN202311150031.0A CN202311150031A CN117173357A CN 117173357 A CN117173357 A CN 117173357A CN 202311150031 A CN202311150031 A CN 202311150031A CN 117173357 A CN117173357 A CN 117173357A
- Authority
- CN
- China
- Prior art keywords
- data
- cutting
- geological
- points
- dimensional
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000005520 cutting process Methods 0.000 title claims abstract description 152
- 238000000034 method Methods 0.000 title claims abstract description 77
- 238000005553 drilling Methods 0.000 claims abstract description 49
- 238000012545 processing Methods 0.000 claims description 17
- 238000007781 pre-processing Methods 0.000 claims description 10
- 238000005096 rolling process Methods 0.000 claims description 10
- 239000004033 plastic Substances 0.000 claims description 9
- 229920003023 plastic Polymers 0.000 claims description 9
- 230000015572 biosynthetic process Effects 0.000 claims description 7
- 238000000605 extraction Methods 0.000 claims description 7
- 238000003491 array Methods 0.000 claims description 6
- 238000012946 outsourcing Methods 0.000 claims description 6
- 238000003860 storage Methods 0.000 claims description 6
- 239000013598 vector Substances 0.000 claims description 6
- 238000009826 distribution Methods 0.000 claims description 5
- 230000000694 effects Effects 0.000 claims description 5
- 238000012216 screening Methods 0.000 claims description 5
- 230000009191 jumping Effects 0.000 claims description 2
- 238000009958 sewing Methods 0.000 claims 1
- 230000001360 synchronised effect Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 19
- 238000005516 engineering process Methods 0.000 description 17
- 230000008569 process Effects 0.000 description 9
- 238000011161 development Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000004519 manufacturing process Methods 0.000 description 5
- 239000003245 coal Substances 0.000 description 3
- 238000010276 construction Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 3
- 230000006872 improvement Effects 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 229910052500 inorganic mineral Inorganic materials 0.000 description 2
- 239000011707 mineral Substances 0.000 description 2
- 238000005065 mining Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000011960 computer-aided design Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000013075 data extraction Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000007654 immersion Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000035515 penetration Effects 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A90/00—Technologies having an indirect contribution to adaptation to climate change
- Y02A90/30—Assessment of water resources
Abstract
The invention provides a mine three-dimensional geological modeling and layering cutting method, and relates to the technical field of geological modeling. Firstly, acquiring surface scanning data and surface drilling data; adding the earth surface scanning data into earth surface drilling data to form earth surface point cloud data; respectively carrying out surface reconstruction on the surface point cloud data and carrying out surface reconstruction on the rest geological layers and the ground drilling points; splicing the reconstructed layers, and stitching the layers to form a complete three-dimensional geological model; on the basis of a three-dimensional geological model, acquiring a cutting range, deleting triangular surfaces in the cutting range, dividing model layers by using a layering algorithm, acquiring point cloud boundaries of each layer after cutting, stitching by using a point cloud boundary stitching algorithm, and finally splicing a plurality of layers together to form the three-dimensional geological model after cutting and returning to a cutting block. The method realizes complete reconstruction and layered cutting of the three-dimensional geological model, and synchronous output of the model and the cutting block.
Description
Technical Field
The invention relates to the technical field of geological modeling, in particular to a three-dimensional geological modeling and layering cutting method for mines.
Background
With the rapid rise and development of the economy of modern informationized construction entities in China, the country has clearly proposed a digital mine development strategy. The development strategy of the mine is proposed to more comprehensively understand the actual mine, and the related phenomena and structural characteristics of the mine are reproduced by utilizing a computer technology, so that the development strategy of the mine is an important foundation for the construction of a digital mining area. The defects in the traditional mine industry are improved by utilizing information science and technology and a three-dimensional visual platform, so that the method has become important research content of mine science and technology and is also a problem to be solved in the development of the coal mine industry.
When modeling three-dimensional geology, mainly processing geological data obtained by detection during underground drilling, then performing three-dimensional modeling on the geological data by utilizing a computer three-dimensional reconstruction technology, displaying the complex geological data obtained by detection in a three-dimensional image representation form, assisting mine enterprise staff to check geological structures, obtaining mineral resource distribution conditions of geology, and more intuitively checking mineral body attribute and other data, so that production workers can reasonably arrange resource allocation in the resource acquisition process, and the underground resource acquisition efficiency is improved.
The technological scheme flow described in Chinese patent CN107808413A is that: firstly, generating a point set through data analysis, importing and generating; then building a constructed terrain Surface, and generating a terrain Surface through a Surface creation function in the GOCAD according to the generated point set; after the data are read in the GOCAD, the information of each layer can be modified in the Marker item of Well and the yield information of each layer can be added, then each layer surface and each fault surface are respectively modeled, the generated curved surface is edited, and finally the geological grid model is built through the grid model object (Sgrid) of the GOCAD. The method mainly uses GOCAD for modeling, and GOCAD (Geological Object Computer Aided Design) geological modeling software is three-dimensional visual modeling software developed by the university of Nancy in France and mainly applied to the geological field. There are the following problems: the foreign software is used for three-dimensional modeling, and a certain copyright risk exists. Algorithms are already packaged into software, lack of adjustment improvement of pre-and post-processing, and are not flexible enough. The modeling process can have the condition that the reconstructed curved surface is unreasonable, and further needs subsequent adjustment. GOCAD requires a significant amount of computing resources to operate, including high performance computers and a significant amount of memory. This makes it slow or non-operational on some weaker computers. While GOCAD is slow in processing large amounts of data, it results in a long time being required in processing complex geologic models built from surface scan points.
The Chinese patent CN112419500B three-dimensional geological model modeling method comprises the following steps: acquiring exploration data of a plurality of exploration holes, extracting drilling data, carrying out data interpolation according to the drilling data to obtain interpolation data, and integrating the interpolation data and the drilling data into modeling data; generating point cloud data through modeling data, and generating a stratum curved surface through the point cloud data; searching a convex envelope line by adopting a convex hull algorithm, and cutting the stratum curved surface according to the convex envelope line to obtain a cut stratum curved surface; and generating a stratum entity through the stratum curved surface, extracting stratum data from the exploration data, taking the stratum data as project parameters of the stratum entity, and generating a three-dimensional geological model through the stratum entity. The method has the following problems: after the modeling data is acquired, a plurality of NURBS surfaces are generated, and the method does not effectively stitch the surfaces. The convex envelope is searched by adopting a convex hull algorithm, and the stratum curved surface is cut according to the convex envelope, but the layering stitching of a plurality of cutting surfaces is not realized, and the cutting surfaces cannot be well displayed.
The three-dimensional reconstruction technology is a key part of modern computer graphics, and is a key core technology in the fields of computer vision, virtual reality, reverse engineering technology and the like. Because of the improvement of the computer science level, the three-dimensional reconstruction traditional technology based on the image has a plurality of defects in the reconstruction speed, algorithm applicability and accuracy, and does not meet the requirements of the current social production and manufacture on high-precision and sense-of-reality three-dimensional modeling and drawing. The three-dimensional reconstruction technology for rapidly and simply reconstructing an accurate three-dimensional space model by utilizing discrete points on the surface of an object can be well applied to the current production and research, so that the three-dimensional reconstruction technology based on the point cloud is a hot topic of the current three-dimensional reconstruction technology research, and is also an important point and a difficult point.
Three-dimensional reconstruction of the existing geological model in China is mostly generated based on half-development of AutoCAD, unity3D and other software in early stage. The development platform of the model has copyright and functional limitation, so that the subsequent use of the model has copyright limitation, and the model can only be developed on the function limited by software, and cannot be popularized and applied. Secondly, when facing complex point clouds, the three-dimensional reconstruction of the domestic geological model cannot well reconstruct the surface of the point clouds, and when facing two point clouds with small distances, the existing three-dimensional reconstruction technology cannot well connect the two layers. The existing model cutting technology in China cannot well laminate the cutting surface, and the cutting effect is poor.
Disclosure of Invention
Aiming at the defects of the prior art, the technical problem to be solved by the invention is to provide a three-dimensional geological modeling and layering cutting method for mines, which is used for establishing a three-dimensional geological model of the mine and realizing layering cutting of the model.
In order to solve the technical problems, the invention adopts the following technical scheme: the three-dimensional geological modeling and layered cutting method of the mine acquires surface scanning data and surface drilling data; performing contour extraction on the surface scanning data by using a point cloud contour extraction algorithm, deleting data in a contour range in the drilling data by using a ray method with the contour as a boundary, and adding the surface scanning data into the surface drilling data to form surface point cloud data; performing surface reconstruction on the surface point cloud data by using poisson reconstruction; reconstructing the surface of the rest geological layers and the ground drilling points by using rolling ball reconstruction; splicing the reconstructed layers, and stitching the layers by using a point cloud boundary stitching algorithm to form a complete three-dimensional geological model; selecting a cutting range on the basis of a three-dimensional geological model, acquiring the cutting range, deleting triangular surfaces in the cutting range, dividing model layers by using a layering algorithm, acquiring the point cloud boundaries of each layer after cutting, stitching by using a point cloud boundary stitching algorithm, and finally splicing a plurality of layers together to form the three-dimensional geological model after cutting and returning to a cutting block.
The method specifically comprises the following steps:
step 1: acquiring surface scanning data;
step 1.1: selecting a scanning area; the scanning area may be selected from polygonal structures, but quadrilateral structures work best.
Step 1.2: setting the number of scanning points; the number of scan points must not be too large to avoid too complex data resulting in too long a reconstruction time.
Step 1.3: converting a scanning point data format; the scan point data is converted from Cartesian coordinates to geographic coordinates.
Step 1.4: storing the scan point data into json file;
step 2: acquiring surface drilling data and preprocessing;
after the drilling data are obtained, the preprocessing work of the drilling data is completed, and three-dimensional point cloud data are provided for the subsequent splicing of the scanning point data.
Step 2.1: acquiring surface drilling data, processing complex geological types, and separating geological point cloud data of different geological types from the surface drilling data;
step 2.2, preprocessing each layer of point cloud data after separating the geological point cloud data of different geological types;
step 2.2.1: extracting geological layer point cloud boundary points; step 2.2.2: performing two-dimensional interpolation on point cloud data with uneven original distribution; step 2.2.3: clipping the interpolated point cloud data according to the original point cloud boundary, reserving an original data area, and ensuring consistency before and after data processing;
Step 3: combining the preprocessed earth surface drilling data with earth surface scanning data to form earth surface point cloud data;
because the surface scanning data is only a part of the surface reconstruction data, the surface scanning data is required to be added into the surface drilling data instead to form complete three-dimensional stratum surface data;
step 3.1: extracting contour points from the acquired surface scanning data;
step 3.2: acquiring preprocessed surface drilling data, and deleting three-dimensional data in the boundary by using a ray method and taking surface scanning data contour points as the boundary;
step 3.3: splicing the earth surface scanning data with the earth surface drilling data processed by the ray method to form complete three-dimensional stratum surface data;
step 4: carrying out three-dimensional point cloud reconstruction of a geological model on the basis of three-dimensional stratum data;
step 4.1: calculating the normal vector of each geological layer point cloud in the three-dimensional stratum data;
step 4.2: for stratum surface data, carrying out stratum surface reconstruction by using a poisson reconstruction algorithm;
step 4.3: cutting the surface of the formation after poisson reconstruction according to the three-dimensional surface profile of the formation;
firstly, extracting boundary points of three-dimensional stratum surface data, then screening whether point clouds exist in the boundary point outline or not based on a ray method, and deleting redundant triangular surfaces by operating data structures trianges of storage surfaces on non-existing points to form a needed stratum grid;
Step 4.4: reconstructing other geological layers except the stratum surface by adopting a rolling ball algorithm, combining triangular mesh data of the upper surface and the lower surface of the geological layers, registering and storing;
step 4.5: calling a triangular mesh edge stitching algorithm to stitch the upper and lower surfaces of each reconstructed geological layer to form a complete closed three-dimensional geological model;
step 4.5.1: acquiring the edge of a geological layer; establishing an edge array edge_vertical, traversing all triangle grids on the upper surface and the lower surface of a geological layer, acquiring three edges of a triangle, storing the three edges into the array if the edges are not in the array, and deleting the edges from the array if the same edges exist in the array;
step 4.5.2: creating an array PointSingle_up for storing the edge points of the upper surface of the geological layer and an array PointSingle_Down for storing the edge points of the lower surface of the geological layer; scanning an edge array edge_vertical, taking the first element of the array, respectively recording two endpoints of the edge, and storing the numbers of the two endpoints in an edge point array PointSingle_up in sequence;
step 4.5.3: traversing edge arrays edge_vertical, screening edge edges, if the number of a first endpoint of the edge is equal to the number of the last element of the PointSingle_up array, adding the number of a second endpoint of the edge into the PointSingle_up array, and recording the edge edges; if not, jumping to the step 4.5.5;
Step 4.5.4: repeating the step 4.5.3 until the edge array edge_fields is traversed;
step 4.5.5: repeating the steps 4.5.2 to 4.5.4, storing the edge points obtained by the first traversal in an edge point array PointSingle_up, and storing the edge points in PointSingle_Down for the second time; the two arrays of the PointSingle_up and PointSingle_down respectively store edge points of the upper surface and the lower surface of the geological layer, in each array, every two adjacent edge points are provided with an edge for directly connecting the adjacent edge points on the triangular mesh model, the number corresponding to the first element of the array is equal to the number corresponding to the last element, and the two adjacent edge points are connected end to form a ring;
step 4.5.6: setting two rounds of circulation, wherein the outer-layer circulation traverses the array PointSingle_up, two points are extracted at a time, two pointers single_first are set, single_last points to the two points respectively, and the inner-layer circulation circulates the array PointSingle_down; respectively traversing and calculating Euclidean distances between two points pointed by single_first and single_last and points in the PointSingle_Down array;
step 4.5.7: the method comprises the steps that two points pointed by single_first and single_last are respectively selected to be the point with the smallest Euclidean distance between the points in the PointSingle_Down array, the positions of the two points in the PointSingle_Down array in the array are obtained, and a point_first pointer and a point_last pointer are respectively pointed to the two points;
Step 4.5.8: judging whether the sequence_first and the sequence_last are equal, if so, connecting three pointers of the single_first, the single_last and the sequence_first to form a clockwise triangular patch, and adding the clockwise triangular patch into the triangules attribute of the triangular mesh by means of an application () function; if the repetition_first is greater than the repetition_last, then step 4.5.9 is performed, otherwise, step 4.5.10 is performed;
step 4.5.9: judging whether the sequence_first is in the previous bit of the sequence_last, if so, connecting four pointers of the sequence_first, the sequence_last, the sequence_first and the sequence_last to form two clockwise triangular patches, and adding the two clockwise triangular patches into the triangules attribute of the triangular mesh by means of an application () function; if not, entering a while loop, setting a complete_first pointer to advance once per loop, connecting the four pointers to form two clockwise triangular patches each time, adding the triangular patches into the triangulars attribute of the triangular mesh by means of an application () function, ending the loop until the complete_first is in the previous position of the complete_last, generating the last two triangular patches by using the four pointers, and adding the last two triangular patches into the triangulars attribute;
step 4.5.10: judging whether the repetition_first is at the latter bit of the repetition_last, if yes, connecting the four pointers to form two clockwise triangular patches, and adding the triangular patches into the triangules attribute of the triangular mesh by means of an application () function; if not, entering a while loop, setting a complete_first pointer to back once every loop, connecting the four pointers to form two clockwise triangular patches every time, adding the triangular patches into the triangulars attribute of the triangular mesh by means of an application () function, ending the loop until the complete_first is at the rear position of the complete_last, generating the last two triangular patches by using the four pointers, and adding the last two triangular patches into the triangulars attribute;
Step 4.5.11: each geological layer is stitched, and a three-dimensional geological model is output;
step 5: performing layered cutting on the established three-dimensional geological model;
step 5.1: determining an outsourcing rectangle of a cutting area according to the longitude and latitude of the minimum and maximum delimited areas of the user, and performing layered cutting on a three-dimensional geological model in the outsourcing rectangle;
step 5.2: setting a variable num and initializing to zero, wherein the number of rays passing through the edges of the closed polygon of each geological layer data point in the three-dimensional geological model is represented;
step 5.3: selecting one side of a user-defined area according to the sequence, judging whether two endpoints of the side are respectively positioned at two sides of a horizontal line passing through each layer of point cloud, and if not, not performing any treatment; if yes, solving an intersection point of the horizontal line and the current edge, and if the longitude of the intersection point is greater than or equal to the longitude of the input point, adding one to num;
step 5.4: repeating the step 5.3 until the edges of the area defined by all users are traversed;
step 5.5: if num is odd, returning True, indicating that the data point is located inside the cut region; otherwise, returning to False; setting a triangules-work array for storing data points of the cutting area, and determining a point for obtaining a True return value through an ispoiwisthinpoly (point_area)) function to be stored in the triangules-work array;
Step 5.6: after all data points located in the cutting area are determined, traversing the triangules attribute of the triangular mesh, and if no vertex exists in the triangules_work array, not processing; if three vertexes of the triangular plate exist in the triangulars-work array, deleting the triangular plate; if one vertex or two vertices are located in the triangules_work array, turning to step 5.8;
step 5.7: repeating the step 5.6 until all the triangular plates are traversed and the step 5.9 is completed;
step 5.8: judging the intersected cutting area edges according to the three-dimensional coordinate values of the triangle to be cut and the cutting area; according to a dough sheet splitting method, calculating two intersection points of a cutting edge and a triangle, deleting vertexes in a cutting area, and adding the two intersection points into a vertex array of the three-dimensional geological model; if two vertexes are positioned in the cutting area, the outer vertexes of the cutting area and the two intersection points form a triangle clockwise; if one vertex is positioned in the cutting area, two intersection points respectively form a triangle with two vertexes outside the cutting area clockwise; finally, deleting triangular mesh data of the cut triangle in the three-dimensional geological model, and adding the newly generated triangle;
step 5.9: setting model/plastics as a data structure for storing vertexes of triangular surfaces of the three-dimensional geological model by using an Open3D (three-dimensional) storage data structure of the three-dimensional geological model, acquiring the number of points transmitted into the three-dimensional geological model by the model/plastics, judging the existence layer of boundary points of a cutting area by using the number of upper and lower surfaces of each geological layer because the number of the model/plastics is the number of the points of the model, so as to realize layering of the input three-dimensional geological model, and stitching two layers of triangular grids by using a triangular grid edge stitching algorithm after acquiring edge edges of the upper and lower layers to form a cutting block model;
Step 5.10: obtaining the points of the cutting area of each geological layer by layering the cutting area, processing the data into a point cloud format, reconstructing the rolling ball algorithm on the upper surface and the lower surface, stitching by applying a triangular mesh edge stitching algorithm, generating a cutting block of a single geological layer, and outputting the volume and the surface area of the cutting block;
step 5.11: and 5.1 to 5.9, repeating the steps until each geological layer of the three-dimensional geological model is cut, registering and splicing all the cut geological layers together to form a complete three-dimensional geological cutting model, and registering and splicing the cutting blocks of each layer to form a complete cutting block.
The beneficial effects of adopting above-mentioned technical scheme to produce lie in: the mine three-dimensional geological modeling and layering cutting method provided by the invention realizes the complete flow of the complex three-dimensional geological model construction, the complete reconstruction of the three-dimensional geological model, the layering cutting of the three-dimensional geological model and the synchronous output of the model and the cutting block. The three-dimensional geological model visualization is realized, and the three-dimensional geological structure is visually checked. The problem that the model effect is influenced by excessive patches generated by poisson reconstruction is solved.
The invention provides a scanning point technology, and combines the scanning points with drilling data to construct a complex three-dimensional geological surface, which is closer to an actual scene, so as to realize more accurate observation.
The invention provides a triangular grid edge stitching algorithm, which realizes stitching of upper and lower layers of geological triangular grids with different numbers of edge points, and can cope with more complex edge gaps by comparing the edge stitching algorithm used before, so that the stitching speed is greatly improved, and the time required for processing twenty thousands of point clouds by the edge stitching algorithm used before is more than 1 minute. The triangle mesh edge stitching algorithm provided by the invention only takes 1 minute to process ninety thousand point clouds.
Compared with the traditional cutting method, the three-dimensional geological model layering cutting algorithm provided by the invention has the advantages that the cutting speed is greatly improved, the drawing of the cross section of the three-dimensional geological cutting model can be realized, the three-dimensional geological model which is subjected to layering cutting can be analyzed, the cutting volume and the surface area are output, meanwhile, the cutting blocks are reversely output, and the cutting blocks can be visually checked and analyzed.
The invention mainly provides a three-dimensional geological modeling and layered cutting method for mines, which realizes a three-dimensional visual complete flow of the geology of the mines. And a layering cutting function of the three-dimensional geological model is provided, so that the effective drawing of a cutting surface is realized, and meanwhile, a cutting block is output. Make up for the deficiency of reconstruction and cutting of three-dimensional geological model of domestic mine.
Different from the existing three-dimensional geological model cutting method, the three-dimensional geological model cutting surface cannot be well drawn, the method can be used for layering the cutting surface clearly, so that a user can know the cutting condition more intuitively, reverse engineering of cutting can be realized, and a cutting block is output, thereby better assisting the user in planning, making a more reasonable mining plan, further improving the informatization level and the production efficiency of the traditional mine, and effectively expanding the economic benefit of enterprises.
Drawings
FIG. 1 is a flow chart of a three-dimensional geological modeling and layering cutting method for a mine, which is provided by an embodiment of the invention;
FIG. 2 is a schematic diagram of data obtained from a surface scan point according to an embodiment of the present invention;
FIG. 3 is a flowchart of a coal seam data extraction function provided in an embodiment of the present invention;
FIG. 4 is a schematic diagram of boundary point extraction of scan points according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of complete three-dimensional formation surface data provided by an embodiment of the present invention;
FIG. 6 is a schematic diagram of a reconstruction surface of a poisson reconstruction algorithm according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a Poisson surface reconstruction after contour deletion according to an embodiment of the present invention;
FIG. 8 is a flow chart of a surface reconstruction process according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of a three-dimensional geologic model provided by an embodiment of the invention;
FIG. 10 is a schematic view of a three-dimensional geological cutting model provided by an embodiment of the present invention;
FIG. 11 is a schematic view of a three-dimensional geological cutting block according to an embodiment of the present invention.
Detailed Description
The following describes in further detail the embodiments of the present invention with reference to the drawings and examples. The following examples are illustrative of the invention and are not intended to limit the scope of the invention.
In the embodiment, a mine three-dimensional geological modeling and layering cutting method is used for scanning the earth surface based on a scanning point technology to obtain earth surface scanning data and earth surface drilling data; performing contour extraction on the surface scanning data by using a point cloud contour extraction algorithm, deleting data in a contour range in the drilling data by using a ray method with the contour as a boundary, and adding the surface scanning data into the surface drilling data to form surface point cloud data; performing surface reconstruction on complex surface point cloud data by using poisson reconstruction; reconstructing the surface of the rest geological layers and the ground drilling points by using rolling ball reconstruction; splicing the reconstructed layers, and stitching the layers by using a point cloud boundary stitching algorithm to form a complete three-dimensional geological model; selecting a cutting range on the basis of a three-dimensional geological model, acquiring the cutting range, deleting triangular surfaces in the cutting range, dividing model layers by using a layering algorithm, acquiring the point cloud boundaries of each layer after cutting, stitching by using a point cloud boundary stitching algorithm, and finally splicing a plurality of layers together to form the three-dimensional geological model after cutting and returning to a cutting block. As shown in fig. 1, the method specifically comprises the following steps:
Step 1: acquiring surface scanning data;
the earth surface data scanning technology is a technology capable of carrying out point cloud scanning on an earth surface oblique photography model, can effectively extract earth surface points, restore geological structures, improve the effects of model reconstruction, observation and analysis after cutting, and make a huge bedding for many function improvement effects, wherein the extracted scanning points are shown in figure 2. In this embodiment, through a series of experiments, two algorithms of uniform point scanning and triangular random dotting are compared, and it is found that the random dotting can increase excessive useless points, so that the three-dimensional reconstruction calculation amount is increased, and the problems that key ground surface details are lacking and the like can occur when the random points are reduced, so that the embodiment collects and records ground surface data in json files by using the uniform point scanning algorithm, adds the ground surface data into ground surface point cloud data through data processing, increases ground surface details, improves planning efficiency, and increases immersion feeling of users. Various details of the model surface can be embodied on the underground three-dimensional reconstruction model, and the problem of data change after the surface model is updated is solved. The specific implementation steps for acquiring the surface scanning data are as follows:
step 1.1: selecting a scanning area; the scanning area may be selected from polygonal structures, but quadrilateral structures work best.
Step 1.2: setting the number of scanning points; the number of scan points must not be too large to avoid too complex data resulting in too long a reconstruction time.
Step 1.3: converting a scanning point data format; the scan point data is converted from Cartesian coordinates to geographic coordinates.
Step 1.4: storing the scan point data into json file;
step 2: acquiring surface drilling data and preprocessing;
after the drilling data are obtained, the preprocessing work of the drilling data is completed, and three-dimensional point cloud data are provided for the subsequent splicing of the scanning point data.
Step 2.1: acquiring surface drilling data, processing complex geological types, and separating geological layer point cloud data of different geological types from the surface drilling data;
the principle of separating the geological layer point cloud data of different geological types is as follows:
traversing geological data under a single drilling point from top to bottom, and recording the first occurrence position and the last occurrence position of the target type data, which are respectively recorded as an upper surface and a lower surface; if other geological components with smaller thickness appear in the process, the process is directly ignored according to the experience of geological industry, and the process for extracting the geological layer point cloud data is shown in fig. 3.
Step 2.2, preprocessing each layer of point cloud data after separating the geological layer point cloud data of different geological types;
Step 2.2.1: calling a pclpy library in python, and extracting geological layer point cloud boundary points by using an alpha shapes algorithm; the alpha shapes algorithm is a simple and effective algorithm for quickly extracting boundary points.
Step 2.2.2: and carrying out two-dimensional interpolation on the point cloud data with uneven original distribution. And interpolating the point clouds on the upper surface and the lower surface by adopting an Rbf () interpolation algorithm in an interpolation sub-module of the scipy module suitable for non-uniformly distributed data interpolation.
Step 2.2.3: clipping the interpolated point cloud data according to the original point cloud boundary, reserving an original data area, and ensuring consistency before and after data processing.
Step 3: combining the preprocessed earth surface drilling data with earth surface scanning data to form earth surface point cloud data;
because the surface scanning data is only a part of the surface reconstruction data, the surface scanning data is required to be added into the surface drilling data instead to form complete three-dimensional stratum surface data;
step 3.1: the pclpy library is called in python, and the alpha shapes algorithm is used for extracting contour points of the acquired surface scanning data, and the result is shown in fig. 4.
Step 3.2: acquiring preprocessed surface drilling data, and deleting three-dimensional data in the boundary by using a ray method and taking surface scanning data contour points as the boundary;
Step 3.3: and splicing the surface scanning data with the surface drilling data processed by the ray method to form complete three-dimensional stratum surface data, wherein the result is shown in figure 5.
Step 4: carrying out three-dimensional point cloud reconstruction of a geological model on the basis of three-dimensional stratum data;
carrying out surface reconstruction on the surface drilling data subjected to pretreatment; the drilling data only has three-dimensional coordinates, normal vector data does not exist, and a calculation vector is needed. The separated coal seam point cloud data has the characteristics of wide distribution, small thickness, missing side data and the like, and the errors such as cavities on the side surfaces, mutual penetration of the upper surface and the lower surface and the like can occur when the whole three-dimensional reconstruction is performed by directly utilizing the upper surface point cloud data and the lower surface point cloud data. The surface scanning data volume is large, the complete stratum surface data has more than 4 ten thousand points, holes exist when the rolling ball reconstruction algorithm is used for reconstructing the stratum surface data, the holes are not smooth and natural, and the reconstruction time is too long, so the invention uses the poisson reconstruction algorithm for reconstruction, and provides an algorithm for deleting the poisson reconstruction redundant patches according to the contour, and the accuracy of surface reconstruction is improved. After the upper surface and the lower surface of the geological model are reconstructed and generated, the method of stitching the upper surface and the lower surface is adopted to reconstruct the whole three-dimensional model, and the method specifically comprises the following steps:
Step 4.1: calculating the normal vector of each geological layer point cloud in the three-dimensional stratum data; estimating point normal vectors of point clouds of each geological layer by using an estimate_normal () function of an Open3d module, wherein parameters of the estimated point clouds relate to an estimated radius and a maximum data point number max_nn of an estimated surface;
step 4.2: for stratum surface data, carrying out stratum surface reconstruction by using a poisson reconstruction algorithm; in this example, poisson reconstruction is performed by using the o3d.geometry.triangulmesh.create_from_point_group_poisson () function in the Open3d module, the parameter depth is set to 8, the poisson reconstruction is an implicit curved surface reconstruction scheme, the input is a set of directed point clouds on the object surface, and the three-dimensional mesh on the object surface is output. The difference between the direct grid reconstruction of the type in the delaunay is mainly that the vertexes of the output grid do not need to come from the original point cloud, the result is smoother, and the water tightness of the grid can be ensured due to global solution. Because the surface scanning point cloud data is non-watertight, the surface is reconstructed by the poisson reconstruction algorithm to generate a redundant surface patch, and the generation of the three-dimensional model is affected, as shown in fig. 6.
Step 4.3: cutting the surface of the formation after poisson reconstruction according to the three-dimensional surface profile of the formation;
since there are redundant patches on the surface after the reconstruction of the surface point cloud data and too many edge saw teeth are generated by deleting the redundant patches according to the density, the invention provides a method for cutting the poisson reconstruction surface according to the outline, the Open3D storage 3D data structure (triangulmeshs) of the 3D triangle grid is provided, firstly, the alpha shape algorithm is used for extracting boundary points of the three-dimensional stratum surface data, then, whether point clouds exist in the boundary point outline is screened based on a ray method, and the non-existing points are formed into the required stratum grid by operating the data structure trianges of the storage surface, and deleting the redundant triangle surfaces, as shown in fig. 7.
Step 4.4: reconstructing other uncomplicated geological layers except the stratum surface by adopting a rolling ball algorithm, combining triangular mesh data of the upper surface and the lower surface of the geological layers, registering and storing. The three-dimensional reconstruction flow of the upper and lower surfaces of each geological layer is shown in fig. 8.
Step 4.5: and (3) calling a triangular mesh edge stitching algorithm to stitch the upper and lower surfaces of each reconstructed geological layer to form a complete closed three-dimensional geological model.
The triangular grids on the upper and lower surfaces of each geological layer are still independent two surfaces after being combined, so that the triangular grids are required to be stitched to generate a complete three-dimensional geological model. Because two geological layers cannot be well connected by directly using a three-dimensional reconstruction algorithm, a cavity exists, and the traditional stitching algorithm needs to correspond to the number of upper and lower points to stitch well, cannot well cope with the hierarchical stitching of complex conditions, and the stitching time is too long, the problem that a triangular mesh model is not closed and the stitching time is solved by designing a triangular mesh edge stitching algorithm is solved by the method, and the specific implementation process of the algorithm is as follows:
Step 4.5.1: acquiring the edge of a geological layer; and establishing an edge array edge_vertical, traversing all triangle grids in the upper surface and the lower surface of the geological layer, acquiring three edges of the triangle, storing the three edges into the array if the edges are not in the array, and deleting the edges from the array if the same edges exist in the array.
Step 4.5.2: creating an array PointSingle_up for storing the edge points of the upper surface of the geological layer and an array PointSingle_Down for storing the edge points of the lower surface of the geological layer; the edge array edge_fields is scanned, the first element (namely an edge) of the array is taken, two end points of the edge are respectively recorded, and the numbers of the two end points are sequentially stored in the edge point array PointSingle_up.
Step 4.5.3: traversing edge arrays edge_vertical, screening edge edges, if the number of a first endpoint of the edge is equal to the number of the last element of the PointSingle_up array, adding the number of a second endpoint of the edge into the PointSingle_up array, and recording the edge edges; if not, step 4.5.5 is skipped.
Step 4.5.4: and (4) repeating the step 4.5.3 until the edge array edge_fields is traversed.
Step 4.5.5: step 4.5.2 to step 4.5.4 are repeated, the edge points obtained by the first traversal are stored in the edge point array PointSingle_up, and the edge points are stored in PointSingle_Down for the second time. The two arrays of PointSingle_up and PointSingle_Down store the edge points of the upper and lower surfaces of the geological layer respectively, in each array, every two adjacent edge points have an edge for directly connecting the adjacent edge points on the triangular mesh model, the number corresponding to the first element of the array is equal to the number corresponding to the last element, and the two adjacent edge points are connected end to form a ring.
Step 4.5.6: setting two rounds of loops, traversing the array PointSingle_up by the outer loop, extracting two points at a time, setting two pointers single_first, and pointing to the two points respectively by the single_last, wherein the inner loop is to loop the array PointSingle_down. The Euclidean distance between the two points pointed by the single_first and the single_last and the points in the PointSingle_Down array is respectively traversed and calculated.
Step 4.5.7: the two points pointed by single_first and single_last respectively select the point with the smallest Euclidean distance with the point in the PointSingle_Down array, the positions of the two points in the PointSingle_Down array in the array are obtained, and the point pointed by single_first and point pointed by single_last respectively point to the two points.
Step 4.5.8: judging whether the four_first and the four_last are equal, if so, connecting three pointers of the single_first, the single_last and the four_first to form a clockwise triangular patch, and adding the clockwise triangular patch into the triangules attribute of the triangular mesh by means of an application () function. If the repetition_first is greater than the repetition_last, then step 4.5.9 is performed, otherwise, step 4.5.10 is performed.
Step 4.5.9: judging whether the sequence_first is in the previous bit of the sequence_last, if so, connecting four pointers of the sequence_first, the sequence_last, the sequence_first and the sequence_last to form two clockwise triangular patches, and adding the two clockwise triangular patches into the triangules attribute of the triangular mesh by means of an application () function. If not, entering a while loop, setting a complete_first pointer to advance once per loop, connecting the four pointers to form two clockwise triangular patches each time, adding the triangular patches into the triangulated elements of the triangular mesh by means of an application () function, ending the loop until the complete_first is in front of the complete_last, generating the last two triangular patches by using the four pointers, and adding the last two triangular patches into the triangulated elements.
Step 4.5.10: judging whether the repetition_first is at the latter bit of the repetition_last, if yes, connecting the four pointers to form two clockwise triangular patches, and adding the triangle patches into the triangules attribute of the triangular mesh by means of an application () function. If not, entering a while loop, setting a complete_first pointer to back once every loop, connecting the four pointers to form two clockwise triangular patches every time, adding the triangular patches into the triangulated elements of the triangular meshes by means of an application () function, ending the loop until the complete_first is at the rear of the complete_last, generating the last two triangular patches by using the four pointers, and adding the last two triangular patches into the triangulated elements.
Step 4.5.11: each geological layer is stitched, and a three-dimensional geological model is output, and the model is shown in fig. 9.
Step 5: performing layered cutting on the established three-dimensional geological model;
the three-dimensional geologic model layering cutting algorithm is an algorithm for cutting the triangular mesh geologic model according to a cutting area selected by a user. The algorithm sets a triangular mesh model, a cutting area cut_area and a cutting height as parameters, wherein the model is a model of a geological layer, the cut_area is a coordinate array, each element of the model contains longitude and latitude information and represents a position in the triangular mesh model, and an edge is formed between every two adjacent coordinates. To form a closed region, the first element and the last element of the array are identical, and the edges may form an arbitrarily closed polygon. The algorithm cuts a plurality of input geological layers, and finally the geological layers are spliced together to form a complete three-dimensional geological cutting model, and the specific implementation process of the algorithm is as follows:
step 5.1: determining an outsourcing rectangle of a cutting area according to the longitude and latitude of the minimum and maximum delimited areas of the user, and performing layered cutting on a three-dimensional geological model in the outsourcing rectangle;
Step 5.2: the variable num is set and initialized to zero, representing the number of rays passing through the sides of the closed polygon for each geological layer data point in the three-dimensional geological model.
Step 5.3: selecting one side of a user-defined area according to the sequence, judging whether two endpoints of the side are respectively positioned at two sides of a horizontal line passing through each layer of point cloud (if the endpoints are coincident with the horizontal line, the endpoints are judged to be positioned at the upper side of the horizontal line), and if the endpoints are not positioned at the upper side of the horizontal line, performing no treatment; if yes, solving an intersection point of the horizontal line and the current edge, and if the longitude of the intersection point is greater than or equal to the longitude of the input point, adding one to num;
step 5.4: repeating the step 5.3 until the edges of the area defined by all users are traversed;
step 5.5: if num is odd, returning True, indicating that the data point is located inside the cut region; otherwise return False. Setting a triangules-work array for storing data points of the cut area, and determining a point at which a True return value is obtained via an ispoiwisthinpoly (point_area)) function is stored in the triangules-work array.
Step 5.6: after all data points located in the cutting area are determined, traversing the triangules attribute of the triangular mesh, and if no vertex exists in the triangules_work array, not processing; if three vertexes of the triangular plate exist in the triangulars-work array, deleting the triangular plate; if one or both vertices are located in the triangules_work array, go to step 5.8.
Step 5.7: and 5.6, repeating the step 5.9 until all the triangular plates are traversed.
Step 5.8: and judging the intersected cutting area edges according to the three-dimensional coordinate values of the triangle to be cut and the cutting area. According to the surface patch splitting method, two intersection points of the cutting edge and the triangle are calculated, the vertexes in the cutting area are deleted, and the two intersection points are added into the vertex array of the three-dimensional geological model. If two vertexes are positioned in the cutting area, the outer vertexes of the cutting area and the two intersection points form a triangle clockwise; if one vertex is positioned in the cutting area, the two intersection points and the two vertexes outside the cutting area form a triangle clockwise respectively. And finally deleting the triangular mesh data of the cut triangle in the three-dimensional geological model, and adding the newly generated triangle.
Step 5.9: the method comprises the steps of utilizing Open3D to store a data structure of a three-dimensional geological model, setting model/plastics to store the data structure of the vertexes of triangular surfaces of the three-dimensional geological model, acquiring the number of points transmitted into the three-dimensional geological model through the model/plastics, judging the existence layer of boundary points of a cutting area by utilizing the number of the upper surface and the lower surface of each geological layer because the number of the model/plastics is the number of the points of the model, layering the input three-dimensional geological model, and applying a triangular grid edge stitching algorithm to stitch two layers of triangular grids after the edge edges of the upper layer and the lower layer are acquired to form a cutting block model.
Step 5.10: the method comprises the steps of layering cutting areas, obtaining points of the cutting areas of each geological layer, processing data into a point cloud format, reconstructing a rolling ball algorithm on the upper surface and the lower surface, stitching by applying a triangular mesh edge stitching algorithm, generating cutting blocks of the single geological layer, and outputting the volumes and the surface areas of the cutting blocks.
Step 5.11: repeating steps 5.1 to 5.9 until cutting is completed on each geological layer of the three-dimensional geological model, registering and splicing all geological layers after cutting together to form a complete three-dimensional geological cutting model, as shown in fig. 10, and registering and splicing the cutting blocks of each layer to form a complete cutting block, as shown in fig. 11.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced with equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions, which are defined by the scope of the appended claims.
Claims (9)
1. A three-dimensional geological modeling and layered cutting method for mines is characterized in that: acquiring surface scanning data and surface drilling data; performing contour extraction on the surface scanning data by using a point cloud contour extraction algorithm, deleting data in a contour range in the drilling data by using a ray method with the contour as a boundary, and adding the surface scanning data into the surface drilling data to form surface point cloud data; performing surface reconstruction on the surface point cloud data by using poisson reconstruction; reconstructing the surface of the rest geological layers and the ground drilling points by using rolling ball reconstruction; splicing the reconstructed layers, and stitching the layers by using a point cloud boundary stitching algorithm to form a complete three-dimensional geological model; selecting a cutting range on the basis of a three-dimensional geological model, acquiring the cutting range, deleting triangular surfaces in the cutting range, dividing model layers by using a layering algorithm, acquiring the point cloud boundaries of each layer after cutting, stitching by using a point cloud boundary stitching algorithm, and finally splicing a plurality of layers together to form the three-dimensional geological model after cutting and returning to a cutting block.
2. The mine three-dimensional geological modeling and layering cutting method according to claim 1, wherein the method comprises the following steps of: the method comprises the following steps:
Step 1: acquiring surface scanning data;
step 2: acquiring surface drilling data and preprocessing;
after the drilling data are obtained, the preprocessing work of the drilling data is completed, and three-dimensional point cloud data are provided for the subsequent splicing of scanning point data;
step 3: combining the preprocessed earth surface drilling data with earth surface scanning data to form earth surface point cloud data;
step 4: carrying out three-dimensional point cloud reconstruction of a geological model on the basis of three-dimensional stratum data;
step 5: and carrying out layered cutting on the established three-dimensional geological model, and registering and splicing all the cut geological layers together to form a complete three-dimensional geological cutting model.
3. The mine three-dimensional geological modeling and layering cutting method according to claim 2, wherein the method comprises the following steps of: the specific method of the step 1 is as follows:
step 1.1: selecting a scanning area; the scanning area can select a polygonal structure, but the quadrangular structure has the best effect;
step 1.2: setting the number of scanning points; the number of scanning points cannot be too large, so that the reconstruction time is too long due to too complex data;
step 1.3: converting a scanning point data format; converting the scanning point data from Cartesian coordinates to geographic coordinates;
Step 1.4: the scan point data is stored in json file.
4. A method for three-dimensional geologic modeling and stratified cutting of mines according to claim 3, characterized in that: the specific method of the step 2 is as follows:
step 2.1: acquiring surface drilling data, processing complex geological types, and separating geological point cloud data of different geological types from the surface drilling data;
step 2.2, preprocessing each layer of point cloud data after separating the geological point cloud data of different geological types;
step 2.2.1: extracting geological layer point cloud boundary points;
step 2.2.2: performing two-dimensional interpolation on point cloud data with uneven original distribution;
step 2.2.3: clipping the interpolated point cloud data according to the original point cloud boundary, reserving an original data area, and ensuring consistency before and after data processing.
5. The method for three-dimensional geological modeling and layering cutting of mines according to claim 4, wherein the method comprises the following steps: the specific method of the step 3 is as follows:
step 3.1: extracting contour points from the acquired surface scanning data;
step 3.2: acquiring preprocessed surface drilling data, and deleting three-dimensional data in the boundary by using a ray method and taking surface scanning data contour points as the boundary;
Step 3.3: and splicing the earth surface scanning data with the earth surface drilling data processed by the ray method to form complete three-dimensional stratum surface data.
6. The method for three-dimensional geological modeling and layering cutting of mines according to claim 5, wherein the method comprises the following steps: the specific method of the step 3 is as follows:
step 4.1: calculating the normal vector of each geological layer point cloud in the three-dimensional stratum data;
step 4.2: for stratum surface data, carrying out stratum surface reconstruction by using a poisson reconstruction algorithm;
step 4.3: cutting the surface of the formation after poisson reconstruction according to the three-dimensional surface profile of the formation;
step 4.4: reconstructing other geological layers except the stratum surface by adopting a rolling ball algorithm, combining triangular mesh data of the upper surface and the lower surface of the geological layers, registering and storing;
step 4.5: and (3) calling a triangular mesh edge stitching algorithm to stitch the upper and lower surfaces of each reconstructed geological layer to form a complete closed three-dimensional geological model.
7. The method for three-dimensional geological modeling and layering cutting of mines according to claim 6, wherein the method comprises the following steps: the specific method of the step 4.3 is as follows:
firstly, extracting boundary points of three-dimensional stratum surface data, then screening whether point clouds exist in the boundary point outline or not based on a ray method, and deleting redundant triangular faces by operating data structures trianges of storage faces on non-existing points to form a needed stratum grid.
8. The method for three-dimensional geological modeling and layering cutting of mines according to claim 7, wherein the method comprises the following steps: the specific method of the step 4.5 is as follows:
step 4.5.1: acquiring the edge of a geological layer; establishing an edge array edge_vertical, traversing all triangle grids on the upper surface and the lower surface of a geological layer, acquiring three edges of a triangle, storing the three edges into the array if the edges are not in the array, and deleting the edges from the array if the same edges exist in the array;
step 4.5.2: creating an array PointSingle_up for storing the edge points of the upper surface of the geological layer and an array PointSingle_Down for storing the edge points of the lower surface of the geological layer; scanning an edge array edge_vertical, taking the first element of the array, respectively recording two endpoints of the edge, and storing the numbers of the two endpoints in an edge point array PointSingle_up in sequence;
step 4.5.3: traversing edge arrays edge_vertical, screening edge edges, if the number of a first endpoint of the edge is equal to the number of the last element of the PointSingle_up array, adding the number of a second endpoint of the edge into the PointSingle_up array, and recording the edge edges; if not, jumping to the step 4.5.5;
Step 4.5.4: repeating the step 4.5.3 until the edge array edge_fields is traversed;
step 4.5.5: repeating the steps 4.5.2 to 4.5.4, storing the edge points obtained by the first traversal in an edge point array PointSingle_up, and storing the edge points in PointSingle_Down for the second time; the two arrays of the PointSingle_up and PointSingle_down respectively store edge points of the upper surface and the lower surface of the geological layer, in each array, every two adjacent edge points are provided with an edge for directly connecting the adjacent edge points on the triangular mesh model, the number corresponding to the first element of the array is equal to the number corresponding to the last element, and the two adjacent edge points are connected end to form a ring;
step 4.5.6: setting two rounds of circulation, wherein the outer-layer circulation traverses the array PointSingle_up, two points are extracted at a time, two pointers single_first are set, single_last points to the two points respectively, and the inner-layer circulation circulates the array PointSingle_down; respectively traversing and calculating Euclidean distances between two points pointed by single_first and single_last and points in the PointSingle_Down array;
step 4.5.7: the method comprises the steps that two points pointed by single_first and single_last are respectively selected to be the point with the smallest Euclidean distance between the points in the PointSingle_Down array, the positions of the two points in the PointSingle_Down array in the array are obtained, and a point_first pointer and a point_last pointer are respectively pointed to the two points;
Step 4.5.8: judging whether the sequence_first and the sequence_last are equal, if so, connecting three pointers of the single_first, the single_last and the sequence_first to form a clockwise triangular patch, and adding the clockwise triangular patch into the triangules attribute of the triangular mesh by means of an application () function; if the repetition_first is greater than the repetition_last, then step 4.5.9 is performed, otherwise, step 4.5.10 is performed;
step 4.5.9: judging whether the sequence_first is in the previous bit of the sequence_last, if so, connecting four pointers of the sequence_first, the sequence_last, the sequence_first and the sequence_last to form two clockwise triangular patches, and adding the two clockwise triangular patches into the triangules attribute of the triangular mesh by means of an application () function; if not, entering a while loop, setting a complete_first pointer to advance once per loop, connecting the four pointers to form two clockwise triangular patches each time, adding the triangular patches into the triangulars attribute of the triangular mesh by means of an application () function, ending the loop until the complete_first is in the previous position of the complete_last, generating the last two triangular patches by using the four pointers, and adding the last two triangular patches into the triangulars attribute;
step 4.5.10: judging whether the repetition_first is at the latter bit of the repetition_last, if yes, connecting the four pointers to form two clockwise triangular patches, and adding the triangular patches into the triangules attribute of the triangular mesh by means of an application () function; if not, entering a while loop, setting a complete_first pointer to back once every loop, connecting the four pointers to form two clockwise triangular patches every time, adding the triangular patches into the triangulars attribute of the triangular mesh by means of an application () function, ending the loop until the complete_first is at the rear position of the complete_last, generating the last two triangular patches by using the four pointers, and adding the last two triangular patches into the triangulars attribute;
Step 4.5.11: and sewing each geological layer, and outputting the three-dimensional geological model.
9. The mine three-dimensional geologic modeling and layering cutting method of claim 8, wherein the method comprises the following steps: the specific method in the step 5 is as follows:
step 5.1: determining an outsourcing rectangle of a cutting area according to the longitude and latitude of the minimum and maximum delimited areas of the user, and performing layered cutting on a three-dimensional geological model in the outsourcing rectangle;
step 5.2: setting a variable num and initializing to zero, wherein the number of rays passing through the edges of the closed polygon of each geological layer data point in the three-dimensional geological model is represented;
step 5.3: selecting one side of a user-defined area according to the sequence, judging whether two endpoints of the side are respectively positioned at two sides of a horizontal line passing through each layer of point cloud, and if not, not performing any treatment; if yes, solving an intersection point of the horizontal line and the current edge, and if the longitude of the intersection point is greater than or equal to the longitude of the input point, adding one to num;
step 5.4: repeating the step 5.3 until the edges of the area defined by all users are traversed;
step 5.5: if num is odd, returning True, indicating that the data point is located inside the cut region; otherwise, returning to False; setting a triangules-work array for storing data points of the cutting area, and determining a point for obtaining a True return value through an ispoiwisthinpoly (point_area)) function to be stored in the triangules-work array;
Step 5.6: after all data points located in the cutting area are determined, traversing the triangules attribute of the triangular mesh, and if no vertex exists in the triangules_work array, not processing; if three vertexes of the triangular plate exist in the triangulars-work array, deleting the triangular plate; if one vertex or two vertices are located in the triangules_work array, turning to step 5.8;
step 5.7: repeating the step 5.6 until all the triangular plates are traversed and the step 5.9 is completed;
step 5.8: judging the intersected cutting area edges according to the three-dimensional coordinate values of the triangle to be cut and the cutting area; according to a dough sheet splitting method, calculating two intersection points of a cutting edge and a triangle, deleting vertexes in a cutting area, and adding the two intersection points into a vertex array of the three-dimensional geological model; if two vertexes are positioned in the cutting area, the outer vertexes of the cutting area and the two intersection points form a triangle clockwise; if one vertex is positioned in the cutting area, two intersection points respectively form a triangle with two vertexes outside the cutting area clockwise; finally, deleting triangular mesh data of the cut triangle in the three-dimensional geological model, and adding the newly generated triangle;
step 5.9: setting model/plastics as a data structure for storing vertexes of triangular surfaces of the three-dimensional geological model by using an Open3D (three-dimensional) storage data structure of the three-dimensional geological model, acquiring the number of points transmitted into the three-dimensional geological model by the model/plastics, judging the existence layer of boundary points of a cutting area by using the number of upper and lower surfaces of each geological layer because the number of the model/plastics is the number of the points of the model, so as to realize layering of the input three-dimensional geological model, and stitching two layers of triangular grids by using a triangular grid edge stitching algorithm after acquiring edge edges of the upper and lower layers to form a cutting block model;
Step 5.10: obtaining the points of the cutting area of each geological layer by layering the cutting area, processing the data into a point cloud format, reconstructing the rolling ball algorithm on the upper surface and the lower surface, stitching by applying a triangular mesh edge stitching algorithm, generating a cutting block of a single geological layer, and outputting the volume and the surface area of the cutting block;
step 5.11: and 5.1 to 5.9, repeating the steps until each geological layer of the three-dimensional geological model is cut, registering and splicing all the cut geological layers together to form a complete three-dimensional geological cutting model, and registering and splicing the cutting blocks of each layer to form a complete cutting block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311150031.0A CN117173357A (en) | 2023-09-07 | 2023-09-07 | Mine three-dimensional geological modeling and layered cutting method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311150031.0A CN117173357A (en) | 2023-09-07 | 2023-09-07 | Mine three-dimensional geological modeling and layered cutting method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117173357A true CN117173357A (en) | 2023-12-05 |
Family
ID=88935139
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311150031.0A Pending CN117173357A (en) | 2023-09-07 | 2023-09-07 | Mine three-dimensional geological modeling and layered cutting method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117173357A (en) |
-
2023
- 2023-09-07 CN CN202311150031.0A patent/CN117173357A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| McCullagh | Terrain and surface modelling systems: theory and practice | |
| Gong et al. | Three-dimensional modeling and application in geological exploration engineering | |
| Natali et al. | Modeling Terrains and Subsurface Geology. | |
| Guo et al. | Three-dimensional geological modeling and spatial analysis from geotechnical borehole data using an implicit surface and marching tetrahedra algorithm | |
| CN105184867B (en) | The three dimensional contour line method of rule-based grid and Corner-point Grids technology | |
| CA2918499C (en) | Dynamically updating compartments representing one or more geological structures | |
| US20110310101A1 (en) | Pillar grid conversion | |
| CN106844871A (en) | Three-dimensional geotechnical engineering investigation information model construction method based on BIM | |
| CN111784840B (en) | LOD (line-of-sight) level three-dimensional data singulation method and system based on vector data automatic segmentation | |
| CN114255188B (en) | Boundary linear smoothing method and device for drawing three-dimensional geological lithologic grid model | |
| CN105469443A (en) | Method for generating three-dimensional geological map based on geological route (PRB) process double modeling | |
| CN110189409B (en) | PLAXIS-based rapid true three-dimensional geological modeling method and system | |
| CN116152461B (en) | Geological modeling method, device, computer equipment and computer readable storage medium | |
| CN111383336A (en) | Three-dimensional geological model construction method | |
| CN106803281A (en) | A kind of information extraction of excavation slope sillar and three-dimensional reconstruction method | |
| Wu et al. | On three-dimensional geological modeling and visualization | |
| CN112231818B (en) | Mountain city three-dimensional geological modeling method based on BIM | |
| CN112464479A (en) | Three-dimensional ore formation prediction method and system based on GOCAD | |
| CN112084548B (en) | 2.5D visual modeling method and system for slope stability analysis | |
| CN107886573B (en) | Slope three-dimensional finite element grid generation method under complex geological conditions | |
| CN111445569B (en) | Sedimentary geological evolution dynamic simulation method | |
| CN107492130B (en) | Non-continuous equivalent cloud picture generation method based on layer rendering | |
| CN116758199A (en) | Method for rendering and sealing continuous section of multilayer TIN geological model in real time | |
| CN117173357A (en) | Mine three-dimensional geological modeling and layered cutting method | |
| CN116109783A (en) | Open-pit mine three-dimensional mining planning system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |