CN107577842B - Compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and system - Google Patents
Compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and system Download PDFInfo
- Publication number
- CN107577842B CN107577842B CN201710646746.3A CN201710646746A CN107577842B CN 107577842 B CN107577842 B CN 107577842B CN 201710646746 A CN201710646746 A CN 201710646746A CN 107577842 B CN107577842 B CN 107577842B
- Authority
- CN
- China
- Prior art keywords
- fracture
- intersection
- intersected
- crack
- pair
- 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
- 238000001514 detection method Methods 0.000 title claims abstract description 40
- 238000000034 method Methods 0.000 claims abstract description 90
- 238000001914 filtration Methods 0.000 claims abstract description 16
- 238000007670 refining Methods 0.000 claims description 45
- 239000004215 Carbon black (E152) Substances 0.000 description 6
- 229930195733 hydrocarbon Natural products 0.000 description 6
- 150000002430 hydrocarbons Chemical class 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Landscapes
- Investigating Strength Of Materials By Application Of Mechanical Stress (AREA)
Abstract
The invention provides a compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and a system, wherein the method comprises the following steps: generating a corresponding bounding box for each fracture polygon, filtering by a projection method and an intersection operation method to obtain an intersected bounding box pair, and further preliminarily determining an intersected fracture pair; removing the non-intersected crack pairs in the preliminarily determined intersected crack pairs by utilizing an inner product method to obtain the roughly refined intersected crack pairs; and obtaining the finely refined intersected crack pairs through the intersection point position relationship of the two crack polygons, and determining the intersection line of the intersected crack pairs according to the intersection point position relationship. The method adopts the bounding box, the projection method, the intersection operation method and the like to filter the preliminarily determined intersection crack pairs, filters obvious non-intersection crack pairs, saves a large amount of operation time for knowing the intersection condition of the cracks in the three-dimensional discrete crack network of the compact oil and gas reservoir, and improves the detection efficiency of the intersection of the cracks.
Description
Technical Field
The invention relates to the technical field of fracture intersection detection, in particular to a compact oil and gas reservoir three-dimensional discrete network fracture intersection detection method and system.
Background
Three-dimensional fracture intersection detection is a special type of collision detection, and generally, the collision detection can be divided into time domain-based collision detection and space domain-based collision detection, and the three-dimensional fracture intersection detection belongs to control domain-based static collision detection. The detection of the intersection of the fractures of the compact oil and gas reservoir is one of the important means in the field of connectivity analysis of the compact oil and gas reservoir.
At present, for a three-dimensional fracture intersection method, a conventional method adopts an exhaustion method, namely intersection operation is carried out on all fracture polygons in a three-dimensional discrete fracture network pairwise, and by adopting the method, the time complexity is exponentially increased along with the number n of the fracture polygons, and can be expressed as n x (n-1)/2.
Therefore, when the number of the fracture polygons is large, the operation time of detailed fracture detection is long, the calculation amount is large when two fracture polygons are subjected to intersection calculation, and the system consumption is very large.
Disclosure of Invention
The present invention provides a compact hydrocarbon reservoir three-dimensional discrete network fracture intersection detection method and system that overcomes or at least partially solves the above-mentioned problems.
According to one aspect of the invention, a compact oil and gas reservoir three-dimensional discrete network fracture intersection detection method is provided, and comprises the following steps:
s1, generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network, filtering by a projection method and an intersection operation method to obtain an intersected bounding box pair, and further preliminarily determining the intersected fracture pair;
s2, removing partial non-intersected fracture pairs in the primarily determined intersected fracture pairs by utilizing an inner product method to obtain the primarily refined intersected fracture pairs;
and S3, obtaining a fine-refined intersecting crack pair through the intersection point position relationship of two crack polygons in the coarse-refined intersecting crack pair, and determining the intersection line of the intersecting crack pair according to the intersection point position relationship.
The invention has the beneficial effects that: and filtering the preliminarily determined intersecting crack pairs by adopting a bounding box, a projection method, an intersecting operation method and the like, filtering obvious non-intersecting crack pairs, and performing coarse refining and fine refining on the preliminarily determined intersecting crack pairs after filtering to further determine whether the crack pairs are truly intersected or not.
On the basis of the technical scheme, the invention can be further improved as follows.
Further, the generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network in step S1 further includes:
inputting each fracture polygon into a three-dimensional discrete fracture network model to generate a corresponding AABB bounding box, wherein the AABB bounding box is a cuboid bounding box.
Further, the calculating of the intersected bounding box pair by the projection method and the intersection operation method in step S1 further includes:
s11, respectively projecting the AABB bounding boxes corresponding to each fracture polygon to an xy plane and a z axis by a projection method;
s12, scanning each rectangle formed by projecting each AABB bounding box to the xy plane by using a scanning line method in the xy plane to obtain an intersected rectangle pair list Lxy(ii) a And obtaining each projection line formed by projecting each AABB bounding box to the z axis through a one-dimensional SAP algorithm to obtain an intersected projection line pair list Lz；
S13, obtaining the initially intersected bounding box pair L through a list intersection operation methodi＝Lxy∩LzAnd then, according to the preliminarily intersected bounding box pairs, preliminarily determining the intersected crack pairs.
Further, the step S2 further includes:
and judging whether the plane where any fracture polygon in each fracture pair passes through the other fracture polygon by utilizing an inner product method for the preliminarily determined intersecting fracture pairs, wherein if the judgment result is yes, the fracture pair is the intersecting fracture pair determined after coarse refining.
Further, the step S2 further includes:
assuming that two fracture polygons in the preliminarily determined intersecting fracture pairs are respectively P1P2P3P4P5And Q1Q2Q3Q4；
If it satisfies
Or satisfy
Determine fracture polygon P1P2P3P4P5And a fracture polygon Q1Q2Q3Q4Do not intersect, otherwise, the fracture polygon P1P2P3P4P5And a fracture polygon Q1Q2Q3Q4The columns are crossed crack pairs after coarse refining;
wherein,
is a vector
And vector
The inner product of (a) is,
is the sign of the inner product.
Further, step S3 further includes:
and respectively calculating the intersection point of the plane where the first fracture polygon and the second fracture polygon are located and the intersection point of the plane where the second fracture polygon and the first fracture polygon are located in the intersection crack pair, determining whether the fracture pair is truly intersected according to the position relationship of the intersection points, and if the fracture pair is truly intersected, determining the intersection line of the two fracture polygons through the position relationship of the intersection points.
According to another aspect of the invention, a compact hydrocarbon reservoir three-dimensional discrete network fracture intersection detection system is provided, which comprises:
the filtering module is used for generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network, and filtering by a projection method and an intersection operation method to obtain an intersected bounding box pair so as to preliminarily determine the intersected fracture pair; the rough refining module is used for removing part of the preliminarily determined intersected crack pairs by using an inner product method to obtain the intersected crack pairs after rough refining;
the fine refining module is used for obtaining a fine refined intersected crack pair through the intersection point position relation of two crack polygons in the coarse refined intersected crack pair;
and the determining module is used for determining the intersection line of the intersected crack pair according to the intersection point position relation.
Further, the coarse refining module is further configured to:
and judging whether the plane where any fracture polygon in each fracture pair passes through the other fracture polygon by utilizing an inner product method for the preliminarily determined intersecting fracture pairs, wherein if the judgment result is yes, the fracture pair is the intersecting fracture pair determined after coarse refining.
Further, the fine refining module is further configured to:
and respectively calculating the intersection point of the plane where the first fracture polygon and the second fracture polygon are located and the intersection point of the plane where the second fracture polygon and the first fracture polygon are located in the intersection fracture pair determined after coarse refining, and determining whether the fracture pair is truly intersected according to the position relationship of the intersection points.
Drawings
FIG. 1 is a flow chart of a tight hydrocarbon reservoir three-dimensional discrete network fracture intersection detection method according to an embodiment of the invention;
FIG. 2 is an effect diagram obtained by the crack intersection detection method provided by the present invention;
FIG. 3 is a schematic view of a two-phase intersection fracture;
FIG. 4 is a schematic view of a cross point location relationship of intersecting fracture pairs;
FIG. 5 is a schematic view of another intersection location relationship of intersecting fracture pairs;
FIG. 6 is a schematic view of yet another intersection location relationship of intersecting fracture pairs;
FIG. 7 is another effect diagram obtained by the crack intersection detection method provided by the present invention;
FIG. 8 is a schematic diagram of a three-dimensional discrete fracture network model intersecting fracture detection result;
FIG. 9 is a connection block diagram of a tight hydrocarbon reservoir three-dimensional discrete network fracture intersection detection system according to another embodiment of the invention.
Detailed Description
The following detailed description of embodiments of the present invention is provided in connection with the accompanying drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
Referring to fig. 1, a compact hydrocarbon reservoir three-dimensional discrete network fracture intersection detection method according to an embodiment of the present invention is provided, including: s1, generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network, filtering by a projection method and an intersection operation method to obtain an intersected bounding box pair, and further preliminarily determining the intersected fracture pair; s2, removing partial non-intersected fracture pairs in the primarily determined intersected fracture pairs by utilizing an inner product method to obtain the primarily refined intersected fracture pairs; and S3, obtaining a fine-refined intersecting crack pair through the intersection point position relationship of two crack polygons in the coarse-refined intersecting crack pair, and determining the intersection line of the intersecting crack pair according to the intersection point position relationship.
In the process of detecting the intersection of the cracks of the three-dimensional discrete crack network, the intersection of the cracks is detected by adopting an exhaustion method, namely, every two of all the crack polygons in the three-dimensional discrete crack network are subjected to pairwise intersection operation, and the time complexity of the operation by adopting the method is exponentially increased along with the number of the cracks. Therefore, the embodiment provides a set of crack intersection detection method, which can improve the detection efficiency and reduce the system overhead.
The method realizes the process of detecting the intersection of the cracks by generating a corresponding bounding box aiming at each crack polygon in the three-dimensional discrete crack network. Since the fracture polygons are usually very irregular in shape, the subsequent processing is more concise by generating a bounding box corresponding to the rule for each fracture polygon.
And for the bounding boxes generated by each fracture polygon, calculating an intersected bounding box pair by a projection method and an intersection operation method, namely which bounding boxes are intersected, and filtering the original fracture pair according to the intersected bounding box pair and the corresponding relation between each bounding box and the fracture polygon to obtain the primarily determined intersected fracture pair after filtering. Because the preliminarily determined crack pairs are not accurate enough, the preliminarily determined intersected crack pairs are subjected to coarse refining by adopting an inner product method, the non-intersected crack pairs in the preliminarily determined intersected crack pairs are removed, the determined intersected crack pairs after coarse refining are obtained, and finally the real intersected crack pairs are determined according to the intersection point position relation of two crack polygons in the intersected crack pairs. And determining the intersection line of the finally determined truly intersected fracture pairs according to the intersection point position relation of the two fracture polygons, and providing support for the connectivity of the fractures of the three-dimensional discrete fracture network.
In the embodiment, the bounding box, the projection method, the intersection operation method and the like are adopted to filter the preliminarily determined intersection crack pairs, the obvious non-intersection crack pairs are filtered, the preliminarily determined intersection crack pairs after filtering are subjected to coarse refining and fine refining, whether the crack pairs are truly intersected or not is further determined, a large amount of operation time is saved for the intersection condition of all crack polygons in the whole three-dimensional discrete crack network, and the detection efficiency of the intersection of the cracks is improved.
On the basis of the foregoing embodiment, in an embodiment of the present invention, the generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network in step S1 further includes: inputting each fracture polygon into a three-dimensional discrete fracture network model to generate a corresponding AABB bounding box, wherein the AABB bounding box is a cuboid bounding box.
In the process of specifically generating the bounding box of each fracture polygon, inputting each fracture polygon into the three-dimensional discrete fracture network model, and generating the bounding box corresponding to each fracture polygon through the three-dimensional discrete fracture network model. In the present embodiment, the bounding box generated for each fracture polygon is an AABB bounding box. The AABB box is a rectangular parallelepiped bounding box.
In this embodiment, each fracture polygon in the three-dimensional discrete fracture network generates a corresponding AABB bounding box, and it is much easier to analyze whether each bounding box intersects than to directly analyze whether each fracture polygon intersects, so that the operation process for primarily determining whether the fracture polygons intersect can be simplified.
In another embodiment of the present invention based on the foregoing embodiments, the calculating an intersected bounding box pair by a projection method and an intersection operation method in step S1 further includes:
s11, respectively projecting the AABB bounding boxes corresponding to each fracture polygon to an xy plane and a z axis by a projection method; s12, scanning each rectangle formed by projecting each AABB bounding box to the xy plane by using a scanning line method in the xy plane to obtain an intersected rectangle pair list Lxy(ii) a And obtaining each projection line formed by projecting each AABB bounding box to the z axis through a one-dimensional SAP algorithm to obtain an intersected projection line pair list Lz(ii) a S13, obtaining the initially intersected bounding box pair L through a list intersection operation methodi＝Lxy∩LzAnd then, according to the preliminarily intersected bounding box pairs, preliminarily determining the intersected crack pairs. In the process of determining the preliminary intersection crack pair, the method is mainly realized by adopting a projection method and an intersection operation method, and specifically, an AABB bounding box corresponding to each crack polygon is projected to an xy plane and a z axis respectively through the projection method. Among them, the projection of the AABB bounding box onto the xy plane forms a rectangular shape, and the projection of the AABB bounding box onto the z axis forms the respective projection lines. Then, scanning each rectangle on the xy plane by using a scanning line method on the xy plane to obtain an intersected rectangle pair list LxySimilarly, a plurality of projection lines formed on the z-axis are processed by adopting a one-dimensional SAP algorithm to obtain an intersected projection line pair list Lz. Finally, according to the obtained intersected rectangle pair list LxyAnd calculating to obtain a primary intersected bounding box pair L by a list intersection operation methodi＝Lxy∩LzAnd then obtaining a preliminarily determined intersected crack pair according to the obtained preliminarily intersected bounding box pair.
In the embodiment, the scanning line method and the intersection operation method are adopted to preliminarily determine the intersection crack pairs, so that the obvious non-intersection crack pairs can be eliminated, the data operation amount is reduced, and the operation time in the whole detection process is further reduced.
On the basis of the foregoing embodiments, in another embodiment of the present invention, the step S2 further includes: and judging whether the plane where any fracture polygon in each fracture pair passes through the other fracture polygon by utilizing an inner product method for the preliminarily determined intersecting fracture pairs, wherein if the judgment result is yes, the fracture pair is the intersecting fracture pair determined after coarse refining.
In the above embodiment, the original fracture pairs are filtered by using the scanning line method and the intersection operation method to preliminarily determine the intersecting fracture pairs, so that the result of the preliminarily determined intersecting fracture pairs is not particularly accurate, that is, some non-intersecting fracture pairs may be included, therefore, in this embodiment, the preliminarily determined intersecting fracture pairs are further refined. For example, after the initial determination, the fracture polygon a and the fracture polygon B are an intersecting fracture pair, and whether the fracture polygon a and the fracture polygon B intersect is further determined again. The main idea is to judge whether the plane of the fracture polygon A passes through the fracture polygon B and whether the plane of the fracture polygon B passes through the fracture polygon A, and only when the plane of the fracture polygon A passes through the fracture polygon B and the plane of the fracture polygon B passes through the fracture polygon A, the fracture polygon A and the fracture polygon B can be determined to be possibly intersected, so that the rough refining of the primary determination result is completed. And performing coarse refining on the result of the preliminarily determined intersection crack pair, and removing part of the preliminarily determined intersection crack pair to obtain the preliminarily refined intersection crack pair.
Wherein, in the implementation process of coarse refining, an inner product method is mainly adopted to judge whether the plane where one of the fracture polygons in each fracture pair passes through the otherThe outer one is a fracture polygon. In particular, assume that there are two fracture polygons P1P2P3P4P5And Q1Q2Q3Q4And preliminarily determining the two fracture polygons as intersecting fracture pairs. In the further determination process, the positional relationship between the two fracture polygons and the plane where the two fracture polygons are located may be summarized as follows: (1) the surface where the fracture polygon is located does not penetrate through the other fracture polygon; (2) only the surface where one fracture polygon is located passes through the other fracture polygon; (3) the surface of any fracture polygon passes through the other fracture polygon. Only in the third case are two fractures possible to intersect in these three positional relationships. The plane of one fracture does not pass through another fracture polygon, and can also be expressed as that all the vertexes of the other fracture polygon are on the same side of the plane of the fracture polygon. If, the fracture polygon P1P2P3P4P5The surface of the polygon Q does not penetrate through the crack1Q2Q3Q4And then, the following conditions are satisfied:
wherein,
is a vector
And vector
The inner product of (a) is,
is the sign of the inner product.
When the fracture is polygonal Q1Q2Q3Q4The surface of the polygon P does not penetrate through the crack1P2P3P4P5And then, the following conditions are satisfied:
when the above equation (1) holds or the above equation (2) holds, the fracture polygon P is indicated1P2P3P4P5And a fracture polygon Q1Q2QQQ4Are disjoint, whereas when neither equation (1) nor equation (2) holds, the polygon P1P2P3P4P5And a fracture polygon Q1Q2Q3Q4Are likely to intersect.
The internal product method is adopted to carry out coarse refining on the preliminarily determined intersecting crack pair, and the result of the intersecting crack pair obtained at the moment is more accurate than the preliminarily determined result. Most of non-intersected crack pairs are removed, the operation amount of crack detection is greatly reduced, wherein an inner product method is adopted to carry out coarse refining on the primarily determined intersected crack pairs, and compared with the scheme which is not adopted, a relation curve between the operation time of the two intersected crack pairs and the number of the polygonal cracks is shown in figure 2. As can be seen from fig. 2, the running time increases exponentially with the number of fracture polygons without using the inner product-outer product, while the running time is approximately linear with the number of fracture polygons with using the inner product-outer product, and the running time required for the whole fracture intersection detection is greatly reduced.
On the basis of the above embodiments, in another embodiment of the present invention, for the intersecting fracture pair determined after the coarse refining, an intersection point of a plane where the first fracture polygon and the second fracture polygon are located in the intersecting fracture pair and an intersection point of a plane where the second fracture polygon and the first fracture polygon are located are respectively calculated, whether the fracture pair is truly intersected is determined according to a position relationship of the intersection points, and if the fracture pair is truly intersected, an intersection line of the two fracture polygons is determined according to a position relationship of the intersection points.
Coarse refining the preliminarily determined intersecting crack pair by an inner product method, fine refining the result after the final coarse refining, and judgingAnd finally, whether the crack pairs are really intersected or not is judged, and if the crack pairs are intersected, the intersection line between the two intersected crack pairs is specifically calculated, so that more accurate intersection data can be obtained. And for the intersected fracture pairs determined after the coarse refining, respectively calculating the intersection points of the plane of the first fracture polygon and the second fracture polygon in the intersected fracture pairs and the intersection points of the plane of the second fracture polygon and the first fracture polygon in the detailed refining process, further judging whether the two fracture polygons are truly intersected according to the position relationship of each intersection point, and determining a specific intersection line according to the position relationship of all the intersection points under the condition of real intersection. FIG. 3 is a schematic diagram of two intersecting crack pairs. Wherein the intersection point of the planes of the first fracture polygon and the second fracture polygon is A1、A2The intersection point of the second fracture polygon and the plane of the first fracture polygon is B1And B2The four points are now on a straight line. Whether the two fracture polygons are intersected or not can be rapidly judged according to the inner product discriminant, and if the two fracture polygons are intersected, an intersection line can be calculated. If it is
And is
The cracks do not intersect, see fig. 4. If it is
And is
The intersection line of the cracks is
See fig. 5, if
And is
Cross line of crack
See figure 6. By adopting the inner product method, the corresponding intersecting lines of the intersecting fracture pairs of the three-dimensional discrete fracture network of the compact oil and gas reservoir can be obtained.
Compared with the conventional exhaustion method, the mode of detecting the intersection of the cracks by adopting the AABB bounding box and the scanning line method in the above embodiments has the effect of the running time as shown in fig. 7. As can be seen from fig. 7, with the method of the above embodiments, the operation time and the number of fracture polygons are approximately linear, and the operation time and the number of fracture polygons grow exponentially without the conventional method of the above embodiments.
By carrying out fracture intersection detection on the three-dimensional discrete fracture network model of the compact oil and gas reservoir of the extension group of a certain well region of the Ordors basin through the embodiments, the method can quickly obtain intersected fractures, and as shown in FIG. 8, fracture polygons with solid line sides in the graph are communicated fractures, and fracture polygons without solid line sides in the graph represent isolated fractures.
Referring to fig. 9, a compact hydrocarbon reservoir three-dimensional discrete network fracture intersection detection system according to another embodiment of the present invention is provided, which includes a filtering module 91, a coarse refining module 92, a fine refining module 93, and a determination module 94.
And the filtering module 91 is configured to generate a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network, and filter the bounding box pair by using a projection method and an intersection operation method to obtain an intersected bounding box pair, so as to preliminarily determine the intersected fracture pair. And the coarse refining module 92 is configured to remove a part of the preliminarily determined intersected fracture pairs by using an inner product method to obtain the roughly refined intersected fracture pairs.
And the fine refining module 93 is configured to obtain a fine refined intersection crack pair according to an intersection point position relationship between two crack polygons in the coarse refined intersection crack pair.
And the determining module 94 is configured to determine an intersection line of the intersecting crack pair according to the intersection point position relationship.
Wherein the coarse refining module 92 is further configured to:
and judging whether the plane where any fracture polygon in each fracture pair passes through the other fracture polygon by utilizing an inner product method for the preliminarily determined intersecting fracture pairs, wherein if the judgment result is yes, the fracture pair is the intersecting fracture pair determined after coarse refining.
The fine refining module 93 is further for:
and respectively calculating the intersection point of the plane where the first fracture polygon and the second fracture polygon are located and the intersection point of the plane where the second fracture polygon and the first fracture polygon are located in the intersection fracture pair determined after coarse refining, and determining whether the fracture pair is truly intersected according to the position relationship of the intersection points.
According to the compact oil and gas reservoir three-dimensional discrete network fracture intersection detection method and system, the initially determined intersection fracture pairs are filtered by adopting the bounding box, the projection method, the intersection operation method and the like, obviously non-intersection fracture pairs are filtered, the primarily determined intersection fracture pairs are refined and determined again by adopting the inner product method and the intersection point position relation of the intersection fracture pairs, and the result of the re-determined intersection fracture pairs is very accurate.
Finally, the method of the present application is only a preferred embodiment and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (7)
1. A compact oil and gas reservoir three-dimensional discrete network fracture intersection detection method is characterized by comprising the following steps:
s1, generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network, filtering by a projection method and an intersection operation method to obtain an intersected bounding box pair, and further preliminarily determining the intersected fracture pair;
s2, removing partial non-intersected fracture pairs in the primarily determined intersected fracture pairs by utilizing an inner product method to obtain the primarily refined intersected fracture pairs;
s3, obtaining a finely refined intersecting crack pair through the intersection point position relationship of two crack polygons in the roughly refined intersecting crack pair, and determining the intersection line of the intersecting crack pair according to the intersection point position relationship;
wherein the step S3 further includes:
respectively calculating the intersection point of the plane where the first fracture polygon and the second fracture polygon are located and the intersection point of the plane where the second fracture polygon and the first fracture polygon are located in the intersection fracture pair determined after coarse refining;
and determining whether the crack pair is truly intersected or not according to the position relationship of the intersection points, and if true, determining the intersection line of the two crack polygons according to the position relationship of the intersection points.
2. The fracture intersection detection method of claim 1, wherein the generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network in step S1 further comprises:
inputting each fracture polygon into a three-dimensional discrete fracture network model to generate a corresponding AABB bounding box, wherein the AABB bounding box is a cuboid bounding box.
3. The fracture intersection detection method of claim 2, wherein the step S1 of calculating the intersected bounding box pair through a projection method and an intersection algorithm further comprises:
s11, respectively projecting the AABB bounding boxes corresponding to each fracture polygon to an xy plane and a z axis by a projection method;
s12, scanning each rectangle formed by projecting each AABB bounding box to the xy plane by using a scanning line method in the xy plane to obtain an intersected rectangle pair list Lxy(ii) a And obtaining each projection line formed by projecting each AABB bounding box to the z axis through a one-dimensional SAP algorithm to obtain an intersected projection line pair list Lz；
S13, obtaining the initially intersected bounding box pair L through a list intersection operation methodi＝Lxy∩LzAnd then, according to the preliminarily intersected bounding box pairs, preliminarily determining the intersected crack pairs.
4. The crack intersection detection method of claim 3, wherein the step S2 further comprises:
and judging whether the plane where any fracture polygon in each fracture pair passes through the other fracture polygon by utilizing an inner product method for the preliminarily determined intersecting fracture pairs, wherein if the judgment result is yes, the fracture pair is the intersecting fracture pair determined after coarse refining.
5. The fracture intersection detection method according to claim 4, wherein the step S2 further includes:
assuming that two fracture polygons in the preliminarily determined intersecting fracture pairs are respectively P1P2P3P4P5And Q1Q2Q3Q4；
If it satisfies
Or satisfy
Determine fracture polygon P1P2P3P4P5And a fracture polygon Q1Q2Q3Q4Do not intersect, otherwise, the fracture polygon P1P2P3P4P5And a fracture polygon Q1Q2Q3Q4The columns are crossed crack pairs after coarse refining;
wherein,
is a vector
And vector
The inner product of (a) is,
is the sign of the inner product.
6. A compact oil and gas reservoir three-dimensional discrete network fracture intersection detection system is characterized by comprising:
the filtering module is used for generating a corresponding bounding box for each fracture polygon in the three-dimensional discrete fracture network, and filtering by a projection method and an intersection operation method to obtain an intersected bounding box pair so as to preliminarily determine the intersected fracture pair;
the rough refining module is used for removing part of the preliminarily determined intersected crack pairs by using an inner product method to obtain the intersected crack pairs after rough refining;
the fine refining module is used for obtaining a fine refined intersected crack pair through the intersection point position relation of two crack polygons in the coarse refined intersected crack pair;
the determining module is used for determining an intersection line of the intersected crack pair according to the intersection point position relation;
wherein the fine refining module is further to:
and respectively calculating the intersection point of the plane where the first fracture polygon and the second fracture polygon are located and the intersection point of the plane where the second fracture polygon and the first fracture polygon are located in the intersection fracture pair determined after coarse refining, and determining whether the fracture pair is truly intersected according to the position relationship of the intersection points.
7. The fracture intersection detection system of claim 6, wherein the coarse refining module is further to:
and judging whether the plane where any fracture polygon in each fracture pair passes through the other fracture polygon by utilizing an inner product method for the preliminarily determined intersecting fracture pairs, wherein if the judgment result is yes, the fracture pair is the intersecting fracture pair determined after coarse refining.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710646746.3A CN107577842B (en) | 2017-08-01 | 2017-08-01 | Compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710646746.3A CN107577842B (en) | 2017-08-01 | 2017-08-01 | Compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107577842A CN107577842A (en) | 2018-01-12 |
| CN107577842B true CN107577842B (en) | 2020-04-07 |
Family
ID=61034084
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710646746.3A Active CN107577842B (en) | 2017-08-01 | 2017-08-01 | Compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107577842B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108875163B (en) * | 2018-06-01 | 2020-08-11 | 中国石油大学(北京) | Method and system for evaluating three-dimensional fracture network connectivity |
| CN109870458B (en) * | 2019-02-19 | 2021-11-09 | 福建农林大学 | Pavement crack detection and classification method based on three-dimensional laser sensor and bounding box |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7505885B2 (en) * | 2003-01-24 | 2009-03-17 | The Boeing Company | Method and interface elements for finite-element fracture analysis |
| JP4708759B2 (en) * | 2004-10-18 | 2011-06-22 | 株式会社ブリヂストン | Simulation method |
| CN103400020B (en) * | 2013-04-16 | 2016-03-16 | 西南石油大学 | A kind of numerical reservoir simulation method calculating many crossing discrete fractures flow conditions |
| CN104933208B (en) * | 2014-02-21 | 2016-07-06 | 中国石油化工股份有限公司 | A kind of different scale Fractured Reservoir numerical simulation integrated conduct method |
| CN106326517B (en) * | 2015-07-03 | 2019-07-30 | 中国石油化工股份有限公司 | Stratiform crack-matrix hybrid grid modeling method and device |
| CN105719340B (en) * | 2016-01-15 | 2018-09-28 | 西南石油大学 | The three-dimensional modeling method in artificial fracturing crack in a kind of oil and gas reservoir |
-
2017
- 2017-08-01 CN CN201710646746.3A patent/CN107577842B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107577842A (en) | 2018-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107577842B (en) | Compact oil and gas reservoir three-dimensional discrete fracture network fracture intersection detection method and system | |
| CN102473008B (en) | Automatic programming device and method | |
| US20130089259A1 (en) | Space segmentation method for 3d point clouds | |
| CN104200496B (en) | High-precision detecting and locating method for rectangular identifiers on basis of least square vertical fitting of adjacent sides | |
| EP1773101A2 (en) | Method and apparatus for aperture detection of 3D hearing aid shells | |
| JP3549282B2 (en) | Method and apparatus for creating charged beam drawing data | |
| KR101517004B1 (en) | Image Processing | |
| CN112907601B (en) | Automatic extraction method and device for tunnel arch point cloud based on feature transformation | |
| CN106504225A (en) | A kind of recognition methodss of regular polygon and device | |
| CN107564078B (en) | Automatic vectorization method for grid partition map with interference pixels | |
| CN111951196B (en) | Graph-based progressive point cloud downsampling method and device | |
| CN113221895A (en) | Small target detection method, device, equipment and medium | |
| CN114140466B (en) | Plant root system measuring method, system and device based on image processing | |
| CN105786957A (en) | Table sorting method based on cell adjacency relation and depth-first traversal | |
| CN106780393B (en) | Image de-noising method based on image set | |
| JP2007233560A (en) | Method for generating mesh model | |
| CN109143773B (en) | Pretreatment method before optical proximity correction | |
| CN114782473A (en) | Metallographic structure grain boundary extraction method based on pixel relation | |
| CN103065306A (en) | Processing method and device of graphic data | |
| KR101512297B1 (en) | Method for Determining Ground Line | |
| CN108389154A (en) | The implementation method of a kind of clipping region cutting techniques for parallel drawing in GPU | |
| Mitropoulos et al. | A methodology on natural occurring lines segmentation and generalization | |
| CN113902887A (en) | Three-dimensional visual edge generation method, system, computer and readable storage medium | |
| CN113538460B (en) | Shale CT image cutting method and system | |
| JP4748770B2 (en) | Proximity point calculation method and apparatus |
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 |