2010
DOI: 10.3997/2214-4609.20144950
|View full text |Cite
|
Sign up to set email alerts
|

Practical Gridding Algorithms for Discrete Fracture Modeling Workflows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
30
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(30 citation statements)
references
References 0 publications
0
30
0
Order By: Relevance
“…Addressing this limitation, Mallison et al (2010) presented new gridgeneration algorithms for simulating fluid flow in NFRs. Moreover, Mallison et al (2010) argue that there is inherent uncertainty in the precise position and geometry of fractures in an NFR and hence chose not to impose an exact agreement of fracture geometry between the geologic and flow-simulation models. Instead, their gridgeneration algorithms are designed to capture only geometric features that are larger than the specified grid resolution.…”
Section: Chevron Discrete Fracture Modelsmentioning
confidence: 99%
“…Addressing this limitation, Mallison et al (2010) presented new gridgeneration algorithms for simulating fluid flow in NFRs. Moreover, Mallison et al (2010) argue that there is inherent uncertainty in the precise position and geometry of fractures in an NFR and hence chose not to impose an exact agreement of fracture geometry between the geologic and flow-simulation models. Instead, their gridgeneration algorithms are designed to capture only geometric features that are larger than the specified grid resolution.…”
Section: Chevron Discrete Fracture Modelsmentioning
confidence: 99%
“…In a similar manner, Kappa (2014) applied an approach to model exactly the fracture geometry by placing fixed Voronoi cell centers around fractures without explicitly defining simulation gridblocks for fractures. Also, Mallison et al (2010) tried an force-based optimization algorithm (Holm et al 2006;Persson and Strang 2004) to generate triangular grids for fractures, for which they could not precisely honor the geometry of fracture line segments. Instead, fractures are approximated by edges of the triangular mesh, and some fractures might be snapped together in situations where the input fractures do not intersect.…”
Section: Mesh Generation For Complex Fracture Networkmentioning
confidence: 99%
“…First of all, intersection information helps the mesh generation algorithms to better conform to the input of complex fracture geometry and therefore will ensure good mesh quality. Second, for those approaches (Branets et al 2008;Kappa 2014;Karimi-Fard et al 2003) where no fracture gridblocks are explicitly defined, the intersection points are still needed to compute the inter-cell transmisibilities; for those approaches (Mallison et al 2010;Mun-Hong Hui 2008) where fractures are not described exactly as straight line segments, the intersection points are considered as background information to guide the mesh generation algorithms. In this study, not only do we compute intersection points, but also define the intersections into five types which offer us additional freedom to manipulate fracture connectivity through intersections.…”
Section: Compute Intersections Of the Connected Fracture Networkmentioning
confidence: 99%
“…In the discrete-fracture method, rock-matrix and fracture elements coincide at the interface, so an unstructured grid is used to honour the explicit fracture geometry(see Mallison et al (2010); Mustapha et al (2011)). Also, the matrix cells near the fracture are small enough to conform to the complex fracture-network geometry.…”
Section: Introductionmentioning
confidence: 99%