Skip to main content
SpringerLink
Log in

An algorithm for mesh simplification applied to fracture hydrology

  • Articles
  • Published:
Mathematical Geology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baase, S., 1978, Computer Algorithms: Introduction to Design and Analysis: Addison-Wesley, London, 286 p.

    Google Scholar 

  • Cuthil, E. and McKee, J., 1969, Reducing the Bandwidth of Sparse Symmetric Matrices: Proceedings, 24th National Conference of the Association of Computer Machines: Academic Press, New York, p. 69.

    Google Scholar 

  • Gilmour, H. M. P., Billaux, D., and Long, J. C. S., 1986, Models for Calculating Flow in Randomly Generated Three-Dimensional Networks of Disc-Shaped Fractures: LBL-19515, Berkeley, 143 p.

  • Long, J. C. S., 1983, Investigation of Equivalent Porous Medium Permeability in Networks of Discontinuous Fractures: Ph.D. thesis, College of Engineering, University of California, Berkeley, 277 p.

    Google Scholar 

  • Tarjan, R. E., 1972, Depth First Search and Linear Graph Algorithms:SIAM J. Comput., v. 1, p. 146–160.

    Google Scholar 

  • Zallen, R., 1983, The Physics of Amorphous Solids: Wiley, New York, 300 p.

    Google Scholar 

Download references

Author information

Author notes

  1. D. Billaux

    Present address: Departement Ingénierie Géotechnique, Bureau de Recherches Géologiques et Minières, BP 6009, 45060, Orléans Cedex 2, France

Authors and Affiliations

  1. Earth Sciences Division, Lawrence Berkeley Laboratory, University of California, 94720, Berkeley, California

    D. Billaux

  2. Earth Sciences Division, Lawrence Berkeley Laboratory, University of California, 94720, Berkeley, California

    P. Fuller

Authors
  1. D. Billaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Fuller
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Billaux, D., Fuller, P. An algorithm for mesh simplification applied to fracture hydrology. Math Geol 21, 221–232 (1989). https://doi.org/10.1007/BF00893216

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00893216

Key words

Search

Navigation