CN112687008B - Method for automatically calculating hydrocarbon-bearing area based on geological structure scatter data - Google Patents
Method for automatically calculating hydrocarbon-bearing area based on geological structure scatter data Download PDFInfo
- Publication number
- CN112687008B CN112687008B CN202011592388.0A CN202011592388A CN112687008B CN 112687008 B CN112687008 B CN 112687008B CN 202011592388 A CN202011592388 A CN 202011592388A CN 112687008 B CN112687008 B CN 112687008B
- Authority
- CN
- China
- Prior art keywords
- grid
- points
- hydrocarbon
- distance
- vertex
- 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.)
- Active
Links
Images
Landscapes
- Image Generation (AREA)
- Investigation Of Foundation Soil And Reinforcement Of Foundation Soil By Compacting Or Drainage (AREA)
Abstract
The invention provides a method for automatically calculating hydrocarbon-containing area based on geological structure scatter data, which comprises the following steps: thinning and scattering points; solving a scatter point outer wrapping rectangle as a constructed isoline mesh boundary; the vertical and horizontal distances of the grids are obtained; solving an intersection point set of the contour line after rarefaction and each grid line; sequentially calculating the vertex values of the cells where the intersection points are located; all cell vertexes are used as sample points, and the cell vertexes are assigned to obtain a constructed isoline grid; tracking the position of the depth plane of the top point of the unit grid in the obtained structural grid to obtain a hydrocarbon-containing area; recovering a construction grid according to construction scatter data, and defining a hydrocarbon-containing area range by combining fluid interface depth; the precision and the efficiency of the oil field reserves estimation research are improved.
Description
Technical Field
The invention belongs to the technical field of oilfield exploration and development, and particularly relates to a method for automatically calculating a hydrocarbon-containing area based on geological structure scatter data.
Background
At various stages of exploration and development in an oil field, a structure is the most basic and important research object of exploration and development research. The most common means of expressing the spatial morphology of a construct is the contour. In general, the spatial morphology of the construction is represented by a discrete rectangular grid (a contour grid), the contours being the result of the rectangular grid striping expression.
During exploration and development, the constructed contour grid is often not directly available for various reasons and constraints, and the construction scatter is more readily available. However, constructing scatter by itself is not satisfactory for applications in the middle and later stages of exploration and development. If necessary, the fluid interface is developed based on the structure (the boundary plane shape of the fluid interface and the structure shape must be consistent). This requires that the constructed isoline network be obtained in reverse from the constructed scatter data. At present, a contour grid is constructed according to scatter data and is obtained by various interpolation algorithms, however, the contour is used as a sample point for interpolation and then is restored, and the contour cannot be completely restored.
The invention takes fluid interface research as an example to explain a method for restoring a constructed isoline grid based on constructed scatter data.
Disclosure of Invention
The invention aims to provide a method for automatically calculating a hydrocarbon-containing area based on geological structure scatter data so as to solve the problem of calculating the hydrocarbon-containing area in the exploration and development of an oil field.
In order to achieve the purpose, the specific technical scheme of the method for automatically determining the hydrocarbon-containing area based on the geological structure scatter point data is as follows:
a method for automatically solving hydrocarbon-containing area based on geological structure scatter data comprises the following steps:
the first step is as follows: performing thinning on the original construction scattered points by using a Douglas-Puck thinning algorithm, and removing redundant points;
the second step is that: according to the scattered points after the first step of rarefaction, solving an outer wrapping rectangle of the scattered points as a boundary for constructing the isoline grid;
the third step: solving a set of all scattered point intervals, obtaining a minimum interval from the set, and taking the minimum interval as the vertical and horizontal intervals (or the grid step length) of the grid after the minimum interval is rounded;
the fourth step: based on the principle of a scanning line algorithm, solving an intersection point set of the contour line after rarefaction and each grid line;
the fifth step: based on all intersection point sets, sequentially calculating the vertex values of the cells where the intersection points are located; calculating the top left vertex of the cell by using a weighted average method, further calculating another vertex of each edge by using a linear relation according to the edges of the four cells where the top left vertex is located, and repeating the steps until the vertex values of the cells where all the intersection points are located are completed;
and a sixth step: all cell vertexes obtained in the fifth step are used as sample points, and the unassigned cell vertexes are assigned by utilizing an inverse distance interpolation algorithm to obtain a constructed contour grid;
the seventh step: and tracking the plane position of the depth in the structural grid obtained in the sixth step according to the depth of the fluid interface, thereby obtaining the hydrocarbon-containing area.
The method for automatically determining the hydrocarbon-bearing area based on the scatter data of the geological structure is characterized in that,
the first step is to utilize the existing Douglas-Peucker thinning algorithm (Douglas-Peucker algorithm) to thin the scattered points of the original structure and remove redundant points;
the second step is to obtain an outsourcing rectangle according to the scattered points after the thinning, the boundary used as the construction isoline grid is to sequentially take out the points after the thinning, the X and Y coordinates of the points are compared, and the obtained minimum X, maximum X, minimum Y and maximum Y coordinates are used as coordinate values of four sides of the outsourcing rectangle;
the fourth step is based on the principle of a scanning line algorithm, wherein the intersection point set of the contour line after thinning and each grid line is the line segment of each contour line, the horizontal and vertical grid lines in two end points of the line segment are obtained, and the intersection points of the line segment and the horizontal and vertical coordinates are quickly calculated by using a similar triangle, namely the intersection points of the grid;
and a sixth step: taking all the obtained cell vertexes as sample points, assigning the unassigned cell vertexes by using an inverse distance interpolation algorithm to obtain a constructed isoline grid, taking three sample points as an example for any cell vertex A, and obtaining the inverse distance interpolation algorithm of the vertex A assignment as follows:
setting: b1= 1/(distance a to B), C1= 1/(distance a to C), D1= 1/(distance a to D), the value Z = Z value of B × B1/(B1 + C1+ D1) + Z value of C × C1/(B1 + C1+ D1) + Z value of D × D1/(B1 + C1+ D1);
the seventh step: tracking the planar position of the depth in the resulting construction grid according to the fluid interface depth, and thereby obtaining a hydrocarbon bearing area as: extracting all grid vertexes and construction contour lines with the depth larger than the fluid interface depth from the grid, extracting lines with one side larger than the interface depth and one side smaller than the interface depth according to the depths of construction points on two sides of the contour lines, and carrying out closing treatment on the lines to obtain the hydrocarbon-containing area.
The method for automatically calculating the hydrocarbon-containing area based on the scattered point data of the geological structure has the following advantages: the method solves the hydrocarbon-containing area based on the principle of tracking the structural scatter points, and utilizes limited structural scatter point data to firstly obtain the data of the cells adjacent to the structural scatter points and then obtain all the cell data, so that the structural grid of the structural surface is reduced to the maximum extent, the structural grid can be well consistent with the trend of the contour line, and the effect of quickly determining the hydrocarbon-containing area is further realized.
Drawings
FIG. 1 is a flow chart of the method for automatically determining hydrocarbon bearing area based on geological structure scatter data.
FIG. 2 is a schematic diagram of a post-thinning scatter point using a thinning algorithm in the method for automatically determining a hydrocarbon-bearing area based on geological structure scatter point data according to the present invention.
FIG. 3 is a schematic diagram of intersection points with a grid in the method for automatically determining hydrocarbon-bearing area based on geological structure scatter data.
Fig. 4 is a schematic diagram of assignment of cells where peer-to-peer lines are located in the method for automatically determining hydrocarbon-bearing area based on geological structure scatter data according to the present invention.
Fig. 4A is a relation diagram of intersection and vertex of a single cell in the method for automatically determining hydrocarbon-bearing area based on geological structure scatter data according to the invention.
FIG. 4B is a schematic diagram illustrating assignment of single vertex to single cell in the method for automatically determining hydrocarbon-bearing area based on scatter data of geological structure according to the present invention.
Fig. 4C is a schematic diagram of assignment of other vertices of a single cell in the method for automatically determining hydrocarbon-bearing area based on geological structure scatter data according to the present invention.
FIG. 5 is a schematic diagram of a structured contour grid finally obtained in the method for automatically determining the hydrocarbon-bearing area based on the scatter data of the geological structure.
The main reference numbers in the figures illustrate: the intersection point A, the upper left vertex B, a are the intersection points with the shortest distance from the upper left vertex B to the upper side, B are the intersection points with the shortest distance from the upper left vertex B to the left side, c are the intersection points with the shortest distance from the upper left vertex B to the right side, and d are the intersection points with the shortest distance from the upper left vertex B to the lower side; l1 contours, L2 contours, M cells.
Detailed Description
For better understanding of the purpose, structure and function of the present invention, the method for automatically determining hydrocarbon-bearing area based on the scattered point data of geological structure will be described in detail with reference to the accompanying drawings.
As shown in fig. 1, the method for automatically determining hydrocarbon-bearing area based on geological structure scatter data of the present invention comprises the following steps:
the first step is as follows: performing thinning on the original construction scattered points by using a Douglas-Puck thinning algorithm, and removing redundant points;
as shown in fig. 2, the dots with smaller diameters represent data before thinning, and the dots with larger diameters represent data after thinning; the specific method of the Douglas-Puck thinning algorithm is as follows:
(1) Taking a contour line, and taking the first three points (according to the sequence of actual data sequencing) of scattered points of the contour line as a starting data queue D;
(2) Connecting the head point and the tail point of the data queue D (according to the actual sequence of D) to form a straight line L;
(3) Calculating the distance between the first point and the last point to L, when the distance value is smaller than a threshold value (for a constructed contour line, 1 meter is usually adopted), continuously taking the next point of the contour line as the last point and adding D (taking the next unremoved point according to the sequence of actual sequencing of contour line data), and then repeating the steps (2) and (3); when the distance value is larger than or equal to the threshold value, entering (4);
(4) Taking the previous point of the end point of the D as the point which is drawn out, taking two points from the beginning point to the back point, and repeating the step (2).
(5) Taking down one contour line, and repeating the steps (2) to (4); until all contour lines are traversed;
the second step: according to the scattered points after the thinning in the first step, solving an outer wrapping rectangle of the scattered points to serve as a boundary for constructing the isoline grid;
and sequentially taking out the scattered points after thinning, comparing X and Y coordinates of the scattered points, and taking the obtained minimum X value, maximum X value, minimum Y value and maximum Y value as coordinate values of four sides of the outsourcing rectangle of the scattered points.
The third step: solving a set of all scattered point intervals, obtaining a minimum interval from the set, and taking the minimum interval as the vertical and horizontal intervals (or the grid step length) of the grid after the minimum interval is rounded;
in order to obtain a proper grid interval, adaptation is needed according to the characteristics of data, the grid is too small, the quality is high, and the calculation workload is large; the grid is too large to represent well the features of the constructed contours. For the scattered points after thinning, the distance between grids is ensured to be smaller than the distance between two scattered points in principle so as to ensure that the connecting line of any two scattered points spans one cell; the specific process is as follows:
(1) Taking all scattered points after the evacuation to form a set;
(2) Calculating the distance between any two points in the set by using a distance formula;
(3) Obtaining the minimum distance between any two points in the set;
(4) The minimum distance between any two points in the set is rounded.
The fourth step: based on the principle of a scanning line algorithm, solving an intersection point set of the contour line after rarefaction and each grid line; the specific process is as follows:
as shown in fig. 3: based on the principle of a scanning line algorithm, the result of the intersection point is obtained, and the specific process is as follows:
(1) Taking out the line segment of each contour line;
(2) The length of the horizontal and vertical grid lines in two end points of each contour line section is obtained;
(3) And (3) rapidly calculating the intersection points of the grid line segments and the horizontal and vertical coordinates by using the similar triangles, wherein the intersection points are grid intersection points.
The fifth step: based on all the intersection point sets, sequentially calculating the vertex values of the cells where the intersection points are located; calculating the top left vertex of the cell by using a weighted average method (the intersection point values of the closest distance in the four directions of top up, bottom, left and right are weighted by using the distance), calculating the other vertex of the edge by further using a linear relation according to whether the intersection point exists on the edge of the four cells where the top left vertex is located, and recursing in the way;
as shown in fig. 4, the specific process for obtaining the result of each vertex of the isoline grid cell based on all the intersection point sets is as follows:
(1) As shown in fig. 4A, an intersection point a in the intersection point set is taken to obtain a cell M where the intersection point is located, and an upper left vertex B is taken;
(2) As shown in fig. 4B, intersection points with the nearest distance in four directions of the top left vertex B are obtained, wherein a is the intersection point with the nearest distance from the top left vertex B to the upper side, B is the intersection point with the nearest distance from the top left vertex B to the left side, c is the intersection point with the nearest distance from the top left vertex B to the right side, and d is the intersection point with the nearest distance from the top left vertex B to the lower side;
(3) Calculating the depth value of the top left vertex by using a distance weighting algorithm; the distance from the first point a to B (top left vertex) is denoted by ad, and the depth of the first point a is denoted by az; similarly, the distance bd from the second point B to B and the depth bz of the second point B can be obtained; the distance cd from the third point c to B, the depth cz of the third point c; the distance dd from the fourth point d to B, the depth dz of the fourth point d; wherein, the formula of the depth value of the top left vertex is:
1/ad*az+1/bd*bz+1/cd*cz+1/dd*dz；
(4) Compute other cell vertices, as shown in FIG. 4C:
after the calculation of the top left vertex is finished, calculating other calculable vertexes of the cell based on linear interpolation;
the values of the vertices a and b can be calculated by the contour L1, and the value of the vertex c can be calculated by the contour L2.
And a sixth step: all the obtained cell vertexes are used as sample points, and the unassigned cell vertexes are assigned by utilizing an inverse distance interpolation algorithm to obtain a constructed isoline grid; the specific process is as follows:
as shown in fig. 5, it is a contour map obtained by tracing the constructed contour net grid obtained after interpolation. After the fifth step, cell vertex values of the cells through which the contour line passes are obtained, the vertex values are used as sample points of an interpolation algorithm, and the unassigned cell vertices are assigned; after the assignment of the vertexes of all the units is completed, obtaining a final contour grid; as can be seen from fig. 5, comparing fig. 2 with fig. 5, the restored contour grid has a higher overall similarity to the given contours.
The seventh step: and tracking the position of the surface where the height value is located in the structural grid surface obtained in the sixth step according to the known fluid interface depth of the reservoir to obtain a hydrocarbon-containing area boundary, and closing the obtained hydrocarbon-containing area boundary after the tracking of the whole structural surface is completed to obtain a hydrocarbon-containing area range.
The content that is not described in this embodiment is the prior art, and therefore, the description thereof is omitted.
The method for automatically obtaining the hydrocarbon-containing area based on the geological structure scatter data has the advantages that the structure scatter point is used for recovering the structure isosurface, the recovered isosurface is ensured to be consistent with the original isosurface after tracing the isosurface, and the hydrocarbon-containing area is obtained by combining with the depth of a fluid interface.
It is to be understood that the present invention has been described with reference to certain embodiments and that various changes in form and details may be made therein by those skilled in the art without departing from the spirit and scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.
Claims (2)
1. A method for automatically solving a hydrocarbon-bearing area based on geological structure scatter data is characterized by comprising the following steps:
the first step is as follows: performing thinning on the original construction scattered points by using a Douglas-Puck thinning algorithm, and removing redundant points;
the second step: according to the scattered points after the first step of thinning, obtaining an outer-wrapping rectangle of the scattered points, and using the outer-wrapping rectangle as a boundary for constructing the isoline grid;
the third step: solving a set of all scattered point distances, obtaining a minimum distance from the set, and taking the minimum distance as a vertical and horizontal distance (or a grid step length) of a grid after the minimum distance is obtained;
the fourth step: based on the principle of a scanning line algorithm, solving an intersection point set of the contour line after rarefaction and each grid line;
the fifth step: based on all the intersection point sets, sequentially calculating the vertex values of the cells where the intersection points are located; calculating the top left vertex of the cell by using a weighted average method, further calculating another vertex of each edge by using a linear relation according to the edges of the four cells where the top left vertex is located, and repeating the steps until the vertex values of the cells where all the intersection points are located are completed;
and a sixth step: taking all cell vertexes obtained in the fifth step as sample points, and assigning the unassigned cell vertexes by utilizing an inverse distance interpolation algorithm to obtain a constructed contour grid;
the seventh step: according to the depth of the fluid interface, the plane position of the depth is tracked in the structural grid obtained in the sixth step, and the hydrocarbon-containing area is obtained.
2. The method of automatically finding hydrocarbon bearing area based on geological structure scatter data as claimed in claim 1,
the first step is to utilize the existing Douglas-Peucker thinning algorithm (Douglas-Peucker algorithm) to thin the scattered points of the original structure and remove redundant points;
the second step is that according to the scattered points after the thinning, an outsourcing rectangle is obtained, the points after the thinning are taken out in sequence as the boundary of the structure isoline grid, the X and Y coordinates of the points are compared, and the obtained minimum X, maximum X, minimum Y and maximum Y coordinates are used as coordinate values of four sides of the outsourcing rectangle;
based on the principle of a scanning line algorithm, the fourth step of solving the intersection point set of the contour line after thinning and each grid line is to take out the line segment of each contour line, solve the horizontal and vertical grid lines in the two end points of the line segment, and quickly calculate the intersection point of the line segment and the horizontal and vertical coordinates by using a similar triangle, namely the intersection point of the grid;
and a sixth step: taking all the obtained cell vertexes as sample points, assigning the unassigned cell vertexes by using an inverse distance interpolation algorithm to obtain a constructed isoline grid, taking three sample points as an example for any cell vertex A, and obtaining the inverse distance interpolation algorithm of the vertex A assignment as follows:
setting: b1= 1/(distance a to B), C1= 1/(distance a to C), D1= 1/(distance a to D), the value Z of the cell a vertex = Z value of B × B1/(B1 + C1+ D1) + Z value of C × C1/(B1 + C1+ D1) + Z value of D × D1/(B1 + C1+ D1) + D;
the seventh step: tracking the planar position of the depth in the resulting construction grid according to the fluid interface depth, and thereby obtaining a hydrocarbon bearing area as: extracting all grid vertexes and structural contour lines with the depth larger than the fluid interface depth from the grid, extracting lines with one side larger than the interface depth and one side smaller than the interface depth according to the depths of the structural points on the two sides of the contour lines, and carrying out closing treatment on the lines to obtain the hydrocarbon-containing area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011592388.0A CN112687008B (en) | 2020-12-29 | 2020-12-29 | Method for automatically calculating hydrocarbon-bearing area based on geological structure scatter data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011592388.0A CN112687008B (en) | 2020-12-29 | 2020-12-29 | Method for automatically calculating hydrocarbon-bearing area based on geological structure scatter data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112687008A CN112687008A (en) | 2021-04-20 |
| CN112687008B true CN112687008B (en) | 2022-12-06 |
Family
ID=75455091
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011592388.0A Active CN112687008B (en) | 2020-12-29 | 2020-12-29 | Method for automatically calculating hydrocarbon-bearing area based on geological structure scatter data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112687008B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116402880B (en) * | 2023-06-06 | 2024-01-19 | 昆仑数智科技有限责任公司 | Method, device, equipment and storage medium for determining oil-containing area |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617291A (en) * | 2013-12-14 | 2014-03-05 | 中国海洋石油总公司 | Equivalent characterization method for reservoir stratum cause unit interface |
| CN104635262A (en) * | 2013-11-13 | 2015-05-20 | 中国石油天然气集团公司 | Automatic forward and reverse fault isoline generating method based on enhanced rectangular grid |
-
2020
- 2020-12-29 CN CN202011592388.0A patent/CN112687008B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104635262A (en) * | 2013-11-13 | 2015-05-20 | 中国石油天然气集团公司 | Automatic forward and reverse fault isoline generating method based on enhanced rectangular grid |
| CN103617291A (en) * | 2013-12-14 | 2014-03-05 | 中国海洋石油总公司 | Equivalent characterization method for reservoir stratum cause unit interface |
Non-Patent Citations (1)
| Title |
|---|
| 面向复杂构造的油藏数值模拟网格剖分算法;孙鹏等;《计算机与数字工程》;20170620(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112687008A (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111932688B (en) | Indoor plane element extraction method, system and equipment based on three-dimensional point cloud | |
| CN101901503B (en) | Stretch-driven mesh parameterization method using spectral analysis | |
| CN104635262B (en) | A kind of positive reversed fault isopleth automatic generation method based on extended rectangular grid | |
| CN105550691A (en) | Self-adaptive valley and ridge line extraction method and system based on scale space | |
| CN103701466A (en) | Scattered point cloud compression algorithm based on feature reservation | |
| CN110032771B (en) | DEM accurate cutting method considering local detail characteristics for opencast coal mine | |
| CN110163965B (en) | Solid three-dimensional model construction method for monoclinic rock stratum structure landform | |
| CN112699623A (en) | High-precision heat flow calculation method based on unstructured grid regularized reconstruction technology | |
| US20240153123A1 (en) | Isogeometric Analysis Method Based on a Geometric Reconstruction Model | |
| CN101853525A (en) | Mesh segmentation based simplification method for preserving details of textured model | |
| CN102737542B (en) | Automatic water depth annotation selection method with consideration of multi-restriction conditions | |
| CN112687008B (en) | Method for automatically calculating hydrocarbon-bearing area based on geological structure scatter data | |
| CN116030218A (en) | Tetrahedral mesh dividing method, device, system and storage medium | |
| Altantsetseg et al. | 3d surface reconstruction of stone tools by using four-directional measurement machine | |
| CN109389553B (en) | Meteorological facsimile picture contour interpolation method based on T spline | |
| CN112150582A (en) | Multi-modal data-oriented geological profile approximate expression method | |
| CN107886573B (en) | Slope three-dimensional finite element grid generation method under complex geological conditions | |
| CN105869210A (en) | Interpolation data processing method in three-dimensional geological surface model | |
| CN111008429B (en) | Heterogeneous CAD geometric consistency comparison method based on point cloud | |
| Rahim et al. | Evaluation of adaptive subdivision method on mobile device | |
| CN109472046A (en) | Complicated dam foundation arch dam three-dimensional finite element tetrahedral grid automatic division method | |
| CN104732292A (en) | Automatic planning method for main velocity line based on profile data | |
| CN114170388A (en) | Octree-based dynamic modeling method for searching ellipsoid through local anisotropy | |
| RU2484427C1 (en) | Method for cartographic display of two-dimensional distributions given in digital form | |
| CN113902769B (en) | Earthquake fault identification method based on deep learning semantic segmentation |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |