CN113902872A - Method, device and medium for detecting connectivity of non-structural matrix grids and cracks - Google Patents

Method, device and medium for detecting connectivity of non-structural matrix grids and cracks Download PDF

Info

Publication number
CN113902872A
CN113902872A CN202111181116.6A CN202111181116A CN113902872A CN 113902872 A CN113902872 A CN 113902872A CN 202111181116 A CN202111181116 A CN 202111181116A CN 113902872 A CN113902872 A CN 113902872A
Authority
CN
China
Prior art keywords
grid
crack
list
grids
cracks
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111181116.6A
Other languages
Chinese (zh)
Inventor
王通
姚军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China University of Petroleum East China
Original Assignee
China University of Petroleum East China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China University of Petroleum East China filed Critical China University of Petroleum East China
Priority to CN202111181116.6A priority Critical patent/CN113902872A/en
Publication of CN113902872A publication Critical patent/CN113902872A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20Finite element generation, e.g. wire-frame surface description, tesselation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2282Tablespace storage structures; Management thereof

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Graphics (AREA)
  • Geometry (AREA)
  • Image Analysis (AREA)

Abstract

The application discloses a method, a device and a medium for detecting connectivity of a non-structural matrix grid and a crack, wherein the method comprises the following steps: generating a spatial index structure of the unstructured substrate grid, wherein the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list; searching the spatial position of the top point of the crack on the grid tree, searching and storing the intersection point of the crack edge and the grid surface by using the grid surface adjacency list, and searching and storing the intersection point of the crack edge and the grid edge by using the grid edge adjacency list; and carrying out spatial ordering on the intersection points stored in each grid to generate the connection relation between the cracks and the grids. Therefore, the calculation complexity can be effectively reduced, the calculation process is accelerated, the grids which are probably intersected around the crack can be quickly selected by using the generated connection relation, the intersection detection operation is reduced, the grid traversal is avoided, and the efficiency of the connectivity detection of the matrix grid and the crack is effectively accelerated.

Description

Method, device and medium for detecting connectivity of non-structural matrix grids and cracks
Technical Field
The invention relates to the technical field of rock detection, in particular to a method, a device and a medium for detecting connectivity of a non-structural matrix grid and a crack.
Background
Fractured rocks are widely used in petroleum, geological and geotechnical engineering, and the detection of the connection properties of the fracture and bedrock grids is a necessary step for analyzing various engineering problems and carrying out rock flow simulation.
At present, the traditional rapid connectivity detection technology is developed on the basis of structured grids, and in unstructured grids, three-dimensional data of vertexes of each grid are independent and unrelated, so that the traditional method cannot be used for accelerating the detection process. The unstructured grid is widely used in geological and geotechnical engineering modeling processes in recent years, the geometric complexity of the unstructured grid greatly increases the calculation cost of connectivity detection with internal cracks of the unstructured grid, the whole grid system is frequently required to be traversed for each crack in the unstructured grid, and in the unstructured grid system with the number of millions, the connectivity detection of the unstructured matrix grid and the crack grid at one time usually takes tens of minutes to several hours, so that the efficiency of engineering analysis and simulation is seriously reduced.
Therefore, how to accelerate the connectivity detection process of the unstructured matrix grid and the crack grid is a technical problem to be solved urgently by those skilled in the art.
Disclosure of Invention
In view of the above, the present invention provides a method, an apparatus, and a medium for detecting connectivity between an unstructured matrix grid and a crack, which can avoid traversing the grid, accelerate the calculation process, and effectively accelerate the efficiency of detecting connectivity between the matrix grid and the crack. The specific scheme is as follows:
a method for detecting connectivity of a grid of an unstructured substrate to a fracture, comprising:
generating a spatial index structure of the unstructured matrix mesh; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list;
searching the spatial position of the top point of the crack on the grid tree;
searching and storing the intersection point of the crack edge and the grid surface by using the crack vertex space position and the grid surface adjacency list;
searching and storing intersection points of crack surfaces and grid edges by using the crack vertex space positions and the grid edge adjacency list;
and carrying out spatial ordering on the intersection points stored in each grid to generate the connection relation between the cracks and the grids.
Preferably, in the method for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, the grid tree is composed of multiple layers of coarse grids and fine grids, and each layer of coarse grid node indexes an outer side number of the fine grid composed of the coarse grids; the tree root node of the grid tree is formed by indexes of all boundary grid surfaces; the topmost child leaf node of the mesh tree is a single mesh.
Preferably, in the method for detecting connectivity between a lattice and a crack of an unstructured substrate provided in the embodiment of the present invention, the lattice surface adjacency list stores lattice numbers on two sides of each lattice surface;
the grid edge adjacency list stores grid numbers adjacent to each grid edge.
Preferably, in the method for detecting connectivity between a grid and a fracture of an unstructured substrate provided in an embodiment of the present invention, the searching for a spatial location of a vertex of a fracture on the grid tree includes:
and searching the grid tree for grid numbers of all the vertexes of the crack.
Preferably, in the method for detecting connectivity between a lattice of an unstructured substrate and a crack provided in the embodiment of the present invention, searching for an intersection point between a crack edge and a lattice plane by using the spatial position of a crack vertex and the adjacency list of the lattice plane includes:
according to the spatial position of the crack vertex, taking the grids where all the vertices of the crack are as an initial grid list;
calculating the intersection points of the crack edges and the grid surfaces of all grids in the grid list;
if the intersection exists, storing intersection information and emptying a grid list;
inquiring the grid surface adjacency list, and adding the grid on the other side of the grid surface where the intersection point is located into the grid list to obtain a new grid list;
and continuously calculating the intersection points of the crack edges and the grid surfaces of all the grids in the new grid list until the crack edges and the grid surfaces in the grid list have no intersection points.
Preferably, in the method for detecting connectivity between a lattice of an unstructured substrate and a crack provided in the embodiment of the present invention, searching for an intersection point between a crack surface and a lattice edge by using the spatial position of a crack vertex and the adjacency list of the lattice edge includes:
according to the spatial position of the crack vertex, taking the grids where all the vertices of the crack are as an initial grid list;
calculating the intersection points of the crack surfaces and the grid edges of all grids in the grid list;
if the intersection exists, storing intersection information and emptying a grid list;
inquiring the grid edge adjacency list, and adding the grid adjacent to the intersection point into the grid list to obtain a new grid list;
and continuously calculating the intersection points of the crack surfaces and the grid edges of all the grids in the new grid list until no intersection point exists between the crack surfaces and the grid edges in the grid list.
Preferably, in the method for detecting connectivity of a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, the spatially ordering the intersection points stored in each grid to generate a connection relationship between a crack and a grid includes:
and selecting intersection points of the grid edges, the grid surfaces and the cracks stored in each grid, and sequencing the intersection points in the same grid in space to generate polygons as the connection relation between the cracks and the grids.
The embodiment of the invention also provides a device for detecting the connectivity of the grid and the crack of the non-structural matrix, which comprises:
the index structure generation module is used for generating a spatial index structure of the non-structural matrix grid; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list;
the crack vertex searching module is used for searching the spatial position of the crack vertex on the mesh tree;
the intersection point searching module is used for searching and storing the intersection points of the crack edges and the grid surfaces by utilizing the crack vertex space positions and the grid surface adjacency list; the system is also used for searching and storing intersection points of crack surfaces and grid edges by utilizing the crack vertex space position and the grid edge adjacency list;
and the connection relation generation module is used for carrying out spatial sequencing on the intersection points stored in each grid to generate the connection relation between the cracks and the grids.
The embodiment of the invention also provides a device for detecting the connectivity of the grid and the cracks of the non-structural matrix, which comprises a processor and a memory, wherein the processor executes a computer program stored in the memory to realize the method for detecting the connectivity of the grid and the cracks of the non-structural matrix.
Embodiments of the present invention further provide a computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the method for detecting connectivity between a grid and a crack of an unstructured substrate as provided in embodiments of the present invention.
According to the technical scheme, the method for detecting the connectivity of the grid and the crack of the non-structural matrix, provided by the invention, comprises the following steps: generating a spatial index structure of the unstructured matrix mesh; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list; searching the spatial position of the top point of the crack on the grid tree; searching and storing the intersection point of the crack edge and the grid surface by using the crack vertex space position and the grid surface adjacency list; searching and storing the intersection point of the crack surface and the grid edge by using the crack vertex space position and the grid edge adjacency table; and carrying out spatial ordering on the intersection points stored in each grid to generate the connection relation between the cracks and the grids.
The grid tree, the grid surface adjacency list and the grid edge adjacency list generated by the invention are search auxiliary spatial data index formats designed aiming at the geometric characteristics of the unstructured grid, and the grid surface index tree is matched to position the top points of the cracks, so that the calculation complexity can be effectively reduced, the calculation process is accelerated, the accuracy on the unstructured grid is ensured, then the grids which are possibly intersected around the cracks can be quickly selected by using the grid connection relation, the intersection detection operation is reduced, the grid traversal is avoided, and the efficiency of the detection of the connectivity of the matrix grids and the cracks is effectively accelerated.
In addition, the invention also provides a corresponding device and a computer readable storage medium aiming at the detection method of the connectivity of the grid and the crack of the non-structural matrix, thereby further leading the method to have more practicability, and the device and the computer readable storage medium have corresponding advantages.
Drawings
In order to more clearly illustrate the embodiments of the present invention or technical solutions in related arts, the drawings used in the description of the embodiments or related arts will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flow chart of a method for detecting connectivity of a grid and cracks in an unstructured matrix provided by an embodiment of the present invention;
fig. 2 is a flowchart illustrating a specific process of step S103 in fig. 1 according to an embodiment of the present invention;
fig. 3 is a flowchart illustrating a specific process of step S104 in fig. 1 according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a device for detecting connectivity between a grid and a crack of an unstructured substrate according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention provides a method for detecting the connectivity of a grid and a crack of an unstructured substrate, which comprises the following steps as shown in figure 1:
s101, generating a spatial index structure of the non-structural matrix grid; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list;
before connectivity detection is carried out, firstly, data of an unstructured matrix grid and a fracture network are imported, the matrix grid is usually generated by geological or oil reservoir modeling software and comprises data of geological structures, rock physical properties and the like in a work area range, and the number of the matrix grids in an industrial model is millions to tens of millions; the fracture network is a geometric body formed by all fractures and comprises fracture geometric forms and physical property data in a rock stratum of a work area, each fracture is usually a two-dimensional polygonal plane in a three-dimensional space, and a fracture network model used in engineering usually comprises thousands of fractures.
After the grid and crack data are imported, two spatial index structures of the unstructured grid are generated, wherein the two spatial index structures comprise grid trees based on grid face unit indexes and adjacency information of each grid face and grid edge and surrounding grids. The two types of data structures are search auxiliary index formats designed for geometric features of unstructured grids, and the efficiency of crack connectivity detection can be effectively accelerated by matching with the subsequent steps.
S102, searching the spatial position of the top point of the crack on the grid tree;
specifically, this step searches for a fracture vertex spatial position using the index tree of the unstructured mesh generated in step S101, where the fracture vertex spatial position may be stored for the subsequent steps.
S103, searching and storing intersection points of crack edges and grid surfaces by using the crack vertex space positions and the grid surface adjacency list;
s104, searching and storing intersection points of crack surfaces and grid edges by using the crack vertex space positions and the grid edge adjacency list;
it should be noted that the main idea of the present invention is spatial dichotomy and wavefront advancing method, in which the spatial dichotomy search is accurately implemented on the unstructured grid based on the index tree of the grid surface, and the created grid adjacency information is combined with step S103 and step S104 to implement the forward advancing search of the connection point on the unstructured grid.
And S105, carrying out spatial sequencing on the intersection points stored in each grid to generate the connection relation between the cracks and the grids.
In the method for detecting connectivity between an unstructured matrix mesh and a crack provided in the embodiment of the present invention, the generated mesh tree, the mesh surface adjacency list and the mesh edge adjacency list are search-aided spatial data index formats designed for geometric features of the unstructured mesh, and the mesh surface index tree is used in cooperation with positioning of the crack vertex, so that the computational complexity can be effectively reduced, the computational process is accelerated, the accuracy on the unstructured mesh is ensured, and then the mesh connection relationship is used to quickly select meshes that may intersect around the crack, reduce intersection detection operations, avoid traversing the meshes, and further effectively accelerate the efficiency of detecting connectivity between the matrix mesh and the crack.
In specific implementation, in the method for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, in step S101, the grid tree may be composed of multiple layers of coarse grids and fine grids; the tree root nodes of the grid tree are formed by indexes of all boundary grid surfaces of the model, and the outer side surface numbers of the fine grids formed by the tree root nodes are indexed by each layer of coarse grid nodes from the tree root nodes to the top; the topmost child leaf node of the mesh tree is a single mesh of the model. The coarse mesh is a mesh obtained by coarsening, and the fine mesh is a mesh obtained by non-coarsening or a mesh obtained by thinning. The mesh structure of the mesh tree does not need to combine the fine mesh surfaces when constructing the coarse mesh, and is very suitable for searching the accurate spatial position of the crack vertex on the non-structural mesh.
In addition, in step S101, the mesh plane adjacency table (i.e., mesh plane adjacency information) stores mesh numbers on both sides of each mesh plane; the mesh edge adjacency table (i.e., the mesh edge adjacency information) stores mesh numbers adjacent to each mesh edge.
In specific implementation, in the method for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, the step S102 may be to search a spatial position of a top point of a crack on a grid tree, and specifically includes: and searching the grid tree for grid numbers of all the vertexes of the crack. The invention searches the grid numbers of all the vertexes of the crack, and uses the position relation between the vertex of the crack and the grid surface as a judgment basis, namely judges whether the vertex of the crack is positioned on the same side of all the surfaces of one grid at the same time, thus being suitable for the vertex distribution characteristics of the non-structural grid.
It should be noted that, in the prior art, the method of traversing the mesh is usually used to locate the fracture vertices, and the computation cost of the process is very high for the model with a large number of meshes.
In specific implementation, in the method for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, taking a crack as an example, as shown in fig. 2, step S103 searches for an intersection point between a crack edge and a grid surface by using a crack vertex space position and a grid surface adjacency table, which may specifically include: firstly, according to the spatial position of the top point of the crack, using the mesh in which all the top points of the crack are positioned as an initial mesh list; then, calculating the intersection points of the crack edges and the grid surfaces of all grids in the grid list; if the intersection exists, storing intersection information and emptying a grid list; then, inquiring a grid surface adjacency list, and adding a grid on the other side of the grid surface where the intersection point is located into the grid list to obtain a new grid list; and after the new grid list is obtained, continuously calculating the intersection points of the crack edges and the grid surfaces of all the grids in the new grid list until the crack edges and the grid surfaces in the grid list have no intersection points. This indicates that all the intersections of the crack edges with the grid faces have been detected.
It should be noted that the existing intersection detection technology on the structural grid cannot fully utilize grid connectivity information to accelerate the detection process, but the invention can quickly select the grids possibly intersected around the crack by using the grid connection relation, reduce the intersection detection operation and accelerate the calculation process.
In a specific implementation, in the method for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, taking a crack as an example, as shown in fig. 3, step S104 searches for an intersection point between a crack surface and a grid edge by using a crack vertex space position and a grid edge adjacency table, which may specifically include: firstly, according to the spatial position of the top point of the crack, using the mesh in which all the top points of the crack are positioned as an initial mesh list; then, calculating the intersection points of the crack surfaces and the grid edges of all grids in the grid list; if the intersection exists, storing intersection information and emptying a grid list; then, inquiring a grid edge adjacency list, and adding a grid adjacent to the intersection point into the grid list to obtain a new grid list; and after the new grid list is obtained, continuously calculating the intersection points of the crack surfaces and the grid edges of all the grids in the new grid list until no intersection point exists between the crack surfaces and the grid edges in the grid list. This indicates that all the intersections of the fracture planes with the grid edges have been detected.
It should be noted that, in the above process, the connection relationship between the edges of the unstructured grid is fully utilized, and the intersection detection is performed by using a forward-push method, so that the grid traversal is avoided, and the calculation process is accelerated.
In specific implementation, in the method for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, the step S105 performs spatial ordering on the intersection points stored in each grid to generate a connection relationship between a crack and a grid, which may specifically include: and selecting intersection points of the grid edges, the grid surfaces and the cracks stored in each grid, and sequencing the intersection points in the same grid in space to generate polygons as the connection relation between the cracks and the grids. This enables a quick detection of the connection of the crack on the unstructured grid.
Based on the same inventive concept, the embodiment of the invention also provides a device for detecting the connectivity of the grid and the cracks of the non-structural matrix, and the principle of the device for solving the problems is similar to the method for detecting the connectivity of the grid and the cracks of the non-structural matrix, so the implementation of the device can refer to the implementation of the method for detecting the connectivity of the grid and the cracks of the non-structural matrix, and repeated parts are not described again.
In specific implementation, the apparatus for detecting connectivity between a grid and a crack of an unstructured substrate provided in the embodiment of the present invention, as shown in fig. 4, specifically includes:
an index structure generation module 11, configured to generate a spatial index structure of an unstructured matrix grid; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list;
the crack vertex searching module 12 is configured to search a spatial position of a crack vertex on the mesh tree;
the intersection point searching module 13 is used for searching and storing the intersection points of the crack edges and the grid surfaces by using the crack vertex space positions and the grid surface adjacency list; the method is also used for searching and storing the intersection point of the crack surface and the grid edge by utilizing the crack vertex space position and the grid edge adjacency list;
and the connection relation generation module 14 is configured to perform spatial ordering on the intersection points stored in each grid to generate a connection relation between the crack and the grid.
In the device for detecting the connectivity of the non-structural matrix grid and the cracks provided by the embodiment of the invention, the connection relationship between the cracks and the grid can be finally generated through the interaction of the four modules, and the connectivity of the matrix grid and the cracks is detected by using the connection relationship, so that the grids possibly intersected around the cracks can be quickly selected, the intersection detection operation is reduced, the grid traversal is avoided, the calculation complexity is effectively reduced, the calculation process is accelerated, and the efficiency of detecting the connectivity of the matrix grid and the cracks is effectively accelerated.
For more specific working processes of the modules, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not repeated here.
Correspondingly, the embodiment of the invention also discloses a device for detecting the connectivity of the grid and the cracks of the non-structural matrix, which comprises a processor and a memory; wherein the processor, when executing the computer program stored in the memory, implements the method for detecting connectivity of a grid and cracks of an unstructured matrix disclosed in the previous embodiments.
For more specific processes of the above method, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not repeated here.
Further, the present invention also discloses a computer readable storage medium for storing a computer program; the computer program when executed by the processor implements the method for detecting connectivity of a lattice of unstructured matrix to cracks as disclosed above.
For more specific processes of the above method, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not repeated here.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. The device and the storage medium disclosed by the embodiment correspond to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
To sum up, the method for detecting connectivity between a grid and a crack of an unstructured substrate provided by the embodiment of the invention comprises the following steps: generating a spatial index structure of the unstructured matrix mesh; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list; searching the spatial position of the top point of the crack on the grid tree; searching and storing the intersection point of the crack edge and the grid surface by using the crack vertex space position and the grid surface adjacency list; searching and storing the intersection point of the crack surface and the grid edge by using the crack vertex space position and the grid edge adjacency table; and carrying out spatial ordering on the intersection points stored in each grid to generate the connection relation between the cracks and the grids. The grid tree, the grid surface adjacency list and the grid edge adjacency list generated by the invention are search auxiliary spatial data index formats designed aiming at the geometric characteristics of the unstructured grid, and the grid surface index tree is matched to position the top points of the cracks, so that the calculation complexity can be effectively reduced, the calculation process is accelerated, the accuracy on the unstructured grid can be ensured, the grids which are possibly intersected around the cracks can be quickly selected by using the grid connection relation, the intersection detection operation is reduced, the grid traversal is avoided, and the efficiency of the detection of the connectivity of the matrix grid and the cracks is effectively accelerated. In addition, the invention also provides a corresponding device and a computer readable storage medium aiming at the detection method of the connectivity of the grid and the crack of the non-structural matrix, thereby further leading the method to have more practicability, and the device and the computer readable storage medium have corresponding advantages.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The method, the device and the medium for detecting the connectivity of the non-structural matrix grid and the crack provided by the invention are described in detail above, and the principle and the implementation mode of the invention are explained in the text by applying specific examples, and the description of the above examples is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.

Claims (10)

1. A method for detecting connectivity of a grid and a fracture of an unstructured substrate, comprising:
generating a spatial index structure of the unstructured matrix mesh; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list;
searching the spatial position of the top point of the crack on the grid tree;
searching and storing the intersection point of the crack edge and the grid surface by using the crack vertex space position and the grid surface adjacency list;
searching and storing intersection points of crack surfaces and grid edges by using the crack vertex space positions and the grid edge adjacency list;
and carrying out spatial ordering on the intersection points stored in each grid to generate the connection relation between the cracks and the grids.
2. The method for detecting the connectivity of the grid and the crack of the unstructured matrix according to claim 1, wherein the grid tree is composed of a plurality of layers of coarse grids and fine grids, and each layer of coarse grid node indexes the outer side surface number of the fine grid; the tree root node of the grid tree is formed by indexes of all boundary grid surfaces; the topmost child leaf node of the mesh tree is a single mesh.
3. The method for detecting the connectivity of a lattice of an unstructured substrate to a crack according to claim 2, wherein the lattice surface adjacency list stores lattice numbers on both sides of each lattice surface;
the grid edge adjacency list stores grid numbers adjacent to each grid edge.
4. The method of claim 1, wherein searching the grid tree for fracture vertex spatial locations comprises:
and searching the grid tree for grid numbers of all the vertexes of the crack.
5. The method for detecting the connectivity of the grid and the cracks of the unstructured matrix according to claim 1, wherein the searching for the intersection points of the edges of the cracks and the grid faces by using the spatial positions of the top points of the cracks and the adjacency list of the grid faces comprises:
according to the spatial position of the crack vertex, taking the grids where all the vertices of the crack are as an initial grid list;
calculating the intersection points of the crack edges and the grid surfaces of all grids in the grid list;
if the intersection exists, storing intersection information and emptying a grid list;
inquiring the grid surface adjacency list, and adding the grid on the other side of the grid surface where the intersection point is located into the grid list to obtain a new grid list;
and continuously calculating the intersection points of the crack edges and the grid surfaces of all the grids in the new grid list until the crack edges and the grid surfaces in the grid list have no intersection points.
6. The method for detecting the connectivity of a grid and a crack of an unstructured matrix according to claim 1, wherein the searching for the intersection point of the crack face and the grid edge by using the spatial position of the crack vertex and the adjacency list of the grid edge comprises:
according to the spatial position of the crack vertex, taking the grids where all the vertices of the crack are as an initial grid list;
calculating the intersection points of the crack surfaces and the grid edges of all grids in the grid list;
if the intersection exists, storing intersection information and emptying a grid list;
inquiring the grid edge adjacency list, and adding the grid adjacent to the intersection point into the grid list to obtain a new grid list;
and continuously calculating the intersection points of the crack surfaces and the grid edges of all the grids in the new grid list until no intersection point exists between the crack surfaces and the grid edges in the grid list.
7. The method for detecting the connectivity of the unstructured matrix grids and the cracks according to claim 1, wherein the step of spatially ordering the intersection points stored in each grid to generate the connection relationship of the cracks and the grids comprises the following steps:
and selecting intersection points of the grid edges, the grid surfaces and the cracks stored in each grid, and sequencing the intersection points in the same grid in space to generate polygons as the connection relation between the cracks and the grids.
8. An apparatus for detecting the connectivity of a grid of an unstructured substrate to a fracture, comprising:
the index structure generation module is used for generating a spatial index structure of the non-structural matrix grid; the spatial index structure comprises a grid tree based on grid surface index, a grid surface adjacency list and a grid edge adjacency list;
the crack vertex searching module is used for searching the spatial position of the crack vertex on the mesh tree;
the intersection point searching module is used for searching and storing the intersection points of the crack edges and the grid surfaces by utilizing the crack vertex space positions and the grid surface adjacency list; the system is also used for searching and storing intersection points of crack surfaces and grid edges by utilizing the crack vertex space position and the grid edge adjacency list;
and the connection relation generation module is used for carrying out spatial sequencing on the intersection points stored in each grid to generate the connection relation between the cracks and the grids.
9. An apparatus for detecting connectivity of an unstructured matrix grid with cracks, comprising a processor and a memory, wherein the processor, when executing a computer program stored in the memory, implements a method for detecting connectivity of an unstructured matrix grid with cracks according to any of claims 1 to 7.
10. A computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the method for detecting connectivity of a lattice of unstructured matrix and cracks according to any one of claims 1 to 7.
CN202111181116.6A 2021-10-11 2021-10-11 Method, device and medium for detecting connectivity of non-structural matrix grids and cracks Pending CN113902872A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111181116.6A CN113902872A (en) 2021-10-11 2021-10-11 Method, device and medium for detecting connectivity of non-structural matrix grids and cracks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111181116.6A CN113902872A (en) 2021-10-11 2021-10-11 Method, device and medium for detecting connectivity of non-structural matrix grids and cracks

Publications (1)

Publication Number Publication Date
CN113902872A true CN113902872A (en) 2022-01-07

Family

ID=79191391

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111181116.6A Pending CN113902872A (en) 2021-10-11 2021-10-11 Method, device and medium for detecting connectivity of non-structural matrix grids and cracks

Country Status (1)

Country Link
CN (1) CN113902872A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114492249A (en) * 2022-04-02 2022-05-13 中国空气动力研究与发展中心计算空气动力研究所 Method, system, client and server for generating unstructured grid
CN114549793A (en) * 2022-04-28 2022-05-27 中国空气动力研究与发展中心计算空气动力研究所 Method, medium, and apparatus for reconstructing a structured grid from a two-dimensional unstructured grid
CN114820989A (en) * 2022-06-24 2022-07-29 中国空气动力研究与发展中心计算空气动力研究所 Method for quickly establishing non-structural grid coplanar relation based on inverted index

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104331931A (en) * 2014-10-10 2015-02-04 北京航空航天大学 Geological fracture layer PEBI grid processing method for oil reservoir numerical simulation
CN106326517A (en) * 2015-07-03 2017-01-11 中国石油化工股份有限公司 Layered fracture-matrix hybrid grid modeling method and device
CN112733318A (en) * 2020-11-27 2021-04-30 厦门理工学院 Self-adaptive mesh subdivision method, device, equipment and storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104331931A (en) * 2014-10-10 2015-02-04 北京航空航天大学 Geological fracture layer PEBI grid processing method for oil reservoir numerical simulation
CN106326517A (en) * 2015-07-03 2017-01-11 中国石油化工股份有限公司 Layered fracture-matrix hybrid grid modeling method and device
CN112733318A (en) * 2020-11-27 2021-04-30 厦门理工学院 Self-adaptive mesh subdivision method, device, equipment and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
TONG WANG等: "An efficient and robust fracture-grid and fracture-fracture intersection detection method for polygon fractures in unstructured polyhedral grids", COMPUTERS AND GEOTECHNICS, vol. 2021, no. 134, 25 March 2021 (2021-03-25), pages 1 - 10 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114492249A (en) * 2022-04-02 2022-05-13 中国空气动力研究与发展中心计算空气动力研究所 Method, system, client and server for generating unstructured grid
CN114492249B (en) * 2022-04-02 2022-07-05 中国空气动力研究与发展中心计算空气动力研究所 Method, system, client and server for generating unstructured grid
CN114549793A (en) * 2022-04-28 2022-05-27 中国空气动力研究与发展中心计算空气动力研究所 Method, medium, and apparatus for reconstructing a structured grid from a two-dimensional unstructured grid
CN114820989A (en) * 2022-06-24 2022-07-29 中国空气动力研究与发展中心计算空气动力研究所 Method for quickly establishing non-structural grid coplanar relation based on inverted index

Similar Documents

Publication Publication Date Title
CN113902872A (en) Method, device and medium for detecting connectivity of non-structural matrix grids and cracks
CN110529077B (en) Modeling cross-faults and complex wellbores in reservoir simulation
US20140136171A1 (en) Unstructured Grids For Modeling Reservoirs
US20150212231A1 (en) Process for constructing a volume mesh for modeling geological structures
CA2750093A1 (en) Method for computing and storing voronoi diagrams, and uses therefor
CN109102564B (en) Coupling modeling method for numerical model of complex geologic body
CN107622530B (en) Efficient and robust triangulation network cutting method
WO2015023962A1 (en) Creating a thickness grid for determining reserve estimates for a reservoir
Liu et al. Change detection of mobile LIDAR data using cloud computing
KR20160121997A (en) Spatial knowledge extractor and extraction method
Franklin Applications of analytical cartography
Biljecki et al. Error propagation in the computation of volumes in 3D city models with the Monte Carlo method
CN114429525A (en) Fractured reservoir multi-scale fracture simulation method and computer readable storage medium
NO345620B1 (en) Roughening and splitting techniques for generating grids for simulation of hydrocarbon reservoirs
WO2018053637A1 (en) Geometric modelling for facilitating simulation for manufacturing operations
Wu et al. Research on fault cutting algorithm of the three-dimensional numerical manifold method
CN104008147A (en) Multi-body index construction method for three-dimensional geologic structure model
Wang et al. An efficient and robust fracture-grid and fracture-fracture intersection detection method for polygon fractures in unstructured polyhedral grids
CN115330975A (en) Novel three-dimensional random rough structural surface network model and construction method and device
CN111241221B (en) Automatic matching and high-precision repairing method for damaged terrain coordinate data
CN110135080B (en) Water pollution simulation method and device
EP3451191B1 (en) Computer implemented method for manipulating a numerical model of a 3d domain
CN114491897A (en) Seismic wave numerical simulation method, device, medium and electronic equipment
Bradley Supporting data analytics for smart cities: an overview of data models and topology
Zhang et al. Comparison of 4 vector polygon clipping algorithms in the spatial overlay analysis of GIS using simple feature model

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
CB03 Change of inventor or designer information

Inventor after: Yao Jun

Inventor after: Wang Tong

Inventor before: Wang Tong

Inventor before: Yao Jun