DFN Clipping

High Performance Clipping of DFN Models
I developed algorithms to clip large (~millions) DFN models efficiently, and with automatic memory management. In the following which is a smaller DFN model, DFN('n',15000,'minl',0.1,'maxl',0.1), the entire process (simulation, clipping and visualization) was done in just few seconds (~11) on an ordinary laptop.
Clipping 2D DFN Models

The clipping function produces four sets of outputs: 1) fractures entirely inside the clipping area, 2) fractures entirely outside of the clipping area, 3) inside part(s) of fractures intersecting the clipping area, and 4) outside part(s) of fractures intersecting the clipping area.

Clipping 3D DFN Models

The same style of outputs of clipping was developed for 3D polygons (i.e., 3D DFN models), with details demonstrated at {DFN Tunneling}.

The following examples are about two different large DFN models (each 200,000 fractures) through which a series of tunnels were excavated. The entire procedure took only few minutes (~4 min).