An algorithm for mesh simplification applied to fracture hydrology

Numerically generated discrete fracture networks are used to simulate the flow of water through rock fractures. The fractures are modeled as random assemblages of conductive elements in a nonconductive matrix. Because large numbers of fractures often are needed to represent fractured rock adequately, minimizing the required computer time and memory is crucial. For steady-state flow, any portion of the mesh that is linked to the rest of the mesh by only one point is a dead end and does not contribute to water flow. The removal of such dead-end clusters simplifies the mesh and therefore speeds up computation, without changing its response. An algorithm for removing these dead ends is described in detail. Its effectiveness is discussed with regard to the connectivity of a network.