Three-dimensional geologic model subdivision method based on earth space grid structure

Abstract

The invention discloses a three-dimensional geologic model subdivision method based on an earth space grid structure, which adopts a plurality of types of earth space grid structures including longitude and latitude grids, octahedral projection grids and Hilbert curve filling grids to carry out three-dimensional division on the earth surface, and combines a layered recursive grid division technology to obtain a three-dimensional geologic model. Multi-level grid unit generation and geometric mapping from coarse resolution to high resolution are achieved, grid parameters are dynamically adjusted according to geologic features, large-size grids are adopted in a simple area to improve efficiency, small-size grids are adopted in a complex area to capture details, redundant units are eliminated in combination with a grid optimization algorithm, and the efficiency is improved. The accuracy and the calculation efficiency of the model are improved; a global unique identifier is generated through a GeoSOT-3D hierarchical recursion technology, union set, intersection and difference set operations of grid units are completed in combination with efficient Boolean operation, and the integrity and topological consistency of geologic model subdivision are ensured.

Description

Technical Field

[0001] The invention relates to the technical field of three-dimensional geological modeling, and in particular to a three-dimensional geological model segmentation method based on the earth space grid structure. Background Art

[0002] Three-dimensional geological modeling is an important technical means in the fields of mineral resource exploration, oil and gas reservoir modeling, geological disaster monitoring, etc. Its core lies in constructing the spatial expression and analysis framework of geological models. When faced with complex geological features and large-scale data, traditional geological model segmentation methods gradually expose significant technical limitations, which are specifically manifested in the following two aspects:

[0003] On the one hand, the traditional 3D geological model segmentation mainly adopts regular grid or irregular triangular grid. This method performs well in the modeling of simple geological areas, but when dealing with complex geological features, such as faults, folds, and ore body boundaries, the segmentation accuracy and adaptability are insufficient, which leads to the waste of resources by using too high density grids in simple geological areas, and in complex geological areas, the insufficient grid density leads to inaccurate expression of details;

[0004] On the other hand, with the rapid growth of the data scale of three-dimensional geological models, the number of grid cells after segmentation has increased dramatically, which has put forward higher requirements for data storage and management. Traditional methods usually lack effective encoding rules and data compression strategies. Directly storing the grid cell data after segmentation not only occupies a large amount of storage resources, but also leads to inefficient data retrieval.

[0005] Based on this, a three-dimensional geological model segmentation method based on the earth's spatial grid structure is needed. Summary of the invention

[0006] To achieve the above object, the present invention provides the following solution: a three-dimensional geological model segmentation method based on the earth space grid structure, comprising the following steps:

[0007] Step S1, using a geospatial grid structure to divide the earth's surface into three dimensions, wherein the geospatial grid structure includes a longitude and latitude grid, an octahedral projection grid or a Hilbert curve filling grid;

[0008] Step S2: Based on the hierarchical recursive grid division technology, the three-dimensional space is divided into multiple grid units according to different resolutions, and the geometric vertices of the geological model are matched with the grid units in combination with the geometric mapping technology to complete the grid division of the geological model;

[0009] Step S3, dynamically adjusting grid parameters according to geological characteristics, optimizing grid size, density and direction, increasing grid density in areas with complex geological characteristics, and improving computational efficiency by removing redundant grid cells and merging adjacent cells;

[0010] Step S4, using an efficient Boolean operation algorithm to perform a union, intersection or difference operation based on the spatial relationship between the grid cells to generate a complete segmentation model;

[0011] Step S5: design data structure and encoding rules, generate a unique identifier for each grid unit, and support real-time access and optimized storage of segmentation results through a fast decoding algorithm.

[0012] Further preferably, the earth space grid structure is generated by a dynamic combination of a longitude and latitude grid, an octahedral projection grid and a Hilbert curve filling grid. The longitude and latitude grid forms regular rectangular units by evenly dividing longitude and latitude lines, and is suitable for the preliminary division of macroscopic geological features. The octahedral projection grid maps the earth's surface to an octahedron and then subdivides it step by step into triangular units. The Hilbert curve filling grid uses recursion to generate a compact space filling curve. The grid types are dynamically switched or used in combination in the application.

[0013] Further preferably, the hierarchical recursive grid division technology generates multi-level grid units from coarse resolution to high resolution by gradually refining the three-dimensional space, and combines the geometric mapping technology to match the vertex data of the geological model with the spatial position of the grid unit.

[0014] Further preferably, the density of grid cells is dynamically adjusted through an adaptive density algorithm, larger-sized cells are used in simple geological areas to improve computational efficiency, small-sized cells are used in complex geological areas to capture details, a grid optimization algorithm is used to eliminate redundant cells, and the grid structure is optimized through boundary merging technology.

[0015] Further preferably, the Boolean operation algorithm uses a hierarchical grid coding strategy to assign a globally unique identifier to each unit, calculates the spatial relationship of the grid units through an intersection detection algorithm, implements union, intersection and difference operations, and reduces redundant calculations through an optimization algorithm.

[0016] Further preferably, the encoding and decoding algorithm of the three-dimensional geological data unit body generates a unique identifier based on the GeoSOT-3D hierarchical recursive technology, and ensures the matching of the coding length and resolution by designing a high-precision encoding and decoding strategy. The decoding process uses a fast decoding algorithm to parse the spatial coordinates of the grid unit, and optimizes the data structure by eliminating redundant information.

[0017] Further preferably, the encoding and decoding algorithm and data structure further protect the data encoding strategy, which dynamically generates a globally unique identifier for a grid unit based on the resolution and hierarchical division rules of the three-dimensional geological model. The encoding length gradually increases with the resolution, and the decoding algorithm supports multi-level fast parsing, and realizes real-time parsing and calling of large-scale grid units through parallel decoding technology.

[0018] Further preferably, the method combines data compression and block storage technology, adopts a layered compression algorithm in the grid unit encoding to eliminate redundant data, and a block storage strategy decomposes the geological model data into independently accessed sub-blocks, and combines a recursive compression method to optimize the storage performance of low-frequency use units.

[0019] According to the specific embodiments provided by the present invention, the present invention discloses the following technical effects:

[0020] 1. The present invention dynamically selects or uses in combination the longitude and latitude grid, the octahedral projection grid and the Hilbert curve filling grid according to the specific scenario. The longitude and latitude grid is suitable for the preliminary division of large-scale features, the octahedral projection grid enhances the continuity of the regional boundaries, and the Hilbert curve filling grid is used for high-density subdivision of complex areas, thereby improving flexibility and accuracy.

[0021] 2. The present invention gradually refines the three-dimensional space through hierarchical recursive grid division technology, dynamically adjusts the grid unit density and resolution, uses large-size grids in simple areas to reduce the amount of calculation, uses small-size grids in complex areas to capture details, and combines dynamic adjustment algorithms to optimize grid parameters to improve the adaptability and accuracy of the segmentation results.

[0022] 3. The present invention utilizes GeoSOT-3D hierarchical recursive technology to generate a globally unique identifier, combines a high-precision encoding and decoding strategy to dynamically adjust the encoding length, uses a fast decoding algorithm to achieve real-time analysis of grid cells, eliminates redundant data through a hierarchical compression algorithm, improves retrieval efficiency through block storage, and optimizes the storage performance of low-frequency data; a unique identifier is assigned to the grid cell through a hierarchical grid encoding strategy, and the spatial relationship of the grid cell is calculated in combination with an intersection detection algorithm, supports union, intersection and difference operations, and optimizes the algorithm to reduce redundant calculations and improve spatial computing efficiency, which is suitable for real-time model processing in complex scenes. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0024] Figure 1 It is a flow chart of the steps of the present invention. DETAILED DESCRIPTION

[0025] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0026] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0027] Example

[0028] like Figure 1 As shown, a three-dimensional geological model segmentation method based on the earth space grid structure in this embodiment includes the following steps:

[0029] In step S1, the earth's surface is divided into three dimensions using the earth's spatial grid structure.

[0030] In this embodiment, the earth space grid structure adopts the form of longitude and latitude grid, octahedron projection grid or Hilbert curve filling grid to accurately divide and organize the earth's surface to meet different geological characteristics and subdivision requirements. Among them, the longitude and latitude grid generates regular rectangular grid units by evenly dividing the longitude and latitude lines of the earth, which is suitable for the preliminary division of large-scale geological features and provides a reliable basis for subsequent subdivision. The octahedron projection grid projects the earth's surface onto an octahedron and then subdivides it step by step into triangular grid units, which can effectively enhance the continuity and geometric expression ability of regional boundaries. It is particularly suitable for processing the spatial expression of large-area geological structures. The Hilbert curve filling grid uses recursion to generate compact space filling curves, which can perform high-density fine division of complex geological feature areas and improve the accuracy of subdivision and data organization efficiency.

[0031] In step S2, based on the hierarchical recursive grid division technology, the three-dimensional space is divided into a plurality of grid units according to different resolutions;

[0032] In this embodiment, the hierarchical recursive grid division technology refines the three-dimensional space step by step and divides it into multiple grid units with adjustable resolution to meet the model expression requirements of different geological characteristics and accuracy requirements;

[0033] Specifically, when processing the three-dimensional geological model, the geological model data is first loaded, and the input raw data is standardized, including the removal of abnormal data, coordinate system unification and format normalization. Subsequently, based on the hierarchical recursive algorithm, the space is divided step by step according to the logic from coarse resolution to high resolution, and a multi-level grid unit structure is generated, thereby forming a multi-level precision segmentation framework; the hierarchical recursive method dynamically adjusts the grid resolution according to the model requirements, and realizes the flexible transformation from macroscopic global segmentation to microscopic local segmentation; at the same time, the vertex coordinates of the geological model are accurately matched with the spatial position of the grid unit in combination with the geometric mapping technology, so that the segmented grid unit can accurately reflect the geometric characteristics and topological relationship of the geological model.

[0034] Step S3: dynamically adjusting grid parameters according to geological characteristics;

[0035] In this embodiment, after the preliminary segmentation of the three-dimensional space is completed, the grid parameters are dynamically adjusted according to the characteristics of the geological model to optimize the grid's expressiveness and computational efficiency. In areas with simple geological features, larger-sized grid units are used for coarse-grained segmentation to reduce computational costs and improve processing efficiency. In areas with complex geological features, such as faults, folds, or ore body boundaries, small-sized grid units are used to capture more details and enhance the accuracy and expressiveness of the model. The dynamic adjustment of the grid density is achieved by an adaptive density algorithm, which automatically adjusts the density distribution of the grid units according to the spatial variation law of the geological model, and increases the number of grid units in key areas to enhance the expressiveness of geological features.

[0036] In step S4, an efficient Boolean operation algorithm is used;

[0037] In this embodiment, an efficient Boolean operation algorithm is used to perform spatial operations on the subdivided grid cells to achieve accurate construction and operation of complex geological models. The Boolean operation algorithm is used to perform spatial operations such as union, intersection and difference on the grid cells to regenerate a model structure that meets geometric and topological requirements.

[0038] Specifically, a hierarchical grid coding strategy is used to assign a globally unique identifier to each grid cell, and a hierarchical recursive coding technique is used to ensure that the identification of the grid cells is hierarchical and unique. Then, the spatial relationship between the grid cells is calculated through an intersection detection algorithm, and the overlapping areas and boundary intersections are accurately identified. The union operation is used to merge adjacent grid cells, the intersection operation is used to extract the intersection area, and the difference operation is used to generate spatial cells of specific difference areas.

[0039] Step S5: Design data structure and encoding rules;

[0040] In this embodiment, a coding rule based on GeoSOT-3D hierarchical recursive technology is adopted to generate a globally unique identifier for each grid unit. The identifier is recursively generated according to the hierarchical division and spatial position of the grid unit to ensure that the identifier is hierarchical, consistent and unique. Secondly, a high-precision encoding and decoding strategy is used to ensure the matching relationship between the code length and the resolution. The code length gradually increases with the improvement of the resolution, supporting the flexible adjustment of multi-level resolutions.

[0041] Code generation: Based on GeoSOT-3D hierarchical recursive technology, a globally unique identifier is generated for each grid unit. This identifier is generated through recursive division to ensure the uniqueness and hierarchy of the grid unit in the global scope, and accurately express the three-dimensional spatial position and hierarchical relationship of each grid unit. Specifically, the generation logic of the identifier is closely combined with the resolution and position of the grid unit. Through hierarchical recursion, the three-dimensional geological space is gradually refined into grid units of different levels, and each level of grid is assigned a unique code to achieve global unification of hierarchical coding.

[0042] Coding strategy: In the design of coding strategy, a high-precision encoding and decoding strategy is adopted to ensure a reasonable match between the coding length and the grid resolution. The coding length gradually increases with the resolution, that is, a shorter code is used to represent a larger grid unit at low resolution, and the coding length is extended to accurately describe the small grid unit at high resolution. The dynamic adjustment method of increasing the level by level can not only meet the needs of high-resolution models for detail expression, but also reduce the waste of storage and computing resources at low resolution.

[0043] Decoding implementation: During the decoding process, a fast decoding algorithm is used to parse the spatial coordinates of the grid cells. By parsing the hierarchical recursive coding, the specific position and hierarchical relationship of the grid cells in the three-dimensional space are restored, and accurate access to the segmentation results is achieved;

[0044] Data compression: In order to reduce the pressure of data storage, the grid unit data is effectively optimized by combining data compression technology. Through the layered compression algorithm, redundant information and duplicate data are eliminated while ensuring data integrity, thus reducing the storage space occupied by the model data;

[0045] Storage optimization: A recursive compression method is designed for grid unit codes that are used infrequently. By analyzing the frequency of data use, the grid unit codes that are used infrequently are stored in layers and merged, which compresses the storage space while reducing interference with high-frequency operations.

[0046] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0047] The principles and implementation methods of the present invention are described in this article using specific examples. The description of the above embodiments is only used to help understand the method and core idea of ​​the present invention. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting the present invention.

Claims

1. A three-dimensional geological model segmentation method based on the earth space grid structure, characterized in that: The following steps are involved: Step S1, using a geospatial grid structure to divide the earth's surface into three dimensions, wherein the geospatial grid structure includes a longitude and latitude grid, an octahedral projection grid or a Hilbert curve filling grid; Step S2: Based on the hierarchical recursive grid division technology, the three-dimensional space is divided into multiple grid units according to different resolutions, and the geometric vertices of the geological model are matched with the grid units in combination with the geometric mapping technology to complete the grid division of the geological model; Step S3, dynamically adjusting grid parameters according to geological characteristics, optimizing grid size, density and direction, increasing grid density in areas with complex geological characteristics, and improving computational efficiency by removing redundant grid cells and merging adjacent cells; Step S4, using an efficient Boolean operation algorithm to perform a union, intersection or difference operation based on the spatial relationship between the grid cells to generate a complete segmentation model; Step S5: design data structure and encoding rules, generate a unique identifier for each grid unit, and support real-time access and optimized storage of segmentation results through a fast decoding algorithm.

2. A three-dimensional geological model segmentation method based on the earth space grid structure according to claim 1, characterized in that: The earth space grid structure is generated by a dynamic combination of longitude and latitude grids, octahedral projection grids and Hilbert curve filling grids. The longitude and latitude grids form regular rectangular units by evenly dividing longitude and latitude lines. The octahedral projection grid maps the earth's surface to an octahedron and then subdivides it step by step into triangular units. The Hilbert curve filling grid uses recursion to generate a compact space filling curve. The grid types are dynamically switched or used in combination in the application.

3. The method for dividing a three-dimensional geological model based on an earth space grid structure according to claim 1, characterized in that: The hierarchical recursive grid division technology generates multi-level grid units from coarse resolution to high resolution by gradually refining the three-dimensional space, and combines the geometric mapping technology to match the vertex data of the geological model with the spatial position of the grid unit.

4. A three-dimensional geological model segmentation method based on the earth space grid structure according to claim 1, characterized in that: The grid cell density is dynamically adjusted through an adaptive density algorithm. Larger cells are used in simple geological areas to improve computational efficiency, while small cells are used in complex geological areas to capture details. The grid optimization algorithm is used to eliminate redundant cells, and the grid structure is optimized through boundary merging technology.

5. The method for dividing a three-dimensional geological model based on an earth space grid structure according to claim 1, characterized in that: The Boolean operation algorithm uses a hierarchical grid coding strategy to assign a globally unique identifier to each unit, calculates the spatial relationship of grid units through an intersection detection algorithm, implements union, intersection and difference operations, and reduces redundant calculations through an optimization algorithm.

6. The method for dividing a three-dimensional geological model based on an earth space grid structure according to claim 1, characterized in that: The encoding and decoding algorithm of the three-dimensional geological data unit body generates a unique identifier based on the GeoSOT-3D hierarchical recursive technology. By designing a high-precision encoding and decoding strategy, the matching of the encoding length and the resolution is ensured. The decoding process uses a fast decoding algorithm to parse the spatial coordinates of the grid unit, and optimizes the data structure by eliminating redundant information.

7. A three-dimensional geological model segmentation method based on the earth space grid structure according to claim 6, characterized in that: The encoding and decoding algorithm and data structure further protect the data encoding strategy. The data encoding strategy dynamically generates a globally unique identifier for a grid unit based on the resolution and hierarchical division rules of the three-dimensional geological model. The encoding length gradually increases with the resolution. The decoding algorithm supports multi-level fast parsing and realizes real-time parsing and calling of large-scale grid units through parallel decoding technology.

8. A three-dimensional geological model segmentation method based on the earth space grid structure according to claim 7, characterized in that: The method combines data compression and block storage technology, adopts a hierarchical compression algorithm to eliminate redundant data in grid unit coding, decomposes geological model data into independently accessed sub-blocks by a block storage strategy, and optimizes the storage performance of low-frequency used units by combining a recursive compression method.

Images