# US 2015/0149142 A1 · Geologic feature splitting

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0149142 A1
- Document ID: US20150149142A1
- Status: Published application
- Kind: A1
- Application number: 14/551,667
- Filed: 2014-11-24
- Published: 2015-05-28
- Earliest claimed: 2013-11-25
- Assignees: Schlumberger Technology Corporation
- Applicants: Schlumberger Technology Corporation
- Inventors: Zhenhua Li; Qingrui Li; Ping Xu; Guang Xiong; Lina Xu; Paolo Saverio Damiani
- Web page: https://patentgrep.com/patent/US20150149142A1

## CPC

- G01V 99/00: Subject matter not provided for in other groups of this subclass
- G01V 20/00: Geomodelling in general
- G06F 30/23: using finite element methods [FEM] or finite difference methods [FDM]
- E21B 2200/20: Computer models or simulations, e.g. for reservoirs under production, drill bits
- G01V 2210/642: Faults
- G01V 2210/646: Fractures
- G01V 2210/66: Subsurface modeling
- G01V 2210/663: Modeling production-induced effects
- G01V 2210/74: Visualisation of seismic data
- G01V: GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS (means for indicating the location of accidentally buried, e.g. snow-buried, persons A63B29/02)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- E21B: EARTH OR ROCK DRILLING; OBTAINING OIL, GAS, WATER, SOLUBLE OR MELTABLE MATERIALS OR A SLURRY OF MINERALS FROM WELLS

## Abstract

A method can include receiving information that defines a three-dimensional subterranean structure; splitting the three-dimensional subterranean structure into portions; generating convex hulls for the portions; and generating a discrete fracture network based at least in part on the convex hulls.

## Claims

### Claim 1

A method comprising:
receiving information that defines a three-dimensional subterranean structure;
splitting the three-dimensional subterranean structure into portions;
generating convex hulls for the portions; and
generating a discrete fracture network based at least in part on the convex hulls.

### Claim 2 (depends on 1)

The method of claim 1 further comprising simulating phenomena associated with a subterranean formation based at least in part on a model that comprises the discrete fracture network.

### Claim 3 (depends on 1)

The method of claim 1 wherein the generating convex hulls comprises applying a Graham scan algorithm.

### Claim 4 (depends on 1)

The method of claim 1 wherein the splitting comprises implementing an angular splitting parameter.

### Claim 5 (depends on 1)

The method of claim 1 wherein the splitting generates line segments.

### Claim 6 (depends on 5)

The method of claim 5 wherein each of the line segments comprises end points.

### Claim 7 (depends on 1)

The method of claim 1 wherein the splitting comprises splitting a curve wherein the curve is determined by intersection of the subterranean structure with a plane.

### Claim 8 (depends on 7)

The method of claim 7 further comprising repeating the splitting for a plurality of positions of the plane along a coordinate direction.

### Claim 9 (depends on 1)

The method of claim 1 wherein the splitting comprising intersecting the three-dimensional subterranean structure by a plane to generate intersection points that form a curve and then splitting the curve into portions.

### Claim 10 (depends on 9)

The method of claim 9 wherein the splitting comprises representing each of the portions by a line segment.

### Claim 11 (depends on 10)

The method of claim 10 wherein each of the line segments comprises an associated area.

### Claim 12 (depends on 1)

The method of claim 1 wherein the generating convex hulls comprises determining a best fit plane.

### Claim 13 (depends on 1)

The method of claim 1 wherein the outputting outputs a discrete fracture network as a model represented at least in part by a set of convex hulls.

### Claim 14 (depends on 1)

The method of claim 1 further comprising tessellating at least a portion of the subterranean structure into polygons; computing a normal for each of the polygons; and determining one or more dip values based on the normals of the polygons.

### Claim 15

A system comprising:
a processor;
memory operatively coupled to the processor;
one or more modules stored in the memory and comprising processor executable instructions to instruct the system wherein the instructions comprise instructions to:
receive information that defines a three-dimensional subterranean structure;
split the three-dimensional subterranean structure into portions;
generate convex hulls for the portions; and
generate a discrete fracture network based at least in part on the convex hulls.

### Claim 16 (depends on 15)

The system of claim 15 wherein the one or more modules stored in the memory and comprising processor executable instructions to instruct the system comprise instructions to simulate phenomena associated with a subterranean formation based at least in part on a model that includes the discrete fracture network.

### Claim 17 (depends on 15)

The system of claim 15 wherein the instructions to generate a convex hull for at least one of the portions comprises instructions to apply a Graham scan algorithm.

### Claim 18

One or more computer-readable storage media comprising processor-executable instructions to instruct a computer to:
receive information that defines a three-dimensional subterranean structure;
split the three-dimensional subterranean structure into portions;
generate convex hulls for the portions; and
generate a discrete fracture network based at least in part on the convex hulls.

### Claim 19 (depends on 18)

The one or more computer-readable storage media of claim 18 comprising processor-executable instructions to instruct the computer to simulate phenomena associated with a subterranean formation based at least in part on a model that includes the discrete fracture network.

### Claim 20 (depends on 18)

The one or more computer-readable storage media of claim 18 comprising processor-executable instructions to instruct the computer to generate a convex hull for at least one of the portions by applying a Graham scan algorithm.
