A method and device for identifying a rockfill skeleton pore network and a storage medium

Abstract

The disclosure provides a kind of identification method of rockfill skeleton pore network, comprising: the discretization of rockfill concrete model is carried out using hexahedral voxel, the geometric information of rockfill is mapped to the discretization model, and then the pore space in model is extracted;Based on the extracted pore space, each voxel therein is traversed, the maximum cube in the pore space with each voxel as center is searched, and a maximum cube set is obtained;Based on the maximum cube set, redundant maximum cubes therein are deleted, and each remaining maximum cube corresponds to a pore;Starting from the largest pore, adjacent pores are searched and connected step by step, and in this process, main pores, throats and connection paths are determined, and the identification of rockfill skeleton pore network is completed, wherein the main pore is the largest pore in its neighborhood, and the throat is the pore that simultaneously exists in the communication relationship with multiple main pores.The operation efficiency and accuracy of the identification method of the disclosure are high.

Description

TECHNICAL FIELD

[0001] The present disclosure belongs to the technical field of digital modeling of hydraulic engineering, and particularly relates to a method and device for identifying a rockfill skeleton pore network and a storage medium. BACKGROUND

[0002] Rockfill concrete uses large-diameter block stones directly into the warehouse, and then pours self-compacting concrete into the rockfill skeleton. The high fluidity of self-compacting concrete can fill the pores of the rockfill skeleton only by relying on its own weight without vibration and rolling, thereby forming a complete and dense whole. Rockfill concrete has a broad development prospect in mass concrete engineering due to its high construction efficiency, simple construction process, and low comprehensive cost.

[0003] The pore characteristics of the rockfill skeleton are one of the important factors that determine whether the self-compacting concrete can be uniformly and densely filled. Identifying the pore network structure of the rockfill skeleton can be used to evaluate the quality of block stone stacking and predict the construction quality of self-compacting concrete and rockfill concrete.

[0004] The maximum sphere algorithm is one of the methods for constructing a pore network model. First, the pore space is discretized, and the maximum inscribed sphere centered at any voxel in the pore space is found. The local maximum in the maximum inscribed sphere is identified as a pore, and the minimum sphere connecting the pores is identified as a throat. This algorithm needs to frequently perform floating-point multiplication and square root operations during the search for the maximum inscribed sphere, which is low in computational efficiency. At the same time, since the maximum inscribed sphere searched is actually composed of several voxels, the outermost layer is not a regular spherical surface. When calculating the maximum sphere radius, only the upper or lower bound of the inscribed sphere radius can be selected for corresponding representation, which makes the subsequent operations based on the radius value inaccurate, ultimately affecting the accuracy and precision of the identification of the pore network of the rockfill skeleton. SUMMARY

[0005] The present disclosure aims to overcome the shortcomings of the prior art and provides a method and device for identifying the pore network of a rockfill skeleton and a storage medium, which can quickly identify the pore network structure of the rockfill skeleton, provide a way for extracting the pore characteristics of the rockfill skeleton, and further evaluate the quality of block stone stacking and the construction quality of rockfill concrete.

[0006] The present disclosure provides a method for identifying the pore network of a rockfill skeleton, which comprises the following steps:

[0007] Discretize the rockfill concrete model using hexahedral voxels, map the geometric information of the rockfill to the discretized model, and then extract the pore space in the discretized model;

[0008] Based on the extracted pore space, traverse each voxel in the pore space, search for the maximum cube centered at each voxel in the pore space, and obtain a maximum cube set;

[0009] Based on the maximum cube set, delete the redundant maximum cubes, and each remaining maximum cube corresponds to a pore;

[0010] Starting from the largest size pore, search and connect adjacent pores outward step by step, and divide the main pores, throat and determine the connection path in the process, complete the rockfill skeleton pore network identification, wherein the main pore is the largest size pore in its neighborhood, and the throat is the pore that has a communication relationship with multiple main pores.

[0011] In some embodiments, the hexahedral voxel edge length is not greater than 2% of the rockfill concrete model edge length.

[0012] In some embodiments, the grid mapping method is used to map the geometric information of the rockfill to the discretization model.

[0013] In some embodiments, the search for the maximum cube centered on each voxel in the pore space specifically includes:

[0014] In the discretization model, first, encode each voxel according to its spatial position, define one vertex of the discretization model as the coordinate origin, and the three edges with this vertex as the end point as the x, y, z axes, and ensure that the x, y, z coordinates of the quadrant where the discretization model is located are all non-negative, thereby constructing an xyz coordinate system, in the xyz coordinate system, sort each voxel in the x, y, z direction according to the size of the voxel center point coordinate, then each voxel has a positive integer sequence number in the x, y, z direction, the lower bound of the sequence number is 1, and the upper bound is the integer obtained by dividing the edge length of the discretization model by the edge length of a single voxel, then the sequence number combination obtained by concatenating the sequence numbers of the voxel in the x, y, z directions is used as the encoding of the voxel, and the encoding obtained under this encoding rule is one-to-one corresponding to each voxel;

[0015] When searching for the maximum cube centered on a certain voxel, set the initial maximum cube to include only the certain voxel itself, then increase and decrease the x, y, z direction sequence number of the certain voxel by the same value, that is, realize the outward expansion of the cube with the certain voxel as the center, the above-mentioned increase and decrease value starts from 1 and increases by 1 as a step, and for each outward expansion layer of the cube, two judgments are made: (1) whether the outward expanded cube exceeds the boundary of the discretization model, that is, whether the x, y, z direction sequence number exceeds the upper bound or lower bound; (2) whether the voxels increased due to outward expansion all belong to the pore space; if both of the above two judgments are "yes", then perform this outward expansion operation, otherwise, stop the outward expansion, and regard the cube before this outward expansion as the maximum cube centered on the certain voxel.

[0016] In some embodiments, deleting the redundant maximum cubes in the maximum cube set specifically includes:

[0017] If a voxel set of a certain maximum cube is contained in at least one maximum cube larger than the certain maximum cube, it is indicated that the certain maximum cube belongs to redundant maximum cubes and should be deleted from the maximum cube set.

[0018] In some embodiments, the largest size pore is taken as a starting point, and adjacent pores are searched and connected step by step, based on the following definitions:

[0019] A pore in communication with a certain main pore and not larger than the certain main pore is defined as a descendant of the main pore, and the main pore is the ancestor of the descendant;

[0020] A pore in communication with a certain throat and not larger than the certain throat is defined as a descendant of the certain throat, and the certain throat is the ancestor of the throat descendant;

[0021] Pores other than main pores and throats are collectively referred to as path pores, wherein a plurality of pore chains connected with the main pores and throats are obtained by tracing back to the main pores connected with the throat from the throat step by step, the pore chain is defined as a main connected path, and the path pore on the main connected path is defined as a main path pore; the remaining path pores other than the main path pores fill the remaining pore space other than the main pores, throats and main path pores, and are defined as secondary path pores;

[0022] The level of each pore is defined as follows:

[0023] The level of the main pore is defined as 1, the level of the main pore descendant directly connected with the main pore is defined as 2, the upper level pore of the main pore descendant is the main pore, the pore connected with the main pore descendant with a level of n>1 also belongs to the same main pore descendant, the level of the main pore descendant is n+1, the upper level and ancestor of the main pore are the main pore itself, and the ancestor and upper level of the main pore descendant are only one;

[0024] The throat has a plurality of ancestors, the level of the throat is defined as the minimum value of the levels of the plurality of main connected paths in communication with each ancestor, the level of the throat descendant is increased step by step based on the level of the throat ancestor to which the throat descendant belongs according to the connection level, the ancestor and upper level of the throat are a set composed of a plurality of pores, and the length of the upper level set and the ancestor set are equal and not less than 2, and the ancestor and upper level of the throat descendant are only one;

[0025] If both the two pores meet the requirement ① and the requirement ②, it is determined that the two pores meet the connection condition, otherwise, it is determined that the two pores do not meet the connection condition; wherein, the requirement ①: the two pores have at least one common voxel, or the two pores have face-to-face contact, or the two pores have edge-to-edge contact; the requirement ②: at least one of the two pores has no ancestor before connection, or both the two pores have ancestors before connection, but the ancestors are different.

[0026] In some embodiments, the connecting the adjacent pores specifically comprises:

[0027] Step 41: constructing list A and list B for storing the pores which have been identified and the pores which have not been identified respectively, and constructing an empty list link for recording the connection between the main pores;

[0028] Step 42: setting four pore category marks: zk-main pore, zh-main pore ordinary descendant, h-throat, and hh-throat descendant; the classification criteria of the main pore, the throat and the throat descendant are consistent with the foregoing definition, and the main pore ordinary descendant is the pore which is neither the throat nor the throat descendant in the main pore descendants;

[0029] Assigning initial values to the four parameters of the level, the category, the superior and the ancestor of all the pores, which are +∞, 0, empty, and empty respectively, storing the parameters of all the pores into list B to complete the initialization of list B, and initializing list A as an empty list;

[0030] Step 43: sorting all the pores in list B according to the size from large to small, and the level from small to large under the same size;

[0031] Step 44: taking the first pore in list B as pore i; if pore i has no ancestor, i.e. the second parameter of pore i is 0, then it is determined that pore i is a main pore, and the four parameters of pore i are updated as 1, zk, i, and i, otherwise, the four parameters of pore i remain unchanged, and the four parameters of pore i are recorded as a1, a2, a3, and a4, a2; the connection relationship between pore i and the remaining pores in list B is identified in turn, and a certain remaining pore in list B which is currently participating in the identification is recorded as pore j, and the four parameters of pore j are b1, b2, b3, and b4; if pore i and pore j meet the connection condition, then the four parameters of pore j and list link are updated according to the category of pore i and pore j and the connection between their ancestors, if pore i and pore j do not meet the connection condition, then the four parameters of pore j and list link remain unchanged, then the connection relationship between pore i and the next remaining pore in list B is judged according to the same operation, until the connection relationship between pore i and the last remaining pore in list B is judged;

[0032] Step 45: putting pore i into list A, and deleting pore i from list B;

[0033] Step 46: continuously repeat steps 43-45 until list B is empty, and the identification of all pores is completed;

[0034] Step 47: starting from the throat, trace back to the connected main pore through the superior pores recorded in list A, to obtain the main connected path and the main path pores thereon, and further obtain the secondary path pores other than the main pore, the throat and the main path pores, to obtain the rockfill skeleton pore network.

[0035] In some embodiments, the step 44 specifically comprises:

[0036] Step 441: take the first pore in list B as pore i, if pore i has no ancestor, determine pore i as a main pore, and update the four parameters of pore i as 1, zk, i, i, otherwise, maintain the four parameters of pore i unchanged, and record the four parameters of pore i as a1, a2, a3, a4 respectively;

[0037] Step 442: set a loop variable k, and take the initial value as 2;

[0038] Step 443: determine whether k is greater than the length of list B, if k is not greater than the length of list B, take the kth pore in list B as pore j, record the four parameters of pore j as b1, b2, b3, b4 respectively, and execute step 444, if k is greater than the length of list B, the identification of pore i is completed, and step 45 is executed;

[0039] Step 444: determine whether pore j and pore i satisfy the connection condition, if yes, execute step 445, if not, execute step 446;

[0040] Step 445: pore j becomes a connected pore, according to the categories of pore i and pore j, there are 8 different processing methods, which are as follows:

[0041] (i) if a2 = zk or a2 = zh, b2 = 0, pore j is absorbed as the ordinary descendant of pore i, and the four parameters of pore j are updated as a1+1, zh, i, a4 respectively;

[0042] (ii) if a2 = zk or a2 = zh, b2 = zh, and there is no connection record of a4 and b4 in list link, b1 takes the smaller value of a1+1 and b1, b2 is changed to h, pore i is added to b3, a4 is added to b4, and finally, all pore connections of a4 and b4 in list link are recorded;

[0043] (iii) if a2 = zk or a2 = zh, b2 = h, and there is no record of connectivity between at least one of a4 and b4, then b1 takes the smaller of a1 + 1 and b1, hole i is added to b3, a4 is added to b4, and finally, a record is made in the list link that all holes in a4 and b4 are connected;

[0044] (iv) if a2 = zk or a2 = zh, b2 = hh, and there is no record of connectivity between at least one of a4 and all ancestors of b4, then b1 takes the smaller of a1 + 1 and b1, b2 is changed to h, hole i is added to b3, b4 is updated to be the part of a4 and ancestors of b4 that are not connected to a4, and finally, a record is made in the list link that all ancestors of a4 and b4 are connected;

[0045] (v) if a2 = h, b2 = 0, then hole j is absorbed as a descendant of hole i, and the four parameters of hole j are updated to be a1 + 1, hh, i, i, respectively;

[0046] (vi) if a2 = h, b2 = zh, and there is no record of connectivity between at least one of a4 and b4, then b1 takes the smaller of a1 + 1 and b1, b2 is changed to h, holes in a4 that are not connected to b4 are added to b4, the corresponding upper hole of the added hole is added to b3, and finally, a record is made in the list link that b4 and all holes in a4 are connected;

[0047] (vii) if a2 = hh, b2 = 0, then hole j is absorbed as a descendant of hole i, and the four parameters of hole j are updated to be a1 + 1, hh, i, a4, respectively;

[0048] (viii) if a2 = hh, b2 = zh, and there is no record of connectivity between at least one of b4 and all ancestors of a4, then b1 takes the smaller of a1 + 1 and b1, b2 is changed to h, holes in the ancestors of a4 that are not connected to b4 are added to b4, hole i is added to b3, and finally, a record is made in the list link that b4 and all ancestors of a4 are connected;

[0049] After the above judgment is completed, step 446 is executed;

[0050] Step 446: increase the loop variable k by 1, and return to step 443.

[0051] The second aspect of the present application provides a device for identifying according to any one of the embodiments of the first aspect of the present application, comprising:

[0052] The first module is configured to discretize the rockfill concrete model by using hexahedral voxels, map the geometric information of the rockfill to the discretized model, and then extract the pore space in the discretized model.

[0053] The second module is configured to search for a maximum cube set based on the extracted pore space, and each voxel in the pore space is traversed to search for a maximum cube centered on each voxel in the pore space;

[0054] The third module is configured to delete redundant maximum cubes based on the maximum cube set, and each remaining maximum cube corresponds to a pore;

[0055] The fourth module is configured to search and connect adjacent pores outward step by step from the largest pore, and in the process, the main pores, the throat openings and the connection paths are divided, so as to complete the identification of the rockfill skeleton pore network, wherein the main pore is the largest pore in the neighborhood, and the throat opening is a pore that simultaneously exists in a communication relationship with a plurality of main pores.

[0056] The third aspect of the present application provides a computer readable storage medium, the computer readable storage medium stores computer instructions, and the computer instructions are used to make the computer execute the identification method according to any one of the embodiments of the first aspect of the present application.

[0057] Compared with the prior art, the present disclosure has the following characteristics and beneficial effects:

[0058] (1) The identification method, device and storage medium for the rockfill skeleton pore network provided by the present disclosure discretize and digitize the complex and continuous real problem, realize the identification of the main pores and the throat openings in the rockfill skeleton pore space, and depict the rockfill skeleton pore network, thereby laying a foundation for subsequent evaluation and numerical analysis of the rockfill concrete filling.

[0059] (2) The identification method, device and storage medium for the rockfill skeleton pore network provided by the present disclosure select to use a cube to depict a pore based on the hexahedral voxel features used. On the one hand, the pore shape is regular, the pore size can be represented by the side length, and the modeling process is accurate. On the other hand, only integer addition and subtraction operations are involved in the process of searching and connecting the maximum cubes, and the operation efficiency is high.

[0060] (3) The identification method, device and storage medium for the rockfill skeleton pore network provided by the present application, step 4, i.e., the identification of the pore type and the completion of the pore connection, through the four types of markers, i.e., zk-main pore, zh-main pore ordinary descendant, h-throat opening, and hh-throat opening descendant, the classification of the main pores, the throat openings and the path pores connecting the main pores and the throat openings can be finally completed after one identification operation on the entire pore set, without the need for repeated path merging and other operations, and the pore network identification efficiency is higher. BRIEF DESCRIPTION OF DRAWINGS

[0061] Figure 1is a general flowchart of a method for identifying a rockfill skeleton pore network according to an embodiment of the first aspect of the present disclosure;

[0062] Figure 2 is a schematic diagram of a discretized rockfill skeleton according to an embodiment of the first aspect of the present disclosure;

[0063] Figure 3 are respectively an external view and a partial cutaway view of a discretized pore space according to an embodiment of the first aspect of the present disclosure;

[0064] Figure 4 is a schematic diagram of a main pore, a throat, and their connection relationship according to an embodiment of the first aspect of the present disclosure;

[0065] Figure 5 is a flowchart of pore connection and pore network identification (step 4) according to an embodiment of the first aspect of the present disclosure;

[0066] Figure 6 is a main structure diagram of a pore network according to an embodiment of the first aspect of the present disclosure;

[0067] Figure 7 are respectively an external view and a partial cutaway view of a complete pore network obtained by using the method for identifying according to an embodiment of the first aspect of the present disclosure;

[0068] Figure 8 is a structural schematic diagram of an electronic device according to an embodiment of the third aspect of the present disclosure.

[0069] Reference Signs:

[0070] 1-main pore, 2-throat, 3-main path pore, 4-secondary path pore. DETAILED DESCRIPTION

[0071] In order to make the purpose, technical scheme and advantages of the present application clearer, the present application is described in further detail below in combination with the drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and do not limit the present application.

[0072] On the contrary, the present application covers any alternative, modification, equivalent method and scheme defined by the claims on the essence and scope of the present application. Further, in order to make the public better understand the present application, some specific details are described in detail in the following detailed description of the present application. The present application can also be completely understood without the description of these details by those skilled in the art.

[0073] A method for identifying a rockfill skeleton pore network, a device, and a storage medium are provided in the embodiments of the present disclosure, which are described in detail below in combination with the drawings and specific embodiments.

[0074] As shown in the figure, the method for identifying a rockfill skeleton pore network according to the first aspect of the present disclosure comprises the following steps: Figure 1

[0075] Step 1: Discretize the rockfill concrete model using hexahedral voxels, map the geometric information of the rockfill to the discretized model based on the grid mapping method, and then extract the pore space in the discretized model. Figure 2 is a discretized rockfill skeleton graph, Figure 3 is a discretized pore space graph, wherein (a) is an external view of the pore space, and (b) is a partial cut view of the pore space.

[0076] Optionally, the length of the hexahedral voxel is set to be not greater than 2% of the length of the rockfill concrete model. The smaller the length of the hexahedral voxel is set, the more accurate the identification result is, but the calculation cost is increased. Preferably, it can be set to 1% to 2% of the length of the rockfill concrete model to achieve high rockfill geometric mapping accuracy and pore network identification accuracy. In one specific embodiment of the present disclosure, the length of the rockfill concrete cube model is 150 mm, and the length of the hexahedral voxel is 2 mm.

[0077] Optionally, the shape of the rockfill is spherical with a diameter of 40 to 50 mm. The mapping operation is performed by calculating the distance d between the center point of the voxel and the center of the rockfill sphere and comparing it with the radius of the sphere. If the calculated distance d is less than the radius of the sphere, it is determined that the voxel belongs to the rockfill space, otherwise it belongs to the pore space. The rockfill can also be non-spherical, and the mapping rule can be adjusted accordingly according to the shape of the rockfill.

[0078] Step 2: Based on the pore space extracted in step 1, each voxel in the pore space is traversed to search for the largest cube centered at each voxel in the pore space, and a set of largest cubes is obtained.

[0079] ​Specifically, in the discretization model, first, each voxel is coded according to the spatial position of the voxel, and the coding rule is as follows: one vertex of the rockfill concrete cubic model is defined as the coordinate origin, three edges with the vertex as the end point are defined as the x, y and z axes, and it is ensured that the x, y and z coordinates of the quadrant in which the rockfill concrete cubic model is located are all non-negative. In the above coordinate system, each voxel is sorted in the x, y and z directions according to the size of the voxel center point coordinate, and then each voxel has a positive integer sequence number in the x, y and z directions, the lower bound of the sequence number is 1, and the upper bound is an integer obtained by dividing the length of the rockfill concrete model by the length of the hexahedral voxel. Then, the small value is aligned by padding '0' according to the number of bits of the maximum sequence number, for example, in one specific embodiment of the disclosure, the maximum sequence number in a single direction is '75', and the sequence number '1' needs to be padded to '01'. Finally, the sequence number combination obtained by splicing the sequence numbers of the voxels in the x, y and z directions after padding '0' is taken as the coding of the voxel, and the coding obtained based on the above coding rule corresponds to each voxel one by one. When searching for the maximum cubic body centered on a certain voxel, it is assumed that the initial maximum cubic body only includes the certain voxel itself, and then the sequence numbers of the certain voxel in the x, y and z directions are increased and decreased by the same value, that is, the cubic body is expanded outward with the certain voxel as the center. The value of the increase and decrease starts from 1 and increases by 1 as a step, and for each layer of expansion, two judgments are made: (1) whether the expanded cubic body exceeds the model boundary, that is, whether the sequence numbers in the x, y and z directions exceed the upper bound or lower bound; (2) whether the voxels added due to the expansion all belong to the pore space. If both of the above two judgments are 'yes', the expansion operation is performed, otherwise, the expansion is stopped, and the cubic body before this expansion is regarded as the maximum cubic body centered on the certain voxel.

[0080] Step 3: Based on the maximum cubic body set obtained in step 2, delete the redundant maximum cubic body, and the remaining maximum cubic body corresponds to a pore.

[0081] Specifically, if the voxel set of a certain maximum cubic body is contained in at least one maximum cubic body larger than the certain maximum cubic body, it indicates that the certain maximum cubic body belongs to the redundant maximum cubic body and should be deleted from the maximum cubic body set. Each maximum cubic body in the maximum cubic body set after deleting the redundant maximum cubic body corresponds to a pore.

[0082] Step 4: For all pores obtained in step 3, starting from the largest pore, search and connect adjacent pores outward step by step, and in this process, divide the main pore and the throat and determine the connection path to complete the pore network identification.

[0083] Specifically, the pore network finally identified by the disclosure includes 4 types of pores, namely main pores, throats, main path pores and auxiliary path pores, and the definitions of each type of pore are as follows:

[0084] The main pore is the pore with the largest size in its neighborhood, and the pore connected with the main pore and with a size not larger than the main pore is defined as the descendant of the main pore, and the main pore is the ancestor of the descendant;

[0085] The throat is a special descendant of the main pore, and if a pore is connected with multiple main pores, it is defined as a throat. Similar to the main pore descendant, the pore connected with the throat and with a size not larger than the throat is defined as the descendant of the throat, and the throat is the ancestor of the throat descendant.

[0086] The main path pore and the secondary path pore are collectively referred to as the path pore, including the remaining pores except the main pore and the throat. A plurality of pore chains connected with the main pore and the throat can be obtained by tracing the upper level pore from the throat, and the pore chain is defined as the main connected path, and the path pore on the main connected path is defined as the main path pore. The remaining path pore is filled with the remaining pore space except the main pore, the throat and the main path pore, and is defined as the secondary path pore.

[0087] Further, the levels of the pores are defined as follows: the level of the main pore is 1, the level of the main pore descendant directly connected with the main pore is 2, the upper level pore of the main pore descendant is the main pore, the pore connected with the main pore descendant with a level of n (n>1) also belongs to the same main pore descendant with a level of n+1, and the upper level pore of the main pore descendant with a level of n is the main pore descendant with a level of n. The level of the throat is the minimum value of the levels of the multiple main connected paths in which the throat is connected with the respective ancestors, for example, a throat has two ancestors, the level of the first ancestor connected with the throat is 3, and the level of the other ancestor connected with the throat is 5, and the level of the throat is finally 3. The level of the throat descendant is increased by one level based on the level of the ancestor of the throat to which the throat descendant belongs.

[0088] Further, if two pores meet requirements ① and ②, it is determined that the connection condition is met, otherwise, it is determined that the connection condition is not met; wherein, requirement ①: the two pores have at least one common voxel, or the two pores have face-to-face contact, or the two pores have edge-to-edge contact; requirement ②: at least one of the two pores has no ancestor before connection, or both of the two pores have ancestors before connection, but the ancestors are different.

[0089] Figure 4 is a schematic diagram of the connection relationship between the main pore and the throat, Figure 4 the double arrow line segment in indicates that the two pores meet the connection condition, Figure 4 the throat shown in is the descendant of the main pore I and the main pore II.

[0090] Further, in the identification process of step 4, the category of each pore is marked: zk-main pore, zh-main pore common descendant, h-throat, and hh-throat descendant. The classification criteria of main pore, throat, and throat descendant are consistent with the foregoing definitions, and the main pore common descendant is the pore in the main pore descendants which is neither throat nor throat descendant. The main pore is not changed after being marked, and the pore temporarily marked as "zh" or "hh" can be changed to "h" if the condition of becoming a throat is detected subsequently. In the identification process of step 4, four parameters of the pore are recorded, which are level, category, superior, and ancestor. The ancestor of the pore with category "zk", "zh", and "h" is recorded as the main pore which has a communication relationship with the pore, and the ancestor of the pore with category "hh" is recorded as the throat which has a communication relationship with the pore. The superior and ancestor of the main pore are both itself, and the superior and ancestor of the pore with category "zk", "zh", and "hh" are only one, i.e. a superior pore and a main pore or a throat. For the throat, its superior and ancestor are a set of multiple pores, and the superior set and the ancestor set are equal in length and not less than 2.

[0091] Figure 5 is a flow chart of the specific implementation process of step 4, which includes the following steps:

[0092] Step 41: Construct list A and list B to store the pores which have completed identification and have not completed identification respectively, and construct an empty list link to record the communication between main pores.

[0093] Step 42: Assign initial values to the four parameters of level, category, superior, and ancestor of all pores, which are +∞, 0, empty, and empty respectively, and then store the parameters of all pores in list B to complete the initialization of list B. The initial length of list B is equal to the number of pores obtained in step 3, and list A is initialized as an empty list.

[0094] Step 43: Sort all pores in list B according to the size from large to small, and the level from small to large under the same size.

[0095] Step 44: Take the first pore in list B, denoted as pore i; if pore i has no ancestor, i.e., the second parameter of pore i is 0, then determine that pore i is a main pore, and update the four parameters of pore i to 1, zk, i, i, otherwise, maintain the four parameters of pore i unchanged, denoted as a1, a2, a3, a4; sequentially identify the connection relationship between pore i and the remaining pores in list B, and denote a certain remaining pore in list B as pore j, and the four parameters of pore j as b1, b2, b3, b4; if pore i and pore j satisfy the connection condition, then update the four parameters of pore j and list link according to the categories of pore i and pore j and the connection between their ancestors; if pore i and pore j do not satisfy the connection condition, then maintain the four parameters of pore j and list link unchanged; then, determine the connection relationship between pore i and the next remaining pore in list B according to the same operation, until the connection relationship between pore i and the last remaining pore in list B is determined.

[0096] Step 45: Place pore i into list A and delete it from list B.

[0097] Step 46: Continuously repeat steps 43-45 until list B is empty, and complete the identification of all pores.

[0098] Step 47: Starting from the throat (the present disclosure does not have strict requirements for which throat to start from, i.e., any throat can be started from), the superior pore recorded in list A can be traced to the connected main pore level by level, i.e., the main connected path and the main path pore thereon are obtained, and then the remaining pores except the main pore, throat and main path pore, i.e., the secondary path pore, are obtained, finally the connection of pores and the identification of pore types in the rockfill skeleton pore network are completed, and the rockfill skeleton pore network is obtained.

[0099] Further, the specific implementation process of step 44 includes:

[0100] Step 441: Take the first pore in list B, denoted as pore i; if pore i has no ancestor, then determine that pore i is a main pore, and update the four parameters of pore i to 1, zk, i, i, otherwise, maintain the four parameters of pore i unchanged, denoted as a1, a2, a3, a4.

[0101] Step 442: Set a loop variable k and take the initial value as 2;

[0102] Step 443: Determine whether k is greater than the length of list B; if k is not greater than the length of list B, then take the kth pore in the current list B, denoted as pore j, and denote the four parameters of pore j as b1, b2, b3, b4, and execute step

[0103] Step 444: If k is greater than the length of list B, then maintain the four parameters of pore j and list link unchanged, and then determine the connection relationship between pore i and the next remaining pore in list B according to the same operation, until the connection relationship between pore i and the last remaining pore in list B is determined.

[0104] 444; if k is greater than the length of list B, the identification of pore i is completed, and step 45 is executed;

[0105] Step 444: determine whether pore j and pore i satisfy the connection condition, if yes, step 445 is executed, if not, step 446 is executed;

[0106] Step 445: pore j becomes a connected pore, and there are 8 different processing methods according to the different categories of pore i and pore j, which are as follows:

[0107] (i) if pore i is a main pore or a main pore ordinary descendant (i.e. a2 = zk or a2 = zh), and pore j has not been processed (i.e. b2 = 0), operation 1 is executed: pore j is absorbed as an ordinary descendant of pore i, and the four parameters of pore j are updated as a1 + 1, zh, i, and a4.

[0108] (ii) if pore i is a main pore or a main pore ordinary descendant, pore j is a main pore ordinary descendant (i.e. b2 = zh), and the ancestor of pore i (i.e. a4) and the ancestor of pore j (i.e. b4) do not exist in the connection record in list link, operation 2 is executed: the level of pore j (i.e. b1) takes the smaller value of the level of pore i (i.e. a1 + 1) and the level of pore j (i.e. b1), the category of pore j (i.e. b2) is changed to h, pore i is added to the upper pore of pore j (i.e. b3), a4 is added to b4, and finally, the connection between a4 and all ancestors of pore j is recorded in list link.

[0109] (iii) if pore i is a main pore or a main pore ordinary descendant, pore j is a throat (i.e. b2 = h), and a4 does not exist in the connection record with at least one of all ancestors of pore j, operation 3 is executed: b1 takes the smaller value of a1 + 1 and b1, pore i is added to b3, a4 is added to b4, and finally, the connection between a4 and all ancestors of pore j is recorded in list link.

[0110] (iv) if pore i is a main pore or a main pore ordinary descendant, pore j is a throat descendant (i.e. b2 = hh), and a4 does not exist in the connection record with at least one of all ancestors of b4 (i.e. a certain throat), operation 4 is executed: b1 takes the smaller value of a1 + 1 and b1, b2 is changed to h, pore i is added to b3, b4 is updated to the part of the ancestors of pore a4 and b4 that is not connected with a4, and finally, the connection between a4 and all ancestors of b4 is recorded in list link.

[0111] (v) If pore i is a throat (i.e. a2 = h) and pore j has not been identified before, perform operation 5: pore j is absorbed as a descendant of pore i, and the four parameters of pore j are updated as a1 + 1, h, i, i, respectively.

[0112] (vi) If pore i is a throat, pore j is a main pore ordinary descendant, and at least one of the ancestors of pore i does not have a record of connectivity with b4, perform operation 6: b1 takes the smaller value of a1 + 1 and b1, b2 is changed to h, the pores in a4 that are not connected with b4 are added to the ancestors of pore j, the corresponding upper-level pores of the added pores are added to b3, and finally, a record of connectivity between b4 and all the ancestors of pore i is recorded in the list link.

[0113] (vii) If pore i is a throat descendant (i.e. a2 = h) and pore j has not been identified before, perform operation 7: pore j is absorbed as a descendant of pore i, and the four parameters of pore j are updated as a1 + 1, h, i, a4, respectively.

[0114] (viii) If pore i is a throat descendant, pore j is a main pore ordinary descendant, and b4 does not have a record of connectivity with at least one of the ancestors of a4 (i.e. a certain throat), perform operation 8: b1 takes the smaller value of a1 + 1 and b1, b2 is changed to h, the part of the ancestors of a4 that are not connected with b4 is added to the ancestors of pore j, pore i is added to the upper-level set of pore j, and finally, a record of connectivity between b4 and all the ancestors of a4 is recorded in the list link.

[0115] After the above judgment, step 446 is performed.

[0116] Step 446: increase the loop variable k by 1, and return to step 443.

[0117] Through the above operations, all pores can be connected, and the pore type recognition can be completed, and finally all pores are divided into four categories: main pores, throats, main path pores, and secondary path pores. Figure 6 The main structure of the pore network is shown, which is composed of a main pore 1, a throat 2, and a main path pore 3. Figure 7 The complete rockfill concrete rockfill skeleton pore network is shown, which is composed of a main pore 1, a throat 2, a main path pore 3, and a secondary path pore 4. Figure (a) and figure (b) correspond to the external view and the local cut view of the model, respectively.

[0118] The steps 441 to 446 are core steps for realizing the identification of the rockfill skeleton pore network. Four types of labels, i.e., zk-main pore, zh-main pore common descendant, h-throat, and hh-throat descendant, are set. Different operations are taken when the pores of different types of labels are connected. After one identification operation on the whole pore set, the classification of the main pore, the throat, and the path pore can be finally completed without repeated path merging and other operations, and the pore network identification efficiency is high.

[0119] The existing pore network identification method adopts hexahedral voxel discretization of the pore space and adopts a sphere to describe the pore shape. The identification method of the rockfill skeleton pore network of the rockfill concrete proposed in the disclosure adopts hexahedral voxel discretization of the rockfill concrete model and adopts a cube to describe the pore shape. The selected pore shape is more consistent with the voxel. On the one hand, the cube pore shape formed by the hexahedral voxel is regular and unified, and the pore size is easy to quantitatively describe, which can ensure that the modeling process is more accurate. On the other hand, since the geometry of the cube pore is simpler than that of the sphere, only integer addition and subtraction operations are involved in the process of searching for the maximum cube, deleting the redundant maximum cube to obtain the pore set, and finally connecting the pores. If the sphere is used to describe the pore, the square and open operations need to be frequently performed. Therefore, the pore network identification method proposed in the disclosure is superior to the prior art in terms of modeling accuracy and operation efficiency.

[0120] The second aspect embodiment of the disclosure provides a rockfill skeleton pore network identification device, which comprises:

[0121] The first module is configured to discretize the rockfill concrete model by using hexahedral voxels, map the geometric information of the rockfill to the rockfill concrete model by using the grid mapping method, and then extract the pore space in the rockfill concrete model.

[0122] The second module is configured to search for the maximum cube centered on each voxel in the pore space based on the extracted pore space, obtain a maximum cube set, and delete the redundant maximum cube in the maximum cube set.

[0123] The third module is configured to delete the redundant maximum cube in the maximum cube set based on the obtained maximum cube set, and each remaining maximum cube corresponds to a pore.

[0124] The fourth module is configured to start from the pore with the largest size, search and connect adjacent pores step by step, divide the main pore and the throat, and determine the connection path in the process, and complete the pore network identification, wherein the main pore is the pore with the largest size in its neighborhood, and the throat is the pore that simultaneously exists in the communication relationship with multiple main pores.

[0125] It should be noted that the foregoing embodiment of the method for identifying a rockfill skeleton pore network is also applicable to the identification device of the present embodiment, and thus will not be described herein again.

[0126] To implement the foregoing embodiment, the present embodiment also proposes a computer readable storage medium having a computer program stored thereon, the program being executed by a processor to perform the method for identifying a rockfill skeleton pore network of the foregoing embodiment.

[0127] Reference will now be made to the drawings, of which: Figure 8 shows a structural schematic diagram of an electronic device suitable for implementing the present embodiment. It should be noted that the electronic device in the present embodiment can include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Tablet Personal Computers), PMPs (Portable Multimedia Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, servers, and the like. Figure 8 The electronic device shown is merely an example and should not impose any limitation on the functions and use range of the present embodiment.

[0128] As shown in Figure 8 , the electronic device can include a processing device (such as a central processing unit, a graphics processing unit, or the like) 101, which can perform various appropriate actions and processes according to programs stored in a read-only memory (ROM) 102 or loaded from a storage device 108 into a random access memory (RAM) 103. Various programs and data required for operation of the electronic device are also stored in the RAM 103. The processing device 101, the ROM 102, and the RAM 103 are connected to each other through a bus 104. An input / output (I / O) interface 105 is also connected to the bus 104.

[0129] Generally, the following devices can be connected to the I / O interface 105: input devices 106 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, and the like; output devices 107 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, and the like; storage devices 108 including, for example, a magnetic tape, a hard disk, and the like; and communication devices 109. The communication devices 109 can allow the electronic device to communicate with other devices wirelessly or by wire to exchange data. Although Figure 8 The electronic device is shown with various devices, but it should be understood that it is not required to implement or have all of the devices shown. More or less devices can alternatively be implemented or included.

[0130] In particular, according to embodiments of the present disclosure, the processes described above with reference to the flowcharts can be implemented as a computer software program. For example, the embodiments include a computer program product comprising a computer program carried on a computer readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network by the communication device 109, or installed from the storage device 108, or installed from the ROM 102. When the computer program is executed by the processing device 101, the above-mentioned functions defined in the methods of the embodiments of the present disclosure are performed.

[0131] Note that the computer readable medium described above in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination thereof. The computer readable storage medium may, for example, be, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or apparatus, or any suitable combination of the above. More specific examples of the computer readable storage medium can include, but are not limited to, an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, the computer readable storage medium can be any tangible medium that contains or stores a program that can be used by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, the computer readable signal medium can include a data signal carried in a baseband or as part of a carrier wave, in which the computer readable program code is carried. Such a propagated data signal can take any of a variety of forms, including but not limited to electro-magnetic, optical, or any suitable combination thereof. The computer readable signal medium can also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer readable medium can be transmitted by any suitable medium, including but not limited to wire, cable, RF (radio frequency), or any suitable combination thereof.

[0132] The computer readable medium described above can be included in the electronic device described above; or can exist separately from the electronic device and not be assembled into the electronic device.

[0133] The computer readable medium described above carries one or more programs, which, when executed by the electronic device, cause the electronic device to perform the identification method of the rockfill skeleton pore network described above.

[0134] Computer program code for carrying out operations of the present disclosure can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++, Python, or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0135] In the description of the specification, the description of the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" and the like means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present application. In the specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Also, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in any one or more embodiments or examples. In addition, the person skilled in the art can combine and combine the different embodiments or examples described in the specification and the features of the different embodiments or examples, without contradiction.

[0136] In addition, the terms "first", "second", etc. are used only for the purpose of description and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the technical features indicated. Therefore, the features defined with "first", "second" can explicitly or implicitly include at least one of the features. In the description of the present application, the meaning of "a plurality of" is at least two, for example, two, three, etc., unless otherwise specifically limited.

[0137] Any process or method descriptions or descriptions of the flow diagrams in the specification or otherwise described herein can be understood as representing code modules, segments, or portions of code which include one or more executable instructions for implementing specific logic functions (or steps) in the process, and the various embodiments of the application can include additional or fewer functions (or steps) in the process, and the functions (or steps) can be performed in the sequence shown or in other sequences, in an alternate order, or in parallel, depending on the implementation and the functions (or steps) involved.

[0138] The logic and / or steps represented in the flowcharts and / or described herein, for example, can be considered as a sequence of instructions to implement logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, apparatus, or device, such as a computer-based system, processor- based system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For purposes of this specification, a "computer-readable medium" can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-readable medium can be a computer- readable storage medium or a computer-readable signal medium. The computer-readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include the following: an electrical connection having one or more wires (electrical connections), a portable computer diskette (a magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, and a portable compact disc read-only memory (CDROM). In addition, the computer-readable medium can even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, for example, via optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and stored in a computer memory.

[0139] It should be understood that aspects of the application can be implemented in hardware, software, firmware or combinations thereof. In the above embodiments, the various steps or methods can be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, and in another embodiment, any of the following technologies, known in the art, or their combinations can be used: discrete logic circuitry having logic gates for implementing logic functions on data signals, application specific integrated circuits having appropriate combinational logic gates, programmable gate arrays (PGA), field programmable gate arrays (FPGA), and the like.

[0140] Those skilled in the art can understand that all or part of the steps carried out by the above-mentioned embodiments can be completed by programs instructing related hardware, and the developed programs can be stored in a computer-readable storage medium, and the programs include one or a combination of the steps of the method embodiments when executed.

[0141] In addition, each of the functional units in the various embodiments of the present application can be integrated in one processing module, or each of the units can be physically present separately, or two or more units can be integrated in one module. The integrated module can be implemented in the form of hardware or in the form of a software functional module. When the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can also be stored in a computer readable storage medium.

[0142] The storage medium mentioned above can be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it should be understood that the above embodiments are exemplary and should not be construed as limiting the present application, and those skilled in the art can make changes, modifications, replacements and variations to the above embodiments within the scope of the present application.

Claims

1. A method of identifying a rockfill framework pore network, characterized by, The method comprises the following steps: Discretize the rockfill concrete model by using hexahedral elements, map the geometric information of the rockfill to the discretized model, and then extract the pore space in the discretized model; Based on the extracted pore space, search for the maximum cube centered at each voxel in the pore space to obtain a maximum cube set; Based on the maximum cube set, delete the redundant maximum cubes to obtain the remaining maximum cubes, each of which corresponds to a pore; Start from the largest pore, search and connect adjacent pores outward level by level, divide the main pores, throats and determine the connection path in the process, and complete the identification of the rockfill skeleton pore network, wherein the main pore is the largest pore in its neighborhood, and the throat is a pore that has a communication relationship with multiple main pores; The search and connection of adjacent pores outward level by level from the largest pore are based on the following definitions: A pore that has a communication relationship with a main pore and has a size not greater than the main pore is defined as a descendant of the main pore, and the main pore is an ancestor of the descendant; A pore that has a communication relationship with a throat and has a size not greater than the throat is defined as a descendant of the throat, and the throat is an ancestor of the throat descendant; Pores other than the main pores and the throats are collectively referred to as path pores, wherein a plurality of pore chains connected with the main pores and the throats are obtained by tracing back the upper-level pores from the throat until the main pores connected with the throat are traced back, the pore chain is defined as a main communication path, the path pore on the main communication path is defined as a main path pore, and the remaining path pores other than the main path pores fill the remaining pore space other than the main pores, the throats and the main path pores, and are defined as secondary path pores; The levels of the pores are defined as follows: The level of the main pore is defined as 1, the level of the main pore descendant directly connected with the main pore is defined as 2, the upper-level pore of the main pore descendant is the main pore, the pore connected with the main pore descendant with a level of n>1 also belongs to the same main pore descendant, the level of the pore is defined as n+1, the upper-level pore of the main pore descendant with a level of n is the main pore, the upper-level and the ancestor of the main pore are both the main pore itself, and the ancestor and the upper-level of the main pore descendant are only one; The throat has multiple ancestors, the level of the throat is defined as the minimum value of the levels of the multiple main communication paths in which the throat is connected with the ancestors, and the level of the throat descendant is increased level by level based on the level of the throat ancestor to which the throat descendant belongs; the ancestor and the upper-level of the throat are sets composed of multiple pores, and the lengths of the upper-level set and the ancestor set are equal and not less than 2; the ancestor and the upper-level of the throat descendant are only one; If two pores meet the connection condition, otherwise, it is determined that the two pores do not meet the connection condition; wherein, requirement ①: the two pores have at least one common voxel, or the two pores have face-face contact, or the two pores have edge-edge contact; requirement ②: at least one of the two pores has no ancestor before connection, or both of the two pores have ancestors before connection, but the ancestors are different; The connecting adjacent pores specifically comprises: Step 41: constructing list A and list B for storing the pores of completed identification and uncompleted identification respectively, and constructing an empty list link for recording the connection between the main pores; Step 42: setting four pore category marks: zk-main pore, zh-main pore ordinary descendant, h-throat, and hh-throat descendant; the main pore ordinary descendant is the pore in the main pore descendants which is neither the throat nor the throat descendant; The four parameters of the level, category, superior and ancestor of all pores are given initial values, which are +∞, 0, empty, and empty respectively; the parameters of all pores are stored in list B to complete the initialization of list B, and list A is initialized as an empty list; Step 43: sorting all pores in list B according to the size from large to small and the level from small to large under the same size; Step 44: taking the first pore in list B as pore i; if pore i has no ancestor, that is, the second parameter of pore i is 0, then it is determined that pore i is a main pore, and the four parameters of pore i are updated to 1, zk, i, and i; otherwise, the four parameters of pore i remain unchanged, which are a1, a2, a3, and a4, respectively; a2; the connection relationship between pore i and the remaining pores in list B is identified in turn, and a certain remaining pore in list B is recorded as pore j, and the four parameters of pore j are b1, b2, b3, and b4, respectively; if pore i and pore j meet the connection condition, then the four parameters of pore j and list link are updated according to the category of pore i and pore j and the connection between their ancestors; if pore i and pore j do not meet the connection condition, then the four parameters of pore j and list link remain unchanged; then the connection relationship between pore i and the next remaining pore in list B is judged according to the same operation, until the connection relationship between pore i and the last remaining pore in list B is judged; Step 45: putting pore i into list A and deleting pore i from list B; Step 46: constantly repeating steps 43-45 until list B is empty, and the identification of all pores is completed; Step 47: starting from the throat, the main connected path and the main path pores thereon are obtained by tracing the superior pores recorded in list A to the connected main pores, and then the secondary path pores except the main pores, the throats and the main path pores are obtained, and the rockfill skeleton pore network is obtained.

2. The identification method according to claim 1, characterized in that, The length of the hexahedral voxel is not greater than 2% of the length of the rockfill concrete model.

3. The identification method according to claim 1, characterized in that, The grid mapping method is used to map the geometric information of the rockfill to the discretized model.

4. The identification method according to claim 1, characterized in that, The searching of the maximum cube centered on each voxel in the pore space specifically comprises: In the discretization model, firstly, each voxel is coded according to the spatial position of the voxel, a vertex of the discretization model is defined as the coordinate origin, three edges with the vertex as the end point are defined as x, y and z axes, and the x, y and z coordinates of the quadrant in which the discretization model is located are ensured to be non-negative, thereby constructing an xyz coordinate system, in the xyz coordinate system, each voxel is sorted in x, y and z directions according to the size of the center point coordinate of the voxel, and then each voxel has a positive integer sequence number in x, y and z directions, the lower bound of the sequence number is 1, and the upper bound is an integer obtained by dividing the length of the discretization model by the length of a single voxel, and then a sequence number combination obtained by splicing the sequence numbers of the voxel in x, y and z directions is taken as the coding of the voxel, and the coding obtained under the coding rule is one-to-one corresponding to each voxel; When searching for the maximum cube centered on a certain voxel, it is assumed that the initial maximum cube only includes the certain voxel itself, then the sequence numbers of the certain voxel in x, y and z directions are increased and decreased by the same value, that is, the cube is expanded outward with the certain voxel as the center, the value of the increase and decrease starts from 1 and increases by 1, and for each layer of expansion, two judgments are made: (1) whether the expanded cube exceeds the boundary of the discretization model, that is, whether the sequence numbers in x, y and z directions exceed the upper bound or the lower bound; (2) whether the voxels added due to the expansion all belong to the pore space; if both judgments are "yes", the current expansion operation is performed, otherwise, the expansion is stopped, and the cube before the current expansion is regarded as the maximum cube centered on the certain voxel.

5. The identification method of claim 1, wherein, The redundant maximum cubes in the maximum cube set are deleted, specifically including: If the voxel set of a certain maximum cube is contained in at least one maximum cube larger than the certain maximum cube, it is indicated that the certain maximum cube belongs to a redundant maximum cube and should be deleted from the maximum cube set.

6. The identification method according to claim 1, characterized in that, The step 44 specifically includes: Step 441: take the first pore in list B as pore i, if pore i has no ancestor, it is determined that pore i is a main pore, and the four parameters of pore i are updated to 1, zk, i and i, otherwise, the four parameters of pore i remain unchanged, and the four parameters of pore i are recorded as a1, a2, a3 and a4 respectively; Step 442: set a loop variable k and take the initial value as 2; Step 443: determine whether k is greater than the length of list B, if k is not greater than the length of list B, take the kth pore in list B as pore j, record the four parameters of pore j as b1, b2, b3 and b4 respectively, and execute step 444; if k is greater than the length of list B, the identification of pore i is completed, and step 45 is executed; Step 444: determine whether pore j and pore i satisfy the connection condition, if yes, execute step 445, if not, execute step 446; Step 445: pore j becomes a connected pore, according to the categories of pore i and pore j, there are 8 different processing methods, specifically as follows: (i) If a2 = zk or a2 = zh, b2 = 0, then the pore j is absorbed as the normal descendant of the pore i, and the four parameters of the pore j are updated as a1+1, zh, i, a4 respectively; (ii) If a2 = zk or a2 = zh, b2 = zh, and there is no connectivity record between a4 and b4 in the list link, then b1 takes the smaller value of a1+1 and b1, b2 is changed to h, the pore i is added to b3, a4 is added to b4, and finally, all the pores in a4 and b4 are recorded as connected in the list link; (iii) If a2 = zk or a2 = zh, b2 = h, and there is no connectivity record between at least one primary pore in a4 and b4, then b1 takes the smaller value of a1+1 and b1, the pore i is added to b3, a4 is added to b4, and finally, all the pores in a4 and b4 are recorded as connected in the list link; (iv) If a2 = zk or a2 = zh, b2 = hh, and there is no connectivity record between at least one ancestor of a4 and b4, then b1 takes the smaller value of a1+1 and b1, b2 is changed to h, the pore i is added to b3, b4 is updated to the part of the ancestors of a4 and b4 that is not connected to a4, and finally, all the ancestors of a4 and b4 are recorded as connected in the list link; (v) If a2 = h, b2 = 0, then the pore j is absorbed as the descendant of the pore i, and the four parameters of the pore j are updated as a1+1, hh, i, i respectively; (vi) If a2 = h, b2 = zh, and there is no connectivity record between at least one pore in a4 and b4, then b1 takes the smaller value of a1+1 and b1, b2 is changed to h, the pores in a4 that are not connected to b4 are added to b4, the corresponding upper-level pores of the added pores are added to b3, and finally, all the pores in b4 and a4 are recorded as connected in the list link; (vii) If a2 = hh, b2 = 0, then the pore j is absorbed as the descendant of the pore i, and the four parameters of the pore j are updated as a1+1, hh, i, a4 respectively; (viii) If a2 = hh, b2 = zh, and there is no connectivity record between at least one ancestor of b4 and a4, then b1 takes the smaller value of a1+1 and b1, b2 is changed to h, the pores in the ancestors of a4 that are not connected to b4 are added to b4, the pore i is added to b3, and finally, all the ancestors of b4 and a4 are recorded as connected in the list link; After the above judgment is completed, step 446 is executed; Step 446: increase the loop variable k by 1, and return to step 443.

7. An apparatus for identifying according to any one of claims 1 to 6, characterized in that, Comprise: A first module for discretizing a rockfill concrete model using hexahedral voxels, mapping the geometric information of the rockfill to the discretized model, and then extracting the pore space in the discretized model; A second module for traversing each voxel in the extracted pore space and searching for the largest cube centered on each voxel in the pore space to obtain a largest cube set; The third module is configured to delete the redundant maximum cubes based on the maximum cube set, and each of the remaining maximum cubes corresponds to a pore; The fourth module is configured to search and connect adjacent pores from the largest pore outward, divide the main pores and the throats, and determine the connection path, to complete the identification of the rockfill framework pore network, wherein the main pore is the largest pore in its neighborhood, and the throat is a pore that has a communication relationship with multiple main pores.

8. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions for causing the computer to execute the identification method in any one of claims 1-6.

Images