To read this content please select one of the options below:

An efficient algorithm for generation of conforming mesh for three-dimensional discrete fracture networks

Soheil Mohajerani (Shahrood University of Technology, Shahrood, Iran)
Duruo Huang (Tsinghua University, Beijing, China)
Gang Wang (Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong)
Seyed-Mohammad Esmaeil Jalali (Shahrood University of Technology, Shahrood, Iran)
Seyed Rahman Torabi (Shahrood University of Technology, Shahrood, Iran)

Engineering Computations

ISSN: 0264-4401

Article publication date: 16 November 2018

Issue publication date: 27 November 2018

135

Abstract

Purpose

This study aims to develop an efficient algorithm for generation of conforming mesh for seepage analysis through 3D discrete fracture networks (DFN).

Design/methodology/approach

The algorithm is developed based on a refined conforming Delaunay triangulation scheme, which is then validated using analytical solutions. The algorithm is well able to meet the challenge of meshing complex geometry of DFNs.

Findings

A series of sensitivity analysis have been performed to evaluate the effect of meshing parameters on steady state solution of Darcy flow using a finite element scheme. The results show that an optimized minimum internal angle of meshing elements should be predetermined to guarantee termination of the algorithm.

Originality/value

The developed algorithm is computationally efficient, fast and is of low cost. Furthermore, it never changes the geometrical structure and connectivity pattern of the DFN.

Keywords

Acknowledgements

The author (GW) acknowledges support from Theme-based Research Scheme Grant No. T22-603-15N from the Hong Kong Research Grants Council.

Conflicts of Interest:The authors declare that they have no conflicts of interest.

Citation

Mohajerani, S., Huang, D., Wang, G., Jalali, S.-M.E. and Torabi, S.R. (2018), "An efficient algorithm for generation of conforming mesh for three-dimensional discrete fracture networks", Engineering Computations, Vol. 35 No. 8, pp. 2860-2882. https://doi.org/10.1108/EC-03-2018-0127

Publisher

:

Emerald Publishing Limited

Copyright © 2018, Emerald Publishing Limited

Related articles