A three-dimensional geological BIM modeling method and device based on exploration data

Abstract

The present application relates to a kind of three-dimensional geological BIM modeling method and device based on exploration data, method includes the following steps: obtaining the borehole data of engineering exploration, interpolation is handled to the borehole coordinate data in borehole data, the borehole point and interpolation point obtained are as discrete point, the hull profile of all discrete points is calculated, the hull profile is triangulated, further reconstructs concave shape, obtains the single layer Mesh grid of soil layer;According to the soil composition corresponding to the soil layer that borehole point passes through, single layer Mesh grid is rendered, according to the soil layer thickness corresponding to the soil layer that borehole point passes through, generate upper and lower two layers Mesh grid, construct the outer edge profile of soil layer, finally obtain the three-dimensional model of soil layer.Compared with prior art, the present application has the advantages of real data source, accurate model;Algorithm is efficient, and model generation efficiency is high;Model contains geological related data, supports subsequent analysis and prediction etc..

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of three-dimensional geological modeling, in particular to a three-dimensional geological BIM modeling method and device based on exploration data. BACKGROUND

[0002] The concept of three-dimensional geological modeling was first proposed by Simon WHoulding of Canada in 1993. Three-dimensional geological modeling is a new technology for geological research that combines spatial information management, geological interpretation, spatial analysis and prediction, geostatistics, entity content analysis, and graphical visualization in a three-dimensional environment using computer technology.

[0003] The existing technology has the following technical defects:

[0004] 1. Current geological three-dimensional modeling software mainly uses foreign software.

[0005] 2. The existing modeling software generates models that are not fine enough.

[0006] 3. It cannot be seamlessly integrated with a lightweight Web display platform.

[0007] 4. There is currently no full-process data visualization monitoring system. SUMMARY

[0008] The present application is to overcome the defects of the prior art and provide a three-dimensional geological BIM modeling method and device based on exploration data, which can efficiently generate a three-dimensional geological model.

[0009] The present application can be achieved by the following technical solutions:

[0010] A three-dimensional geological BIM modeling method based on exploration data, comprising the following steps:

[0011] Obtain drilling data from engineering exploration, interpolate the drilling coordinate data in the drilling data, take the obtained drilling points and interpolated points as discrete points, calculate the convex hull profile of all discrete points, triangulate the convex hull profile, and then reconstruct the concave hull shape to obtain a single-layer grid of the soil layer;

[0012] Render the single-layer grid according to the soil composition corresponding to the soil layer through which the drilling point passes, generate upper and lower layer grids according to the soil layer thickness corresponding to the soil layer through which the drilling point passes, construct the outer edge profile of the soil layer, and finally obtain a three-dimensional model of the soil layer.

[0013] Further, the process of the interpolation processing comprises:

[0014] According to the drilling coordinate data in the drilling data, a drilling point is obtained, each drilling point is scanned to obtain adjacent drilling points with a preset radius value, an interpolation point is inserted between each two adjacent drilling points, and other interpolation points within a preset angle range of the connecting line vector of the two drilling points are removed; when the distance between the generated interpolation point and the drilling point is lower than a specific value, the interpolation point is not generated.

[0015] Further, the process of calculating the convex hull profile comprises:

[0016] A starting point is selected from the discrete points, the direction of the points surrounding the convex hull is determined by the cross product angle, and finally the convex hull profile is formed.

[0017] Further, the specific process of triangulating the convex hull profile comprises:

[0018] The discrete points on the convex hull profile are triangulated, and the following characteristics are met during the triangulation process:

[0019] The triangle satisfies the empty circle characteristic: the circumcircle of each triangle does not contain any other points in the plane;

[0020] The maximum minimum angle characteristic: the minimum angle of the six internal angles of the convex quadrilateral formed by each two adjacent triangles does not increase after mutual exchange.

[0021] Further, the process of reconstructing the concave hull shape comprises:

[0022] A length threshold and a minimum angle threshold are set; a triangle facet set is obtained after triangulation, in the triangle facet set, the edges adjacent to two triangles are regarded as internal edges, the edges adjacent to one triangle are regarded as boundary edges, and the edges adjacent to no triangle are regarded as degenerate edges;

[0023] All boundary edges with a length greater than the length threshold are added to a queue, and the following process is looped when the queue is not empty:

[0024] Any boundary edge in the queue is selected to obtain the corresponding adjacent triangle;

[0025] The other two edges in the adjacent triangle are obtained, and the adjacent triangle is deleted from the set of adjacent triangles of the two edges;

[0026] The newly formed boundary edge with a length greater than the length threshold by the two obtained edges is added to the queue;

[0027] The boundary edge is marked as invalid, and if the two obtained edges become degenerate edges, they are marked as invalid;

[0028] Obtain all outermost triangles in the triangle set, and compare them with the minimum angle threshold, and delete the outermost triangles less than the minimum angle threshold;

[0029] After the end of the queue cycle, all valid boundary edges are collected to form an edge list output, and a concave hull shape is constructed.

[0030] Further, according to the soil composition corresponding to the soil layer passed by the drilling point, the single-layer grid is rendered, specifically: according to the soil composition corresponding to the soil layer passed by the drilling point, the material coloring processing is performed on each triangle in the concave hull shape.

[0031] In the coloring processing process, according to each discrete point surrounding the triangle, the corresponding soil composition is obtained, and the soil composition with the highest frequency is taken as the soil composition corresponding to the triangle, so that corresponding coloring processing is performed; wherein, if the discrete point is an interpolation point, the soil compositions of the drilling points formed by the interpolation point are taken as the soil composition of the interpolation point as a whole.

[0032] Further, the process of constructing the outer edge contour of the soil layer is specifically:

[0033] Taking all non-adjacent triangle edges in the upper and lower layer grids as the outer envelope of the triangle set, the outer edge contour of the corresponding soil layer is generated based on the outer envelope.

[0034] The application also provides a three-dimensional geological BIM modeling device based on exploration data, comprising:

[0035] A data acquisition module is used to acquire drilling data of engineering exploration, and interpolation processing is performed on drilling coordinate data in the drilling data.

[0036] A single-layer grid construction module is used to take the acquired drilling points and interpolation points as discrete points, calculate the convex hull contour of all discrete points, perform triangulation on the convex hull contour, and then reconstruct the concave hull shape to obtain the single-layer grid of the soil layer.

[0037] A three-dimensional reconstruction module is used to render the single-layer grid according to the soil composition corresponding to the soil layer passed by the drilling point, generate upper and lower layer grids according to the soil layer thickness corresponding to the soil layer passed by the drilling point, construct the outer edge contour of the soil layer, and finally obtain the three-dimensional model of the soil layer.

[0038] The application also provides a three-dimensional geological BIM modeling device based on exploration data, comprising a memory and one or more processors, the memory stores executable code, and the one or more processors execute the executable code to implement the above-mentioned three-dimensional geological BIM modeling method based on exploration data.

[0039] The application further provides a computer readable storage medium, which stores a program, and the program is executed by a processor to realize the three-dimensional geological BIM modeling method based on exploration data.

[0040] Compared with the prior art, the application has the following advantages:

[0041] (1) The data source is real, and the model is accurate.

[0042] (2) The algorithm is efficient, and the model generation efficiency is high.

[0043] (3) The model contains geological related data, and supports subsequent analysis and prediction. BRIEF DESCRIPTION OF DRAWINGS

[0044] Figure 1 A flowchart of a three-dimensional geological BIM modeling method based on exploration data provided in an embodiment of the application is shown in the figure;

[0045] Figure 2 A schematic diagram of a drilling point distribution provided in an embodiment of the application is shown in the figure;

[0046] Figure 3 A schematic diagram of the distribution of the drilling points after interpolation provided in an embodiment of the application is shown in the figure;

[0047] Figure 4 A first schematic diagram of the processing result of a convex hull algorithm provided in an embodiment of the application is shown in the figure;

[0048] Figure 5 A second schematic diagram of the processing result of a convex hull algorithm provided in an embodiment of the application is shown in the figure;

[0049] Figure 6 A third schematic diagram of the processing result of a convex hull algorithm provided in an embodiment of the application is shown in the figure;

[0050] Figure 7 A fourth schematic diagram of the processing result of a convex hull algorithm provided in an embodiment of the application is shown in the figure;

[0051] Figure 8 A fifth schematic diagram of the processing result of a convex hull algorithm provided in an embodiment of the application is shown in the figure;

[0052] Figure 9 A schematic diagram of a Delaunay triangulation result provided in an embodiment of the application is shown in the figure;

[0053] Figure 10 A schematic diagram of a reconstructed concave hull shape provided in an embodiment of the application is shown in the figure;

[0054] Figure 11 A schematic diagram of a soil layer surface Mesh grid provided in an embodiment of the application is shown in the figure;

[0055] Figure 12 This is a schematic diagram illustrating the result of coloring a Mesh grid based on soil composition, as provided in an embodiment of the present invention.

[0056] Figure 13 This is a schematic diagram showing the generation result of a three-dimensional model of a soil layer provided in an embodiment of the present invention;

[0057] Figure 14 This is a structural block diagram of a three-dimensional geological BIM modeling device based on exploration data provided in an embodiment of the present invention. Detailed Implementation

[0058] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0059] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0060] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.

[0061] In the description of this invention, it should be noted that the terms "center," "upper," "lower," "left," "right," "vertical," "horizontal," "inner," and "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings, or the orientation or positional relationship in which the product of this invention is usually placed during use. They are only for the convenience of describing this invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on this invention.

[0062] Example 1

[0063] like Figure 1 As shown, this embodiment provides a three-dimensional geological BIM modeling method based on exploration data, including the following steps:

[0064] S1: Obtain drilling data of engineering exploration, and perform interpolation processing on drilling coordinate data in the drilling data;

[0065] S2: Take the obtained drilling points and interpolation points as discrete points, calculate the convex hull contour of all the discrete points, perform triangulation on the convex hull contour, and then reconstruct the concave hull shape to obtain a single-layer Mesh grid of the soil layer;

[0066] S3: Render the single-layer Mesh grid according to the soil composition corresponding to the soil layer through which the drilling point passes;

[0067] S4: Generate upper and lower two-layer Mesh grids according to the soil layer thickness corresponding to the soil layer through which the drilling point passes;

[0068] S5: Construct the outer edge contour of the soil layer, and finally obtain a three-dimensional model of the soil layer.

[0069] The stratum three-dimensional modeling is based on the analysis of drilling data of engineering exploration, fitting a three-dimensional Mesh grid of the soil layer based on a program algorithm, rendering the grid data based on the soil composition, and finally obtaining a stratum three-dimensional model. The Liqing database is a database for persistently storing tabular data obtained by geological exploration. The analysis of the Liqing data mainly involves the rapid reading of the database tabular data.

[0070] The above steps will be described in detail below.

[0071] S1: Obtain drilling data of engineering exploration, and perform interpolation processing on drilling coordinate data in the drilling data;

[0072] The obtained data includes drilling data recorded in the exploration, such as drilling point coordinates, drilling elevation, drilling soil related information, and soil layer related data, main sublayer layering data, etc.

[0073] The interpolation process uses nearest point interpolation, which specifically includes:

[0074] According to the drilling coordinate data in the drilling data, obtain drilling points, and for each drilling point, scan to obtain adjacent drilling points with a preset radius value. Remove other interpolation points within a preset angle range from the connecting line vector of the two drilling points. When the distance between the generated interpolation point and the drilling point is below a certain value, do not generate the interpolation point.

[0075] The specific process can be:

[0076] Based on the drilling coordinate data obtained by database analysis, the approximate plane contour of the stratum can be obtained. For different soil conditions of different drilling points through the soil layer, central interpolation processing is performed between adjacent drilling points. The drilling distribution is as shown in Figure 2 .

[0077] Add interpolation discrete points in the middle of all adjacent boreholes. Start scanning adjacent borehole points within a preset radius value with any point, sort according to the interval, insert interpolation points in the middle of two boreholes, while removing other interpolation points within a preset angle range of the connecting line vector of the two boreholes, and interpolation points with a distance below a certain value do not generate interpolation points. As shown in Figure 3 , small dots are interpolation points.

[0078] The preset radius value can be 50Km, the preset angle can be 5 degrees, and the specific value can be 5Mm.

[0079] S2: Take the obtained borehole points and interpolation points as discrete points, calculate the convex hull contour of all discrete points, triangulate the convex hull contour, and then reconstruct the concave hull shape to obtain a single-layer Mesh grid of the soil layer;

[0080] In order to obtain a three-dimensional model of the stratum, it is necessary to obtain the upper and lower surface Mesh grids of the stratum model based on the discrete points after interpolation of the boreholes. The Mesh grid is a combination of triangular facets. By calculating the convex hull contour of the discrete points, the convex hull is triangulated to obtain a set of triangular facets of the soil layer surface Mesh grid.

[0081] The following will be described in detail.

[0082] As shown in Figures 4-8 , the calculation process of the convex hull contour includes:

[0083] Select a starting point from the discrete points, determine the direction of the points surrounding the convex hull by the cross product angle, and finally form the convex hull contour.

[0084] In this embodiment, the convex hull algorithm for the discrete points uses Graham's scan. It finds the point with the lowest Y in the plane point set as the starting point (the Y coordinate value of the discrete point corresponding to the real borehole), then determines the direction of the point by the cross product angle, and finally leaves the point sequence of the convex hull in the stack.

[0085] The specific process of triangulating the convex hull contour includes:

[0086] Triangulate the discrete points on the convex hull contour. In the process of triangulation, the following characteristics are met:

[0087] The triangle satisfies the empty circle characteristic: the circumcircle of each triangle does not contain any other points in the plane;

[0088] The maximum minimum angle characteristic: the minimum angle of the six internal angles of the convex quadrilateral formed by each two adjacent triangles does not increase after mutual exchange.

[0089] In this embodiment, the Delaunay triangulation method is used to triangulate the discrete points. The triangles obtained by the algorithm satisfy the empty circle property (the circumcircle of each Delaunay triangle does not contain any other points in the plane) and the maximum minimum angle property (the minimum angle of the six internal angles of the convex quadrilateral formed by two adjacent triangles does not increase after mutual exchange of the diagonals).

[0090] As shown in Figure 9 , the final triangulation effect of the discrete points is shown.

[0091] The process of reconstructing the concave hull shape includes:

[0092] Setting a length threshold and a minimum angle threshold; obtaining a triangle facet set obtained after triangulation, in the triangle facet set, the edges adjacent to two triangles are internal edges, the edges adjacent to one triangle are boundary edges, and the edges adjacent to zero triangles are degenerate edges;

[0093] Adding all boundary edges E with a length greater than the length threshold to the queue, and looping the following process when the queue is not empty:

[0094] Selecting any boundary edge in the queue to obtain the corresponding adjacent triangle T;

[0095] Obtaining the other two edges in the adjacent triangle T, and deleting the adjacent triangle T in the set of adjacent triangles of the two edges;

[0096] Adding the new boundary edge formed by the two obtained edges to the queue, which has a length greater than the length threshold;

[0097] Marking the boundary edge E as invalid, and marking it as invalid if the two obtained edges become degenerate edges;

[0098] Obtaining all outermost triangles in the triangle facet set, and comparing them with the minimum angle threshold to delete the outermost triangles smaller than the minimum angle threshold;

[0099] After the queue loop ends, all valid boundary edges are collected to form an edge list output, which constitutes the concave hull shape.

[0100] In this embodiment, the maximum outer contour of the convex hull based on the drilling points cannot meet the real stratum surface, so it is necessary to reconstruct the concave hull of the convex hull, and the concave hull reconstruction of the convex hull is essentially a subset process of the Delaunay triangulation network, as shown in Figure 10 .

[0101] The process of concave hull reconstruction on convex hull is called Alpha shape reconstruction. Alpha shape is actually a convex hull with an additional parameter α. Because of this α, the alpha shape reconstruction process may not connect the vertices that are too far apart, unlike the convex hull. If α tends to infinity, the alpha shape will be very close to the convex hull. If α is small, the alpha shape will be concave at certain positions to better fit the shape of the point set. Selecting a reasonable α can control the shape generated to better fit the shape described by the point set. In this method, the value of α is determined by the length of the longest side of the triangle after the convex hull is divided and the minimum angle of the triangle.

[0102] The idea is summarized as follows: input the point set S, length threshold R, and minimum angle T to find the edge list of the convex hull. The process is as follows:

[0103] 1. Find the Delaunay triangular mesh M (a set of triangular facets based on vertices) for the point set S (discrete points after drilling interpolation). The triangular mesh is represented in the standard Mesh (three vertices) form.

[0104] 2. Initialize all Edge (any two points form an Edge) objects for M and find the length of the Edge and the set of adjacent triangles. The edges adjacent to two triangles are internal edges, the edges adjacent to one triangle are boundary edges, and the edges adjacent to zero triangles are degenerate edges in the calculation process.

[0105] 3. Add all boundary edges with a length greater than R to the queue, and loop the following process when the queue is not empty:

[0106] 1. Take an edge E from the queue and get the unique adjacent triangle T of E.

[0107] 2. Find the other two edges E1 and E2 in T and remove their adjacent triangle sets from T.

[0108] 3. Add the newly formed boundary edges of E1 and E2 with a length greater than R to the queue.

[0109] 4. Mark E as invalid, and also mark E1 and E2 as invalid if they are degenerate.

[0110] 5. Based on the longest side of the triangle after the division, get all the outermost triangles (triangles containing one boundary edge) and calculate the minimum angle of the triangle. Compare it with the minimum angle T to remove the triangles that do not meet the outermost triangle.

[0111] 4. Collect all valid boundary edges to form an edge list and output, as shown in Figure 11 .

[0112] S3: rendering the single-layer mesh grid according to the soil composition corresponding to the soil layer passed through by the drilling point;

[0113] Specifically, each triangle in the concave hull shape is subjected to material coloring processing according to the soil composition corresponding to the soil layer passed through by the drilling point.

[0114] The soil composition corresponding to the soil layer passed through by different drilling holes is not completely the same, and in the reconstruction of the three-dimensional model of the soil layer, the related soil needs to be subjected to material coloring processing to represent the soil layer type (filling soil, silty clay, etc.) of the soil layer.

[0115] In the coloring processing process, the corresponding soil composition is obtained according to each discrete point surrounding the triangle, the soil composition with the highest frequency is taken as the soil composition corresponding to the triangle, and corresponding coloring processing is performed; if the discrete point is an interpolation point, the soil compositions of the drilling points corresponding to the interpolation point are taken as the soil composition of the interpolation point as a whole.

[0116] In this embodiment, the triangular facet set obtained after the drilling and the concave hull reconstruction corresponds to the soil layer drilling data in the database one by one, and all triangles are grouped based on the soil layer name corresponding to the drilling. For example, if a triangle is composed of drilling hole A (filling soil), drilling hole B (clay), and interpolation point C (interpolated from clay and silty clay drilling holes), the triangular facet belongs to the (A filling soil*2, B clay*2, C clay + silty clay) group, and the soil composition with the highest frequency is taken as the soil composition corresponding to the triangle. The clay = 3, the filling soil = 2, and the silty clay = 1, so the triangular facet belongs to the clay.

[0117] Based on the principle of common edges of triangular edges, the triangles are grouped and processed. As shown in Figure 12 .

[0118] S4: generating upper and lower mesh grids according to the soil layer thickness corresponding to the soil layer passed through by the drilling point;

[0119] S5: constructing the outer edge contour of the soil layer to finally obtain the three-dimensional model of the soil layer.

[0120] The process of constructing the outer edge contour of the soil layer is as follows:

[0121] Taking all non-common edges of the triangular edges in the upper and lower mesh grids as the outer envelope of the triangular set, the outer edge contour of the corresponding soil layer is generated based on the outer envelope.

[0122] In this embodiment, based on the principle of common edges of triangular edges, all non-common edges of the triangular edges are taken as the outer envelope of the triangular set, and the outer edge contour of the corresponding soil layer is generated based on the outer envelope. Finally, the three-dimensional model of the soil layer is obtained. Each layer of soil passed through by the drilling hole corresponds to a soil layer serial number in the database, and the soil layer is grouped according to the soil layer serial number, and the soil layer is generated in the order from top to bottom; the final result is as followsFigure 13 As shown.

[0123] The above is an introduction to the method embodiments. The following describes the present invention further through device embodiments.

[0124] This embodiment also provides a three-dimensional geological BIM modeling device based on exploration data, including:

[0125] Data acquisition module; used to acquire borehole data for engineering exploration and to perform interpolation processing on the borehole coordinate data in the borehole data;

[0126] Single-layer Mesh construction module; used to take the obtained borehole points and interpolation points as discrete points, calculate the convex hull profile of all discrete points, triangulate the convex hull profile, and then reconstruct the concave hull shape to obtain the single-layer Mesh grid of the soil layer.

[0127] The 3D reconstruction module is used to render a single-layer mesh based on the soil composition corresponding to the soil layer through which the borehole point passes, and to generate two layers of mesh based on the soil layer thickness corresponding to the soil layer through which the borehole point passes, to construct the outer contour of the soil layer, and finally obtain a 3D model of the soil layer.

[0128] It should be noted that the specific details and beneficial effects of the device in this application can be found in the above-described method embodiments, and will not be repeated here.

[0129] The present invention also provides a computer-readable storage medium storing a computer program that can be used to execute the above-described... Figure 1 This paper presents a three-dimensional geological BIM modeling method based on exploration data.

[0130] The present invention also provides Figure 14 One of the corresponding Figure 1 A schematic diagram of a 3D geological BIM modeling device based on exploration data. (See diagram for example.) Figure 2 At the hardware level, the 3D geological BIM modeling device based on exploration data includes a processor, internal bus, network interface, memory, and non-volatile storage, and may also include other hardware required for business operations. The processor reads the corresponding computer program from the non-volatile storage into memory and then runs it to achieve the above-mentioned functions. Figure 1 The method described herein. Of course, in addition to software implementation, this invention does not exclude other implementation methods, such as logic devices or a combination of hardware and software, etc. That is to say, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0131] For a technical improvement, it can be obvious whether the improvement is in hardware (e.g., improvement of circuit structures of diodes, transistors, switches, etc.) or in software (e.g., improvement of method flow). However, with the development of technology, many improvements of method flow today can be considered as direct improvements of hardware circuit structures. Designers almost always obtain the corresponding hardware circuit structures by programming the improved method flow into hardware circuits. Therefore, it cannot be said that an improvement of method flow cannot be implemented by hardware entity modules. For example, a programmable logic device (PLD) (e.g., a field programmable gate array (FPGA)) is an integrated circuit whose logic function is determined by user programming of the device. A designer programs a digital system "integrated" on a PLD by himself / herself, without having to ask a chip manufacturer to design and manufacture a special integrated circuit chip. Moreover, instead of manually manufacturing an integrated circuit chip, such programming is now mostly implemented by "logic compiler" software, which is similar to a software compiler used when developing programs, and the original code before compilation also needs to be written in a specific programming language, which is called a hardware description language (HDL), and there are many types of HDL, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc., and the most commonly used are VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog. It should be clear to those skilled in the art that only a little logical programming of the method flow in the above-mentioned hardware description languages and programming into an integrated circuit can easily obtain a hardware circuit that implements the logical method flow.

[0132] The controller can be implemented in any suitable way, for example, the controller can take the form of a microprocessor or processor and a computer readable medium storing computer readable program code, such as software or firmware, executable by the (micro)processor, logic gates, switches, an application specific integrated circuit (ASIC), a programmable logic controller and an embedded microcontroller, examples of which include but are not limited to the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320, the memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art will also know that, in addition to being implemented in pure computer readable program code, the controller can equally well be implemented to perform the same functions using logic gates, switches, an application specific integrated circuit, a programmable logic controller and an embedded microcontroller, etc. by means of a logical programming of the method steps. The controller can thus be considered as a hardware component, and the means comprised therein for performing the various functions can be considered as structures within the hardware component. Alternatively, the means for performing the various functions can even be considered as both a software module implementing the method and a structure within the hardware component.

[0133] The systems, apparatuses, modules or units illustrated by the above embodiments can be implemented by computer chips or entities, or products with certain functions. A typical implementation device is a computer. Specifically, the computer can be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0134] For the sake of description, the above apparatuses are described in various units with functions respectively. Of course, the functions of the units can be implemented in one or more software and / or hardware in the implementation of the present application.

[0135] Those skilled in the art will appreciate that embodiments of the present application can be provided as a method, a system, or a computer program product. Accordingly, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application can take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROMs, optical storage devices, etc.) embodying computer readable program code.

[0136] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof.

[0137] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof.

[0138] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof. ​ one or more flowcharts and / or blocks in the flowcharts and / or combination thereof.

[0139] In one typical configuration, the computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0140] The memory can include non-persistent memory and / or volatile memory, such as random access memory (RAM) and / or cache memory, non-volatile memory, such as read-only memory (ROM), EPROM, and / or flash memory. The memory is an example of computer-readable media.

[0141] Computer-readable media includes permanent and non-permanent, movable and non-movable media that can be implemented by any method or technology to store information. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible to a computing device. According to the definition herein, computer-readable media does not include transitory media such as modulated data signals and carriers.

[0142] It should also be noted that the terms "comprising", "comprising" or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or apparatus that includes a list of elements not only includes those elements, but also includes other elements not explicitly listed or inherent to such process, method, article or apparatus. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0143] Those skilled in the art will appreciate that embodiments of the present application can be provided as a method, system or computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0144] The present application can be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types. The present application can also be practiced in a distributed computing environment where tasks are performed by remote processing devices that are connected through a communication network. In a distributed computing environment, program modules can be located in both local and remote computer storage media including storage devices.

[0145] The various embodiments of the present application are described in a progressive manner, and the same or similar parts among the various embodiments can be mutually referred to. Each embodiment focuses on the difference from other embodiments. In particular, the system embodiments are described in a relatively simple manner because they are substantially similar to the method embodiments, and the relevant parts can be referred to the description of the method embodiments.

[0146] The preferred embodiments of the present application have been described in detail. It should be understood that modifications and variations can be made by those of ordinary skill in the art without departing from the spirit and scope of the application. Therefore, the technical solutions obtained by logical analysis, reasoning or limited experiments based on the concept of the present application and the prior art should be within the protection scope defined by the claims.

Claims

1. A method for 3D geological BIM modeling based on exploration data, characterized in that, The method comprises the following steps: obtaining drilling data of engineering exploration, performing interpolation processing on drilling coordinate data in the drilling data, taking the obtained drilling points and interpolation points as discrete points, calculating a convex hull contour of all the discrete points, performing triangulation on the convex hull contour, and then reconstructing a concave hull shape to obtain a single-layer grid of the soil layer; rendering the single-layer grid according to soil components corresponding to soil layers through which the drilling points pass, generating upper and lower two-layer grids according to soil layer thicknesses corresponding to the soil layers through which the drilling points pass, constructing an outer edge contour of the soil layer, and finally obtaining a three-dimensional model of the soil layer; the interpolation processing process comprises: obtaining drilling points according to drilling coordinate data in the drilling data, scanning adjacent drilling points for each drilling point at a preset radius value, inserting interpolation points between each two adjacent drilling points, and meanwhile removing other interpolation points within a preset included angle range of a connecting line vector of the two drilling points; and not generating an interpolation point when a distance between the generated interpolation point and the drilling point is lower than a specific value; the process of reconstructing the concave hull shape comprises: setting a length threshold value and a minimum angle threshold value, obtaining a triangular facet set obtained after triangulation, in the triangular facet set, taking an edge adjacent to two triangles as an internal edge, taking an edge adjacent to one triangle as a boundary edge, and taking an edge adjacent to no triangle as a degenerate edge; adding all boundary edges with lengths greater than the length threshold value to a queue, and when the queue is not empty, repeatedly performing the following process: selecting any boundary edge in the queue to obtain corresponding adjacent triangles; obtaining the other two edges in the adjacent triangles, and deleting the adjacent triangles in the adjacent triangle set of the two edges; adding a new boundary edge formed by the obtained two edges to the queue, the new boundary edge having a length greater than the length threshold value; marking the boundary edge as invalid, and marking the two edges as invalid if the two edges become degenerate edges; obtaining all outermost triangles in the triangular facet set, comparing the outermost triangles with the minimum angle threshold value, and deleting the outermost triangles smaller than the minimum angle threshold value; after the queue is repeatedly performed, collecting all valid boundary edges to form an edge list output and construct a concave hull shape; rendering the single-layer grid according to soil components corresponding to soil layers through which the drilling points pass, specifically, performing material coloring processing on each triangle in the concave hull shape according to the soil components corresponding to the soil layers through which the drilling points pass; in the coloring processing, obtaining corresponding soil components according to each discrete point surrounding the triangle, taking the soil component with the highest frequency as the soil component corresponding to the triangle, and then performing corresponding coloring processing; if the discrete point is an interpolation point, the soil components of the interpolation point are obtained by integrating the soil components of all drilling points surrounding the interpolation point. the process of constructing the outer edge contour of the soil layer comprises: taking all triangle edges not sharing sides in the upper and lower two-layer grids as an outer envelope of a triangular set, and generating an outer edge contour of a corresponding soil layer based on the outer envelope.

2. The method of claim 1, wherein, the calculation process of the convex hull contour comprises: selecting a starting point from the discrete points, determining the direction of the points surrounding the convex hull through a cross product angle, and finally constructing a convex hull contour.

3. The method of claim 1, wherein, the specific process of performing triangulation on the convex hull contour comprises: Triangulation is performed on the discrete points on the convex hull contour, and the following characteristics are met during triangulation: The triangle meets the empty circle characteristic: the circumcircle of each triangle does not contain any other points in the plane; The maximum minimum angle characteristic: the minimum angle of the six inner angles of the convex quadrilateral formed by each two adjacent triangles does not increase after mutual exchange.

4. A device for 3D geological BIM modeling based on exploration data, characterized in that, Comprise: Data acquisition module; for acquiring drilling data of engineering exploration, interpolating drilling coordinate data in the drilling data; Single-layer grid construction module; for taking the obtained drilling points and interpolation points as discrete points, calculating the convex hull contour of all discrete points, triangulating the convex hull contour, and then reconstructing the concave hull shape to obtain the single-layer grid of the soil layer; Three-dimensional reconstruction module; for rendering the single-layer grid according to the soil composition corresponding to the soil layer through which the drilling point passes, generating upper and lower two-layer grids according to the soil layer thickness corresponding to the soil layer through which the drilling point passes, constructing the outer edge contour of the soil layer, and finally obtaining the three-dimensional model of the soil layer; The interpolation process includes: According to the drilling coordinate data in the drilling data, the drilling points are obtained, and each drilling point is scanned to obtain adjacent drilling points with a preset radius value. The interpolation points between each two adjacent drilling points are inserted, and other interpolation points within the preset angle range of the connecting line vector of the two drilling points are removed. If the distance between the generated interpolation point and the drilling point is less than a certain value, the interpolation point is not generated; The process of reconstructing the concave hull shape includes: Set the length threshold and the minimum angle threshold; obtain the triangle facet set obtained after triangulation, and in the triangle facet set, the edges adjacent to 2 triangles are taken as internal edges, the edges adjacent to 1 triangle are taken as boundary edges, and the edges adjacent to 0 triangle are taken as degenerate edges; Add all boundary edges with a length greater than the length threshold to the queue, and when the queue is not empty, loop the following process: Select any boundary edge in the queue to obtain the corresponding adjacent triangle; Obtain the other two edges in the adjacent triangle, and delete the adjacent triangle in the adjacent triangle set of the two edges; Add the new boundary edge formed by the two edges to the queue, which has a length greater than the length threshold; Mark the boundary edge as invalid, and if the two edges obtained become degenerate edges, mark them as invalid; Obtain all outermost triangles in the triangle facet set, and compare them with the minimum angle threshold to delete the outermost triangles less than the minimum angle threshold; After the queue loop ends, collect all valid boundary edges to form an edge list output and construct the concave hull shape; According to the soil composition corresponding to the soil layer through which the drilling point passes, the single-layer grid is rendered, specifically: according to the soil composition corresponding to the soil layer through which the drilling point passes, the material coloring processing is performed on each triangle in the concave hull shape; During the coloring processing, the soil composition corresponding to each discrete point surrounding the triangle is obtained, the soil composition with the highest frequency is taken as the soil composition corresponding to the triangle, and the corresponding coloring processing is performed; wherein, if the discrete point is an interpolation point, the soil composition of each drilling point forming the interpolation point is taken as the soil composition of the interpolation point as a whole; The process of constructing the outer edge contour of the soil layer is specifically: Taking the upper and lower two layers of the grid, all the triangle edges that are not common edges are taken as the outer envelope of the triangle set, and the outer edge contour of the corresponding soil layer is generated based on the outer envelope.

5. A device for 3D geological BIM modeling based on exploration data, characterized in that, The device comprises a memory and one or more processors, the memory stores executable code, and the one or more processors execute the executable code to implement the three-dimensional geological BIM modeling method based on exploration data in any one of claims 1-3.

6. A computer readable storage medium characterized by, A program is stored thereon, and the program is executed by a processor to implement the three-dimensional geological BIM modeling method based on exploration data in any one of claims 1-3.

Images