The present techniques relate to providing an analysis of data corresponding to a subsurface region. In particular, an exemplary embodiment of the present techniques relates to identifying compartments and their relationships in a reservoir based on topological structure.
This section is intended to introduce various aspects of the art, which may be associated with embodiments of the disclosed techniques. This discussion is believed to assist in providing a framework to facilitate a better understanding of particular aspects of the disclosed techniques. Accordingly, it should be understood that this section is to be read in this light, and not necessarily as admissions of prior art.
Three-dimensional (3D) model construction and visualization commonly employs data stored in a data volume organized as a structured grid or an unstructured grid. Data stored in a data volume may comprise a data model that corresponds to one or more physical properties about a corresponding region that may be of interest. Physical property model construction and data visualization have been widely accepted by numerous disciplines as a mechanism for analyzing, communicating, and comprehending complex 3D relationships. Examples of physical regions that can be subjected to 3D analysis include the earth's subsurface, facility designs and the human body.
In the field of hydrocarbon exploration, analysis of a reservoir's connectivity facilitates characterizing the reservoir. Moreover, connectivity analysis may affect decisions made in all phases of hydrocarbon resource development (such as exploration and production) of an asset's life cycle. Connectivity assessments can affect decisions ranging from determining optimal well locations, to managing reservoir decisions.
In one known technique, a set of rules and processes allow geologists to identify compartments from reservoir geometry. Typically, compartment identification starts with structure maps. Structural features, stratigraphic features, and the limits of top-seal or base-seal define compartment boundaries. Without knowledge of fluid contacts, depths, pressures conditions, one can identify potential compartment boundaries from the maps based on a few simple rules of the structural and stratigraphic features. That is, one can evaluate relevance of compartment boundaries defined by top-seal or base-seal. Traditional spill points on convex-upward closures and down-dip tips of faults or other structural or stratigraphic barriers are only relevant on top-of-reservoir maps. Break-over points, including those associated with concave-upward closures and up-dip tips of faults or other structural or stratigraphic barrier, are only relevant on base-of-reservoir maps. Even though the rules to identify compartments on the structure maps are relatively simple, the process of identification typically relies on the geologists' manual identification of compartment boundaries and contact relations among boundaries based on the contour and/or cross sessions display in structural surface.
The left panel 102 shows a top-seal map of the top of a reservoir. The structural contour of the top seal is represented with isolines 108, each of which represents a solid polygon of uniform depth along the top of the reservoir.
The center panel 104 shows a base-seal map of the base of the reservoir. As in the left panel, the structural contour of the bottom seal is represented with isolines 108, each of which represents a solid polygon of uniform depth along the top of the reservoir.
The right panel 106 shows a cross section taken along lines A-A′ 112 of the left panel 102 and the center panel 104. The depth contour of the top seal is shown as line 114, and the depth contour of the bottom seal is shown as line 116. The locations of the first compartment 118 and the second compartment 120 are clearly shown in the right panel 106. The dashed line in the right panel 106 shows the depth that is identified as the top of the first compartment 118. Thus, the potential compartments 118 and 120 can be manually identified by inspection of the reservoir contours of a base seal and a top seal.
Known processes of compartment identification rely on geologists' knowledge and step-by-step procedures to identify compartment boundaries first. The contacts from compartment boundaries may then be used to identify the spill points and break-over points among compartments. Furthermore, the traditional methods would make the handling of the uncertainty of the structural and stratigraphic features difficult if not impossible.
The following paragraphs provide specific examples of known techniques for processing geometric data. U.S. Pat. No. 5,966,141 to Ito, et al., discloses an animation solid that is created by an animation solid generator such that the shape of its cross section at t=t0 coincides with the shape of the contour of an object contained in a frame to be displayed at t=t0, wherein time t is set in the height z direction of the solid. For creation of this solid, topological considerations, including connected components and the tree structure of contours, are used. By chopping this solid, it is submitted that intermediate dividing can be performed. According to the disclosure, the basis of the topological geometry rests on Morse theory.
U.S. Pat. No. 6,323,863 to Shinagawa, et al., discloses that shape expressions in CAD or CG have often been carried out in polygon data. In polygon representations, the amount of data becomes very large if precision is pursued. Another shape representation utilizing the existing polygon data asset is disclosed. Polygon data showing the shape of an object is first obtained. Topological information of the object is extracted from the polygon data. Based on the information, the polygon data is converted into topological data. The inversion is carried out upon necessity.
U.S. Patent Application Publication No. 2005/0002571 by Hiraga, et al., discloses a shape analyzer that inputs a 3D representation of an object such as merchandise. A structural graph of the object is constructed by defining a continuous function on the surface of the object. The surface is then partitioned into plural areas according to the function values at the points on the surface. The areas are associated with nodes of the graph. By choosing a function that returns values invariant to rotation of the objects, the constructed graph also becomes invariant to rotation. This property is said to be important when searching for objects by shape from a shape database, as the postures of the objects are unknown when searching is performed. The analyzer is stated to be applicable to search engines for online shopping, where a user seeks goods by designating the general shape of the target.
S. Smale, “Morse Inequalities for a Dynamical System”, Bulletin of American Mathematical Society, Volume 66, No. 1 (1960), describes a topological structure of a scalar field in the continuum. According to the article, a real value function ƒ: M(a two-manifold)−>R (a Real field) is called a Morse function if it is at least twice differentiable, its values at critical points (for example, minimums, maximums, saddles) defined by ▾ƒ=0 are distinct and its Hessian matrix of second derivatives of ƒ has nonzero determinant at critical points. Moreover, the article provides a topological analysis of mathematical theory that may be useful.
The following paragraphs provide specific examples of known reservoir data analysis techniques. U.S. Patent Application Publication No. 2006/0235666 by Assa, et al, discloses methods and systems for processing data used for hydrocarbon extraction from the earth. Symmetry transformation groups are identified from sampled earth structure data. A set of critical points is identified from the sampled data. Using the symmetry groups and the critical points, a plurality of subdivisions of shapes is generated, which together represent the original earth structures. The symmetry groups correspond to a plurality of shape families, each of which includes a set of predicted critical points. The subdivisions are preferably generated such that a shape family is selected according to a best fit between the critical points from the sampled data and the predicted critical points of the selected shape family.
International Patent Application Publication No. WO2009/094064 by Meurer, et al., discloses methods, computer-readable mediums, and systems that analyze hydrocarbon production data from a subsurface region to determine geologic time scale reservoir connectivity and production time scale reservoir connectivity for the subsurface region. Compartments, fluid properties, and fluid distribution are interpreted to determine geologic time scale reservoir connectivity and production time scale reservoir connectivity for the subsurface region. A reservoir connectivity model based on the geologic time scale and production time scale reservoir connectivity for the subsurface region is constructed, wherein the reservoir connectivity model includes a plurality of production scenarios each including reservoir compartments, connections, and connection properties for each scenario. Each of the production scenarios is tested and refined based on production data for the subsurface region.
P. J. Vrolijk, et al., “Reservoir Connectivity Analysis—Defining Reservoir Connections and Plumbing”, SPE Middle East Oil and Gas Show and Conference, Kingdom of Bahrain (2005), provides that gas, oil, and water fluids in channelized or faulted reservoirs can create complex reservoir plumbing relationships. Variable hydrocarbon contacts can develop when some, but not all, fluids are in pressure communication. Reservoir Connectivity Analysis (RCA) is a series of analyses and approaches to integrate structural, stratigraphic, and fluid pressure and composition data into permissible but non-unique scenarios of fluid contacts and pressures. RCA provides the basis for fluid contact and pressure scenarios at all business stages, allowing the creation of fluid contact and segmentation scenarios earlier in an exploration or development setting, and the identification of by-passed pays or new exploration opportunities in a production setting. Combining conventional structural and fault juxtaposition spill concepts with a renewed appreciation of fluid break-over (contacts controlled by spill of pressure-driven, denser fluid, like water over a dam) and capillary leak (to define the ratio of gas and oil where capillary gas leak determines the gas-oil contact (GOC)), permissible but non-unique scenarios of the full fluid fill/displacement/spill pathways of a hydrocarbon accumulation are defined comprising single or multiple reservoir intervals.
Y. Gingold, et al., “Controlled-Topology Filtering”, Computer-Aided Design, Volume 39, Issue 8 (2007) presents an algorithm based on Critical Point analysis that postulates that the filtering result would preserve the topological features on the surface. According to the paper, many applications require the extraction of isolines and isosurfaces from scalar functions defined on regular grids. These scalar functions may have many different origins, from MRI and CT scan data to terrain data or results of a simulation. As a result of noise and other artifacts, curves and surfaces obtained by standard extraction algorithms often suffer from topological irregularities and geometric noise. While it is possible to remove topological and geometric noise as a post-processing step, in the case when a large number of isolines are of interest there is a considerable advantage in filtering the scalar function directly. While most smoothing filters result in gradual simplification of the topological structure of contours, new topological features typically emerge and disappear during the smoothing process. The paper describes an algorithm for filtering functions defined on regular 2D grids with controlled topology changes, which is stated to ensure that the topological structure of the set of contour lines of the function is progressively simplified.
P. Bremer, et al., “Maximizing Adaptivity in Hierarchical Topological Models Using Extrema Trees”, IEEE PROC-216200 (2005), discloses an adaptive hierarchical representation of the topology of functions defined over two-manifold domains. Guided by the theory of Morse-Smale complexes, dependencies between cancellations of critical points are encoded using two independent structures: a traditional mesh hierarchy to store connectivity information and a new structure called an extrema tree to encode the configuration of critical points. Extrema trees are described as providing a powerful method to increase adaptivity while using a relatively simple data structure. The resulting hierarchy is described as being relatively flexible. In particular, the resulting hierarchy is stated to be guaranteed to be of logarithmic height.
A. Gyulassy, et al., “A Topological Approach to Simplification of Three-dimensional Scalar Functions”, IEEE Transactions Visualization and Computer Graphics (2006), describes a combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of a function's associated gradient flow field, is used to identify topological features and their significance. The simplification process, guided by the Morse-Smale complex, proceeds by repeatedly applying two atomic operations that each remove a pair of critical points from the complex. Efficient storage of the complex results in execution of these atomic operations at interactive rates. Visualization of the simplified complex shows that the simplification preserves significant topological features while removing small features and noise.
G. H. Weber, et al., “Topology-controlled Volume Rendering”, IEEE Transactions Visualization and Computer Graphics (2007), discloses that topology provides a foundation for the development of mathematically sound tools for processing and exploration of scalar fields. Existing topology-based methods can be used to identify interesting features in volumetric data sets, to find seed sets for accelerated isosurface extraction, or to treat individual connected components as distinct entities for isosurfacing or interval volume rendering. A framework for direct volume rendering based on segmenting a volume into regions of equivalent contour topology is described, applying separate transfer functions to each region. Each region corresponds to a branch of a hierarchical contour tree decomposition, and a separate transfer function can be defined for it. A volume rendering framework and interface where a unique transfer function can be assigned to each subvolume corresponding to a branch of the contour tree. Also disclosed is a runtime method for adjusting data values to reflect contour tree simplifications. Purported to be disclosed is an efficient way of mapping a spatial location into the contour tree to determine the applicable transfer function. Also stated to be disclosed is an algorithm for hardware accelerated direct volume rendering that visualizes the contour tree-based segmentation at interactive frame rates using graphics processing units (GPUs) that support loops and conditional branches in fragment programs.
H. Carr, “Contour Tree Simplification With Local Geometric Measures”, MIT, 14th Annual Fall Workshop on Computational Geometry (2004), discloses that the contour tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, has several potential applications in scientific and medical visualization, but noise in experimentally-acquired data results in unmanageably large trees. Geometric properties of the contours are attached to the branches of the tree and simplification by persistence is applied to reduce the size of contour trees while preserving features of the scalar field.
Embodiments of the present disclosure provide techniques for automatically identifying potential compartments of a reservoir based on the reservoirs geological structure. An exemplary embodiment provides a method of identifying compartments of a reservoir structure. The method includes obtaining structural data corresponding to a geological structure of a reservoir. The method also includes generating a topological net based on the structural data, the topological net comprising critical points and poly segments connecting the critical points. The method also includes identifying potential compartments of the reservoir structure based on the topological net. The method also includes identifying spill or break-over relationships among the potential compartments based on the topological net.
In an embodiment, the critical points include a minimum critical point, a maximum critical point, a top saddle critical point, or a base saddle critical point. The top saddle critical point may be identified as a spill relation between the potential compartments corresponding to the top saddle critical point. The base saddle critical point may be identified as a break-over relation between the potential compartments corresponding to the base saddle critical point. In an embodiment, the poly segments correspond to reservoir regions of the reservoir structure. If the critical points include a top saddle critical point and a maximum critical point, the reservoir region corresponding to the poly segment connecting by the critical points may be identified as one of the potential compartments. Further, if the critical points comprise a base saddle critical point and a minimum critical point, the reservoir region corresponding to the poly segment connecting the critical points may identified as one of the potential compartments.
In an embodiment, a point in one of the poly segments corresponds to a level set contour of the reservoir structure. Points on the poly segments may represent structural contours, which are generated by obtaining depth level sets of the structural data from a real value function that maps to depths ranging from minimum depth to maximum depth of the structural data. In an embodiment, the method may include identifying critical points of the topological net by passing a plane of constant depth through the reservoir structure to obtain depth level contours and identifying locations where the depth level contours intersect. Furthermore, the structural data may comprise geological surfaces, seismic data, geological models, reservoir models, or some combination thereof. The method may also include adding the potential compartments to a reservoir connectivity diagram. The method may also include adding the spill or break-over relationships to the reservoir connectivity diagram.
Another embodiment provides a method of performing a reservoir connectivity analysis. The method includes obtaining structural data corresponding to a geological structure of a reservoir. The method also includes generating a topological net based on the structural data, the topological net comprising critical points and poly segments connecting the critical points. The method also includes identifying a potential compartment of the reservoir based on the critical points and adding the potential compartment to a reservoir connectivity diagram. The method also includes comparing measured pressure data with expected pressure data, wherein the expected pressure data is generated based on the reservoir connectivity diagram. In an embodiment, the method also includes, modifying the topological net if the measured pressure data is inconsistent with the expected pressure data and generating a modified reservoir connectivity diagram based on the modified topological net.
Another embodiment provides a system for analyzing reservoir structure data. The system includes a processor and a non-transitory, computer-readable medium comprising code configured to direct operations of the processor. The code is configured to direct the processor to obtain structural data corresponding to a geological structure of a reservoir. The code is also configured to direct the processor generate a topological net based on the structural data, the topological net comprising critical points and poly segments connecting the critical points. The code is also configured to direct the processor to identify potential compartments of the reservoir based on the topological net.
In an embodiment, the code configured to direct the processor to identify potential compartments identifies one of the poly segments between two or more of the critical points as one of the potential compartments. The non-transitory, computer-readable medium can also include code configured to direct the processor to identify one of the critical points as a spill or break-over connection between the potential compartments corresponding to the poly segments connected by the critical point. The non-transitory, computer-readable medium can also include code configured to direct the processor to generate the poly segment by obtaining depth level sets of the structural data from a real value function that maps to depths ranging from minimum depth to maximum depth of the structural data. In an embodiment, the system includes a visualization engine configured to provide a visual display of a reservoir and overlay the topological net over the visual display of the reservoir. The non-transitory, computer-readable medium can also include code configured to direct the processor to add the potential compartments and relationships between compartments to a reservoir connectivity diagram.
Another embodiment provides a non-transitory, computer readable medium that includes code configured to direct operations of processor. The code is configured to direct the processor to obtain structural data corresponding to a structure of a reservoir and generate a topological net based on the structural data, the topological net including critical points and poly segments connecting the critical points. The code is also configured to direct the processor to identify potential compartments of the reservoir based on the topological net. The code is also configured to direct the processor to identify spill or break-over relationships among the potential compartments based on the topological net.
In an embodiment, the critical points comprise a minimum critical point, a maximum critical point, a top saddle critical point, or a base saddle critical point and the poly segments correspond to regions of the reservoir. If the critical points include a base saddle critical point and a minimum critical point, a reservoir region corresponding to the poly segment connecting the critical points may be identified as one of the potential compartments. Points on the poly segments may represent structural contours, which are generated by obtaining depth level sets of the structural data from a real value function that maps to depths ranging from minimum depth to maximum depth of the structural data.
Advantages of the present techniques may become apparent upon reviewing the following detailed description and drawings of non-limiting examples of embodiments in which:
In the following detailed description section, specific embodiments are described in connection with preferred embodiments. However, to the extent that the following description is specific to a particular embodiment or a particular use, this is intended to be for exemplary purposes only and simply provides a description of the exemplary embodiments. Accordingly, the present techniques are not limited to embodiments described herein, but rather, it includes all alternatives, modifications, and equivalents falling within the spirit and scope of the appended claims.
At the outset, and for ease of reference, certain terms used in this application and their meanings as used in this context are set forth. To the extent a term used herein is not defined below, it should be given the broadest definition persons in the pertinent art have given that term as reflected in at least one printed publication or issued patent.
As used herein, the term “computer component” refers to a computer-related entity, either hardware, firmware, software, a combination thereof, or software in execution. For example, a computer component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and a computer. One or more computer components can reside within a process and/or thread of execution and a computer component can be localized on one computer and/or distributed between two or more computers.
As used herein, the terms “non-transitory, computer-readable medium”, “tangible machine-readable medium” or the like refer to any tangible storage that participates in providing instructions to a processor for execution. Such a medium may take many forms, including but not limited to, non-volatile media, and volatile media. Non-volatile media includes, for example, NVRAM, or magnetic or optical disks. Volatile media includes dynamic memory, such as main memory. Computer-readable media may include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, magneto-optical medium, a CD-ROM, any other optical medium, a RAM, a PROM, and EPROM, a FLASH-EPROM, a solid state medium like a holographic memory, a memory card, or any other memory chip or cartridge, or any other physical medium from which a computer can read. When the computer-readable media is configured as a database, it is to be understood that the database may be any type of database, such as relational, hierarchical, object-oriented, and/or the like. Accordingly, exemplary embodiments of the present techniques may be considered to include a tangible storage medium or tangible distribution medium and prior art-recognized equivalents and successor media, in which the software implementations embodying the present techniques are stored.
As used herein, the term “earth model” refers to a geometrical model of a portion of the earth that may also contain material properties. The model is shared in the sense that it integrates the work of several specialists involved in the model's development (non-limiting examples may include such disciplines as geologists, geophysicists, petrophysicists, well log analysts, drilling engineers and reservoir engineers) who interact with the model through one or more application programs.
As used herein, the term “primitive” refers to a basic geometric shape. Examples of 2D primitives include rectangles, circles, ellipses, polygons, points, lines or the like. Examples of 3D primitives include 3D representations of 2D primitives such as three dimensional polygons, line segments. Other 3D primitives include cubes, spheres, ellipsoids, cones, cylinders or the like.
As used herein, the term “property” refers to data representative of a characteristic associated with different topological elements on a per element basis. Generally, a property could be any computing value type, including integer and floating point number types or the like. Moreover, a property may comprise vectors of value types. Properties may only be valid for a subset of a geometry object's elements. Properties may be used to color an object's geometry. The term “property” may also refer to a characteristic or stored information related to an object.
As used herein, the term “poly segment” refers to an ordering of points. A poly segment may or may not be closed and may be represented as one or more connected line segments connecting adjacent points. A line segment can be split into two or more line segments by adding additional points. Points and line segments of a poly segment may have properties. Properties, such as pressure gradient value and depth value, may be used in the interpretation processes and/or to control the presentation/visualization of the poly segment, such as specifying a color or line thickness, for example. Property values may be discrete or interpolated between known points.
As used herein, the term “cell” refers to a collection of faces, or a collection of nodes that implicitly define faces, where the faces together form a closed volume.
As used herein, the term “seismic data” refers to a multi-dimensional matrix or grid containing information about points in the subsurface structure of a field, where the information was obtained using seismic methods. Seismic data typically is represented using a structured grid. Seismic attributes or properties are cell- or voxel-based.
As used herein, the terms “visualization engine” or “VE” refer to a computer component that is adapted to present a model and/or visualization of data that represents one or more physical objects.
As used herein, the term “well” refers to a surface location with a collection of wellbores. Wells may be visually rendered as a point or a glyph, along with a name.
As used herein, the term “wellbore” refers to a constituent underground path of a well and associated collections of path dependent data. A wellbore may be visually rendered as a collection of connected line segments or curves. Wellbores may also be visually rendered cylindrically with a radius.
As used herein, the term “seal” refers to impermeable rocks that keep hydrocarbons in place and prevent them from escaping to the surface, for example shale.
As used herein, the terms “compartment” or “reservoir compartment” refer to a trap containing no identified barriers that would allow the contact between two fluids to reach equilibrium at more than one depth.
As used herein, the term “break-over” refers to a loss of a denser fluid driven by overpressure at a break or saddle in the base-seal.
As used herein, the term “spill” refers to an escape of the more buoyant fluid at a break or cusp in the top-seal.
Some portions of the detailed description which follows are presented in terms of procedures, steps, logic blocks, processing and other symbolic representations of operations on data bits within a computer memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. In the present application, a procedure, step, logic block, process, or the like, is conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those requiring physical manipulations of physical quantities. These quantities may be stored, transferred, combined, compared, and otherwise manipulated in a computer system.
An exemplary embodiment of the present techniques relates to a process of modeling the dynamic nature of compartments in a subsurface region. Embodiments of the present techniques use numerical and/or geometrical algorithms to create a topological network from the reservoir geometry based on a real value function, ƒR, that describes the geometric structure of the reservoir region. By abstracting the geometrical complexity of the reservoir to a topological net, the relations among compartments can better be understood and the process of compartment identification can be accelerated.
One exemplary embodiment employs topology of the 3D reservoir constructs to identify compartments. An exemplary embodiment may facilitate the creation of 3D geometry structures of potential compartments and their topological relationships. A framework may be provided for reservoir connectivity analysis in all phases of the reservoir management.
Exemplary embodiments relate to a method to utilize topological structure which provides compartment identification and spill/break-over analysis in a given reservoir. The exemplary method would use geological surfaces and/or volume data structures to construct geometry/containment of reservoir compartments and/or to create spill/break-over relations among compartments. The identification of reservoir compartments can utilize topological analysis from the surface/volume data for the initial data abstraction and the relationship among the reservoir compartments can then be determined The present techniques may be used in conducting reservoir connectivity analysis (RCA) based on the static reservoir geometry. A method according to the present techniques may also be used in an interactive environment in which user can utilize the constructed framework to conduct dynamic reservoir connectivity analysis (DCA), wherein the production of the reservoir would affect the spill/break-over relationships.
Prior to performing connectivity analysis, compartments in the reservoir of interest are identified. Identification of reservoir compartments typically requires analysis of reservoir geometry. Compartments are essentially traps containing no identified barriers that would allow the contact between two fluids to reach equilibrium at more than one depth. The communications among the compartments are controlled not only by the shape of the reservoir geometry, but also by the spill locations and break-over locations. Thus, the topology of the reservoir geometry and the topological relationships among identified regions are the most common control for the compartment identifications. Exemplary embodiments of the present invention provide computerized techniques for automatically identifying potential reservoir compartments and characterizing the fluid communication between compartments.
According to the present techniques, the topological relationship of the reservoir is extracted from the reservoir geometry. More specifically, the disclosed method uses a depth function as a real value function, ƒR, that maps the reservoir data structure 202 as the domain of the function to the depth range of the reservoirs. Based on this functional definition, the inverse image, or pre-image, of a constant value, ƒR−1(Z), while z is in depth, is a corresponding depth level set in the domain of function ƒR. The depth level set can be determined by identifying all the locations on the reservoir data structure that have the same depth value. A sequence of depth level sets ranging from depth 300 to 1000 is shown as a series of surface contours in the diagram 200 of
The maximum topology panel 302 shows a surface contour 314 of a top surface that forms an anticline. In the maximum topology panel 302 a maximum point 316 (critical point) is shown as a solid black dot disposed at the top of the surface contour 314. The minimum topology panel 304 shows a surface contour 314 of a base surface that forms a syncline. In the minimum topology panel 304 a minimum point 318 (critical point) is shown as a solid black dot disposed on the bottom of the surface contour 314. The top saddle topology panel 306 shows a surface contour 314 of a top saddle. A top saddle point 320 (critical point) is shown as a solid black dot. A surface may be referred to as a “saddle point” if the surface curves upward in one direction and curves downward in a different direction. For example, the surface contour 314 curves upward from the top saddle point 320 as shown in the top saddle topology panel 306 but also curves downward in another direction, for example, out of the page. The base saddle topology panel 308 shows a surface contour 314 of a base saddle. A base saddle point 322 (critical point) is shown as a solid black dot.
In accordance with an exemplary embodiment of the present techniques, a topological structure of a reservoir may be analysed by identifying critical points from their bounding horizons, which may be represented by top-seal surfaces, bottom seal surfaces, and/or volumetric data structures. Topological relationships may be established between the critical points during the process of identifying them. The established topological relationships may then map to the original bounding horizons and/or volumetric structure of the given reservoirs. The identification of critical points is described further, in relation to
A topological net is a data representation for relationships of reservoir compartments, similar in structure to a Reeb Graph, where each node is an abstraction of a level set contact on a given reservoir. An edge connecting nodes indicates a smooth transition between two level sets. Each edge can also contain attributes such as gas/oil/water pressure gradients within each reservoir regions. A first panel 500 shows the reservoir structure of a base horizon with depth contours 502 in 100 foot increments. A second panel 504 shows the topological net corresponding to the reservoir structure of the first panel 500. As shown in
Various types of geometrical information about the original reservoir geometry may be captured in the topological net 504, such as the depth and location of the critical points 506. For example, each poly segment 508 can include markers 510 corresponding with a depth indicator 512, thus enabling the approximate depth of critical points to be ascertained. By way of example, the topological net 504 shown in
Further, the relative spatial arrangement of the critical points 506 can be displayed in the topological net. For example, the horizontal distance between the minimum critical points 516 and 518 as shown in the topological net 504 may be proportional to the actual horizontal distance between the minimum critical points 516 and 518 as indicated by the reservoir geometry. In embodiments, the horizontal distance between the critical points 516 and 518 shown in the topological net 504 may be unrelated to the actual horizontal distance between the points as indicated by the reservoir geometry.
In embodiments, the topological net 504 is obtained by representing the connected components of the depth level sets in the reservoir data structure as points. The reservoir structure can include a collection of point locations referred to as depth level sets. The real value function, ƒR, is a mapping function that maps elements of the reservoir structure to a real value, depth. A depth level set is a set of points in the real value function, ƒR, that have the same depth value. Connected components of a depth level set are those points in a given level set that are part of a single contour polygon, in other words, the pre-image of a given depth value under mapping function, ƒR. The topological net 504 can be computed by applying an equivalence relation that identifies all locations in the reservoir that belong to the same pre-image as a single point characterized by the depth of the pre-image. Thus, if X and Y are locations in the reservoir such that ƒR(X)=ƒR(Y)=D and X and Y are both components of ƒR−1(D), then the locations X and Y correspond to a single point characterized by a depth, D. Accordingly, it can be seen that each contour line 502 shown in panel 500 can be abstracted to be represented as a single point characterized by the depth of the contour line 502. The spatial coordinates of the abstracted point can also be determined to indicate the locations of the level set in the reservoir. The spatial coordinates may be associated with each corresponding abstracted points and displayed in the topological net 504. Based on the relationship and graph structure of the topological net, in which two nodes are directly connected by a segment having parent-child relationship, the critical points may be identified. For example, a node with no parent node would be identified as maximum critical point. A node with no child node would be identified as minimum critical point. And a node with two branches of parent node or child nodes would be identified as saddle critical point.
Based on the topological net 504, various compartments can be readily identified systematically or by the user, as shown in a third panel 520 of
The generation of the topological net enables identifications of the potential compartments 522 without examining the geometrical data structure of the reservoir. Furthermore, by analyzing the topological relation of the critical points on the topological net, the compartments, fluid contacts and their spill/break-over relations can be tracked. The fluid contact movements would be reflected in the level sets contours on the reservoir geometry. For example, it can be seen that compartment 522 and 524 would have a break-over point at the location of the saddle critical point 520. The fluid contact depth for compartments 522 and 524 to fluid on the compartment 526 would be on the depth of saddle critical point 520 right before the break-over occurs.
In embodiments, a three-dimensional geological model of a reservoir is generated and one or more reservoir data structures may be selected for analysis and generation of a topological net 504. The selected reservoir data structures can include one or more geological objects, including stratigraphic units such as top seal surfaces, base seal surfaces, and the like. In some embodiments, the selected stratigraphic units can include fault surfaces, in which case the boundaries of compartments could also be determined by the structural features of one or more faults.
Using the data structures of the selected reservoir geometry such as those described in
In embodiments, the base-seal surface 700 is treated as smooth and differentiable in any given location except at the boundary of the selected geological structure. As generally described above, the topological net may be defined by the equivalence relation that identifies any location X and Y in the reservoir with depth D in which D=ƒR(X)=ƒR(Y) if they belong to the same component of ƒR−1(D). The conditions used to define a Morse function, ƒR, may not be observed for locations that are non-differentiable. For example, a selected reservoir region may contain a flat surface in which a local minimum point may not be able to be determined In another case, a selected reservoir region may contain non-smoothed, sharp edges. In embodiments, the selected region may be pre-processed to identify and modify non-differentiable locations. If a non-differentiable location is identified, small changes may be made to the surface structure of the selected reservoir region to eliminate the non-differentiable locations. For example, a flat area can be represented as smooth low-sloped anticline or incline with one minimum or maximum location in the interior of the flatted area. Additionally, a non-smooth sharp corner can be removed by smoothing the tip of the corner. Critical points can then be identified based on the pre-processed reservoir region, in which all non-differentiable locations have been removed through slight modifications.
During the process of constructing the topological net 504, critical points can be identified by identifying local maxima and minima in the real value function that characterizes the base-seal surface 700. For example, local maxima and minima can be identified by applying a first derivative test or second derivative test over the real value function, ƒR. In the example provide in
The critical points used to construct the topological net 712 are used to automatically identify the potential reservoir compartments. For example, the poly segment between the two critical points 714 and 718 (or 712 and 724) can be identified as a potential reservoir compartment. The depth area bounded by the critical points 714 and 718, shown as the left branch on the topological net, is identified as a potential reservoir compartment 720, which is shown in
In embodiments, the topological net 710 can be constructed by intersecting a depth plane across the base-seal surface 700 starting from the maximum depth of the base-seal surface. The depth plane is a horizontal plane with a constant depth. The depth plane can then be raised in increments through the base-seal 700. At each depth, a set of surface contours is encountered if the depth plane intersects the surface. If one of the surface contours encountered at a certain depth is a single point, the point can be identified as a critical point. Further, if surface contours intersect, the point of intersection can also be identified as a critical point. During the generation of the topological net 710, potential reservoir compartments can be automatically identified based on the identification of particular types of critical points. For example, top saddle critical point would potentially be a location where a spill of fluid could occur from a connected top seal compartment. Referring to the example of
Embodiments of the present techniques can also be implemented on more complex reservoir geometry, such as discussed with respect to
The resulting topological net, the identifications of the potential compartments, and the relationships between the compartments can be stored, for example, in a non-transitory, computer-readable medium. In embodiments, this data can be used to automatically construct a reservoir connectivity diagram based on the identification of the potential compartments and their relationships. In embodiments, the resulting topological net 802 can be displayed to the user along with the original structural data of the corresponding reservoir. Thus, the topological net 802 may provide visual representations of the topological and geometrical structure, enabling potential compartments and there relationships to be more readily identifiable by the user.
It will be appreciated that the resulting topological net 802 may be a three dimensional structure. In other words, the topological net 802 includes components that extend into or out of the page. In embodiments, the topological net 802 may be rendered by the visualization engine on a display that enables the user to rotate the topological net 802 to better visualize the three-dimensional structure of the topological net 802. In embodiments, the geometry of the reservoir compartments can also be re-constructed from the topological net 802, based on the depth information associated with the critical points 804 and the corresponding depth level sets of the reservoir geometry. In embodiments, the topological net 802 may also be superimposed over a display of the geological model used to generate the topological net 802. In embodiments, the topological net may be used to assist in a reservoir connectivity analysis (RCA), including dynamic reservoir connectivity analysis (DCA). The reservoir connectivity analysis may be better understood with reference to
At block 904, a topological net may be generated based on the structural data, as described above. For example, a real value function, ƒR, may be defined for the structural data. In embodiments, the real value function, ƒR, may be modified to eliminate non-differentiable locations in the selected reservoir region so that the real value function, ƒR, will be smooth and differentiable in all locations except at the boundary of the selected reservoir region, as described above in relation to
At block 906, critical points within the selected reservoir region can be identified based on the real value function, ƒR, as described above in relation to
At block 906, potential compartments and the relationships between compartments may be identified based on critical points of the topological net. The poly segments between critical points can be identified as potential reservoir compartments. The critical points can be identified as connections between reservoir compartments. Further, although shown as separate blocks, it will be appreciated that the identification of potential reservoir compartments and their relationships can be performed during the generation of the topological net. In embodiments, several topological nets can be generated based on different selections of the reservoir, in which case the steps 902 to 908 may be repeated for each selected reservoir region. In embodiments, the identifications of the potential reservoir compartments and the relationships between the reservoir compartments can be used to generate a reservoir connectivity diagram, as shown in
An RCA model, such as the one shown in
In an exemplary embodiment, potential compartments can be defined and added to the connectivity diagram 1000 based on one or more topological nets. All of the potential compartments 1002 pertaining to a reservoir may be included in the connectivity diagram, including system exit points, leak points, and spill points for gas, oil, and water. Within a potential compartment, the contact between fluids and production data, such as pressure, can be used to check the dynamic of the compartmentalization in production scale.
It will be appreciated that the topological net can also be used in conjunction with other techniques for analyzing reservoirs. For example, in embodiments, the topological net can be used to develop a compartment matrix that shows which compartments share a fluid column in original pressure communication. In embodiments, based on the data provided by the topological net, graph analysis algorithms such as shortest path and maximum flow algorithms could be used to derive additional information about reservoir connectivity, such as the location of weak links among connected compartments or the locations to inject water in order to increase the production, etc. Further, since the topological net includes depth data and linkages to the compartment geometry, one can also mark the gas/oil/water contact movements and/or their pressures gradients on the poly segments of the topological net to assist the production scale connectivity analysis. In embodiments, the three-dimensional shared earth model can be used to annotate the topological net together with the three-dimensional representation of the reservoir geometry for interactive visualization and processing of the RCA/DCA models.
At block 1104, one or more of the reservoir data structures may be selected for further processing, as described in relation to
At block 1106 a topological net may be generated as summarized above in relation to
At block 1110, the topological nets and/or corresponding connectivity diagram are used to perform the reservoir connectivity analysis. During the reservoir connectivity analysis the reservoir connectivity model could be analyzed to address the issues of uncertainty in structural and stratigraphic interpretations as well as fluid contact movements during the production activities. For example, the compartment identification and spill relations would be affected by the whether or not an area of fault juxtaposition is sealed. Another example is that the geometry uncertainty in some areas of top/base-seal surfaces interpretation may result in a different topology structure. Uncertainties may be resolved by comparing geological data such as measured pressures against the hypothetical pressures that would be expected based on the given connectivity diagram or topological net. Production data such as depleting pressure or flow rates from production wells may also used to check the consistency of the RCA/DCA model.
At block 1112, a determination is made regarding whether inconsistencies have been identified between the measured and expected data. If no inconsistencies are identified, the process flow may advance to block 1114 and terminate. The resulting geologic model provided by the reservoir connectivity analysis or the topological nets can then be used to guide future production decisions, such as whether an and where to drill new well bores. If inconsistencies are identified, the process flow may advance to block 1116, wherein an attempt may be made to reconcile the inconsistencies.
At block 1116, the geologic structure of the reservoir data can be modified to try to provide a better fit between observations and the reservoir connectivity model. The user can specify changes to be made to the geologic structure and thus the reservoir connectivity diagram by specifying certain changes to the one topological net. For example, fault juxtaposition may be changed from permeable to sealed by eliminating one or more connected critical points and their associated poly segments from the topological net. Conversely, a sealed fault can be changed to leaky at a certain depth, which would add a critical point and may result in potential compartments being added to the topological net. After the geologic structure of the reservoir data is modified, process flow can return to block 1108 and a new reservoir connectivity diagram can be generated based on the modified topological net.
To simply the connectivity analysis, the potential compartments shown in the topological net 1208 can be merged in the initial oil/water connectivity analysis. Thus, two compartments 1216 and 1218 can be extracted from the topological net 1208, added to a reservoir connectivity diagram, and connected by a spill control location corresponding to the spill point 1220 shown in the topological net 1208. Without the geometrical complexity of the original structure map, the topological net 1208 could be used to indicate the possibility that oil/water pressure gradients on both branches of the compartments 1216 and 1218 will maintain equilibrium without any additional charge of fluids. However, continued oil charge to compartment 1216 may result in pressure gradient changes in different branches of the compartments 1216 and 1218. For example,
The computer system 1300 may also include computer components such as computer-readable media. Examples of computer-readable media include a random access memory (RAM) 1306, which may be SRAM, DRAM, SDRAM, or the like. The computer system 1300 may also include additional computer-readable media such as a read-only memory (ROM) 1308, which may be PROM, EPROM, EEPROM, or the like. RAM 1306 and ROM 1308 hold user and system data and programs, as is known in the art. The computer system 1300 may also include an input/output (I/O) adapter 1310, a communications adapter 1322, a user interface adapter 1316, and a display adapter 1318. In an exemplary embodiment of the present techniques, the display adaptor 1318 may be adapted to provide a 3D representation of a 3D earth model. Moreover, an exemplary embodiment of the display adapter 1318 may comprise a visualization engine that is adapted to provide a visualization of extracted data, such as geological structures and topological nets, among others. The I/O adapter 1310, the user interface adapter 1316, and/or communications adapter 1322 may, in certain embodiments, enable a user to interact with computer system 1300 in order to input information.
The I/O adapter 1310 may connects a storage device(s) 1312, such as one or more of hard drive, compact disc (CD) drive, floppy disk drive, tape drive, etc. to computer system 1300. The storage device(s) may be used when RAM 1306 is insufficient for the memory requirements associated with storing data for operations of embodiments of the present techniques. The data storage of the computer system 1300 may be used for storing information and/or other data used or generated as disclosed herein. User interface adapter 1316 couples user input devices, such as a keyboard 1324, a pointing device 1314 and/or output devices to the computer system 1300. The display adapter 1318 is driven by the CPU 1302 to control the display on a display device 1320 to, for example, display information or a representation pertaining to a portion of a subsurface region under analysis.
The architecture of system 1300 may be varied as desired. For example, any suitable processor-based device may be used, including without limitation personal computers, laptop computers, computer workstations, and multi-processor servers. Moreover, embodiments may be implemented on application specific integrated circuits (ASICs) or very large scale integrated (VLSI) circuits. In fact, persons of ordinary skill in the art may use any number of suitable structures capable of executing logical operations according to the embodiments.
In an exemplary embodiment of the present techniques, input data to the computer system 1300 may comprise geologic and geophysical data volumes/models such as seismic volumes, geological models and reservoir models. Input data may additionally comprise engineering data, such as drilled well paths and/or planned well paths. Computational implementations according to exemplary embodiments of the present techniques may comprise connections and/or access to computational implementations of processes to model and investigate the engineering and reservoir model properties and path creation method. Relevant connections may include facilities to perform geological model analysis, reservoir connectivity analysis, engineering analysis, and the like.
The present techniques may be susceptible to various modifications and alternative forms, and the exemplary embodiments discussed above have been shown only by way of example. However, the present techniques are not intended to be limited to the particular embodiments disclosed herein. Indeed, the present techniques include all alternatives, modifications, and equivalents falling within the spirit and scope of the appended claims.
This application is the National Stage entry under 35 U.S.C. 371 of PCT/US2011/063359 that published as WO 2012/102784 and was filed on 06 Dec. 2011, which claims the benefit of U. S. Provisional Application No. 61/436,462, filed on 26 Jan. 2011, each of which is incorporated by reference, in its entirety, for all purposes.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/US2011/063359 | 12/6/2011 | WO | 00 | 6/25/2013 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2012/102784 | 8/2/2012 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4794534 | Millheim | Dec 1988 | A |
5468088 | Shoemaker et al. | Nov 1995 | A |
5708764 | Borrel et al. | Jan 1998 | A |
5905657 | Celniker | May 1999 | A |
5966141 | Ito et al. | Oct 1999 | A |
5992519 | Ramakrishman et al. | Nov 1999 | A |
6002985 | Stephenson | Dec 1999 | A |
6035255 | Murphy et al. | Mar 2000 | A |
6044328 | Murphy et al. | Mar 2000 | A |
6049758 | Bunks et al. | Apr 2000 | A |
6070125 | Murphy et al. | May 2000 | A |
6101447 | Poe, Jr. | Aug 2000 | A |
6219061 | Lauer et al. | Apr 2001 | B1 |
6236942 | Bush | May 2001 | B1 |
6236994 | Swartz et al. | May 2001 | B1 |
6323863 | Shinagawa et al. | Nov 2001 | B1 |
6353677 | Pfister et al. | Mar 2002 | B1 |
6373489 | Lu et al. | Apr 2002 | B1 |
6438069 | Ross et al. | Aug 2002 | B1 |
6490528 | Cheng et al. | Dec 2002 | B2 |
6516274 | Cheng et al. | Feb 2003 | B2 |
6519568 | Harvey et al. | Feb 2003 | B1 |
6529833 | Fanini et al. | Mar 2003 | B2 |
6549854 | Malinvemo et al. | Apr 2003 | B1 |
6549879 | Cullick et al. | Apr 2003 | B1 |
6612382 | King | Sep 2003 | B2 |
6643656 | Peterson | Nov 2003 | B2 |
6715551 | Curtis et al. | Apr 2004 | B2 |
6757613 | Chapman et al. | Jun 2004 | B2 |
6765570 | Cheung et al. | Jul 2004 | B1 |
6766254 | Bradford et al. | Jul 2004 | B1 |
6772066 | Cook | Aug 2004 | B2 |
6823266 | Czernuszenko et al. | Nov 2004 | B2 |
6826483 | Anderson et al. | Nov 2004 | B1 |
6823732 | Haarstad | Dec 2004 | B2 |
6829570 | Thambynayagam et al. | Dec 2004 | B1 |
6912467 | Schuette | Jun 2005 | B2 |
6912468 | Marin et al. | Jun 2005 | B2 |
6978210 | Suter et al. | Dec 2005 | B1 |
6980939 | Dhir et al. | Dec 2005 | B2 |
6980940 | Gurpinar et al. | Dec 2005 | B1 |
6993434 | Cheng et al. | Jan 2006 | B2 |
7003439 | Aldred et al. | Feb 2006 | B2 |
7027925 | Terentyev et al. | Apr 2006 | B2 |
7031842 | Musat et al. | Apr 2006 | B1 |
7035255 | Tzeng | Apr 2006 | B2 |
7047170 | Feldman et al. | May 2006 | B2 |
7050953 | Chiang et al. | May 2006 | B2 |
7054752 | Zabalza-Mezghani et al. | May 2006 | B2 |
7079953 | Thorne et al. | Jul 2006 | B2 |
7085696 | King | Aug 2006 | B2 |
7089167 | Poe | Aug 2006 | B2 |
7096172 | Colvin et al. | Aug 2006 | B2 |
7098908 | Acosta et al. | Aug 2006 | B2 |
7109717 | Constable | Sep 2006 | B2 |
7136064 | Zuiderveld | Nov 2006 | B2 |
7181380 | Dusterhoft et al. | Feb 2007 | B2 |
7203342 | Pedersen | Apr 2007 | B2 |
7225078 | Shelley et al. | May 2007 | B2 |
7248258 | Acosta et al. | Jul 2007 | B2 |
7278496 | Leuchtenberg | Oct 2007 | B2 |
7280932 | Zoraster et al. | Oct 2007 | B2 |
7281213 | Callegari | Oct 2007 | B2 |
7283941 | Horowitz et al. | Oct 2007 | B2 |
7298376 | Chuter | Nov 2007 | B2 |
7314588 | Blankenship | Jan 2008 | B2 |
7328107 | Strack et al. | Feb 2008 | B2 |
7330791 | Kim et al. | Feb 2008 | B2 |
7337067 | Sanstrom | Feb 2008 | B2 |
7340347 | Shiny et al. | Mar 2008 | B2 |
7343275 | Lenormand et al. | Mar 2008 | B2 |
7362329 | Zuiderveld | Apr 2008 | B2 |
7363866 | Gnedenko et al. | Apr 2008 | B2 |
7366616 | Bennett et al. | Apr 2008 | B2 |
7367411 | Leuchtenberg | May 2008 | B2 |
7395252 | Anderson et al. | Jul 2008 | B2 |
7409438 | McConnell et al. | Aug 2008 | B2 |
7412363 | Callegari | Aug 2008 | B2 |
7437358 | Arrouye et al. | Oct 2008 | B2 |
7451066 | Edwards et al. | Nov 2008 | B2 |
7458062 | Coulthard et al. | Nov 2008 | B2 |
7460957 | Prange et al. | Dec 2008 | B2 |
7478024 | Gurpinar et al. | Jan 2009 | B2 |
7512543 | Raghuraman et al. | Mar 2009 | B2 |
7519976 | Blevins | Apr 2009 | B2 |
7539625 | Klumpen et al. | May 2009 | B2 |
7548873 | Veeningen et al. | Jun 2009 | B2 |
7565243 | Kim et al. | Jul 2009 | B2 |
7576740 | Dicken | Aug 2009 | B2 |
7596481 | Zamora et al. | Sep 2009 | B2 |
7603264 | Zamora et al. | Oct 2009 | B2 |
7606666 | Repin et al. | Oct 2009 | B2 |
7616213 | Chuter | Nov 2009 | B2 |
7620534 | Pita et al. | Nov 2009 | B2 |
7627430 | Hawtin | Dec 2009 | B2 |
7630914 | Veeningen et al. | Dec 2009 | B2 |
7652779 | Wu et al. | Jan 2010 | B2 |
7657407 | Logan | Feb 2010 | B2 |
7657414 | Zamora et al. | Feb 2010 | B2 |
7657494 | Wilkinson et al. | Feb 2010 | B2 |
7668700 | Erignac et al. | Feb 2010 | B2 |
7672826 | Chen et al. | Mar 2010 | B2 |
7684929 | Prange et al. | Mar 2010 | B2 |
7711550 | Feinberg et al. | May 2010 | B1 |
7716028 | Montaron et al. | May 2010 | B2 |
7716029 | Couet et al. | May 2010 | B2 |
7725302 | Ayan et al. | May 2010 | B2 |
7739089 | Gurpinar et al. | Jun 2010 | B2 |
7743006 | Woronow et al. | Jun 2010 | B2 |
7752022 | Fomel et al. | Jul 2010 | B2 |
7778811 | Kelfoun | Aug 2010 | B2 |
7796468 | Kellogg | Sep 2010 | B2 |
7814989 | Nikolakis-Mouchas et al. | Oct 2010 | B2 |
7876705 | Gurpinar et al. | Jan 2011 | B2 |
7878268 | Chapman et al. | Feb 2011 | B2 |
7886285 | Asselin et al. | Feb 2011 | B2 |
7899657 | Martine | Mar 2011 | B2 |
7913190 | Grimaud et al. | Mar 2011 | B2 |
7925483 | Xia et al. | Apr 2011 | B2 |
7925695 | McConnell et al. | Apr 2011 | B2 |
7953585 | Gurpinar et al. | May 2011 | B2 |
7953587 | Bratton et al. | May 2011 | B2 |
7970545 | Sanstrom | Jun 2011 | B2 |
7986319 | Dommisse et al. | Jul 2011 | B2 |
7991600 | Callegari | Aug 2011 | B2 |
7995057 | Chuter | Aug 2011 | B2 |
8005658 | Tilke et al. | Aug 2011 | B2 |
8044602 | Smith | Oct 2011 | B2 |
8055026 | Pedersen | Nov 2011 | B2 |
8064684 | Ratti et al. | Nov 2011 | B2 |
8073664 | Schottle et al. | Dec 2011 | B2 |
8094515 | Miller et al. | Jan 2012 | B2 |
8103493 | Sagert et al. | Jan 2012 | B2 |
8145464 | Arnegaard et al. | Mar 2012 | B2 |
8155942 | Sarma et al. | Apr 2012 | B2 |
8199166 | Repin et al. | Jun 2012 | B2 |
8204728 | Schottle et al. | Jun 2012 | B2 |
8249844 | Dale et al. | Aug 2012 | B2 |
8259126 | Chuter | Sep 2012 | B2 |
8280635 | Ella et al. | Oct 2012 | B2 |
8296720 | Coulthard et al. | Oct 2012 | B2 |
8301426 | Abasov et al. | Oct 2012 | B2 |
8325179 | Murray et al. | Dec 2012 | B2 |
8346695 | Pepper et al. | Jan 2013 | B2 |
8364404 | Legendre et al. | Jan 2013 | B2 |
8381815 | Karanikas | Feb 2013 | B2 |
8392163 | Liu | Mar 2013 | B2 |
8427904 | Miller et al. | Apr 2013 | B2 |
8560476 | Anderson et al. | Oct 2013 | B2 |
8578000 | Van Wie et al. | Nov 2013 | B2 |
8598882 | Meeks | Dec 2013 | B2 |
8638328 | Lin | Jan 2014 | B2 |
8727017 | Hilliard et al. | May 2014 | B2 |
8736600 | Lin et al. | May 2014 | B2 |
8751208 | Brouwer et al. | Jun 2014 | B2 |
8797319 | Lin | Aug 2014 | B2 |
8803878 | Andersen et al. | Aug 2014 | B2 |
8812334 | Givens et al. | Aug 2014 | B2 |
8849639 | Brown et al. | Sep 2014 | B2 |
8849640 | Holl et al. | Sep 2014 | B2 |
8868540 | Ture et al. | Oct 2014 | B2 |
8884964 | Holl et al. | Nov 2014 | B2 |
8931580 | Cheng et al. | Jan 2015 | B2 |
9026417 | Sequeira, Jr. et al. | May 2015 | B2 |
9047689 | Stolte et al. | Jun 2015 | B2 |
9593558 | Sequeira, Jr. | Mar 2017 | B2 |
9874648 | Braaksma | Jan 2018 | B2 |
20010006387 | Bennis et al. | Jul 2001 | A1 |
20020049575 | Jalali et al. | Apr 2002 | A1 |
20020067373 | Roe et al. | Jun 2002 | A1 |
20020177955 | Jalali et al. | Nov 2002 | A1 |
20030072907 | Lerner et al. | Apr 2003 | A1 |
20030078794 | Knapp | Apr 2003 | A1 |
20040012670 | Zhang | Jan 2004 | A1 |
20040153298 | Colvin et al. | Aug 2004 | A1 |
20040220788 | Assa et al. | Nov 2004 | A1 |
20050002571 | Hiraga et al. | Jan 2005 | A1 |
20050119959 | Eder | Jun 2005 | A1 |
20050120242 | Mayer et al. | Jun 2005 | A1 |
20050171700 | Dean | Aug 2005 | A1 |
20050199391 | Cudmore et al. | Sep 2005 | A1 |
20060085174 | Hemanthkumar | Apr 2006 | A1 |
20060224423 | Sun et al. | Oct 2006 | A1 |
20060235666 | Assa et al. | Oct 2006 | A1 |
20060247903 | Schottle | Nov 2006 | A1 |
20060265508 | Angel et al. | Nov 2006 | A1 |
20070076044 | Corley, Jr. et al. | Apr 2007 | A1 |
20070088707 | Durgin et al. | Apr 2007 | A1 |
20070100703 | Noda | May 2007 | A1 |
20070185696 | Moran et al. | Aug 2007 | A1 |
20070199721 | Givens et al. | Aug 2007 | A1 |
20070266082 | McConnell et al. | Nov 2007 | A1 |
20070294034 | Bratton et al. | Dec 2007 | A1 |
20080088621 | Grimaud et al. | Apr 2008 | A1 |
20080109490 | Arnegaand et al. | May 2008 | A1 |
20080120076 | Thambynayagam et al. | May 2008 | A1 |
20080165185 | Smith et al. | Jul 2008 | A1 |
20080165186 | Lin | Jul 2008 | A1 |
20080243749 | Pepper et al. | Oct 2008 | A1 |
20080289877 | Nikolakis-Mouchas et al. | Nov 2008 | A1 |
20080297510 | Callegari | Dec 2008 | A1 |
20080306803 | Vaal et al. | Dec 2008 | A1 |
20090027380 | Rajan et al. | Jan 2009 | A1 |
20090027385 | Smith | Jan 2009 | A1 |
20090037114 | Peng et al. | Feb 2009 | A1 |
20090043507 | Dommisse et al. | Feb 2009 | A1 |
20090070086 | Le Ravalec et al. | Mar 2009 | A1 |
20090089028 | Sagert et al. | Apr 2009 | A1 |
20090125362 | Reid et al. | May 2009 | A1 |
20090132170 | Krueger et al. | May 2009 | A1 |
20090157367 | Meyer et al. | Jun 2009 | A1 |
20090182541 | Crick et al. | Jul 2009 | A1 |
20090198447 | Legendre et al. | Aug 2009 | A1 |
20090200014 | Schottle et al. | Aug 2009 | A1 |
20090222742 | Pelton et al. | Sep 2009 | A1 |
20090229819 | Repin et al. | Sep 2009 | A1 |
20090240564 | Boerries et al. | Sep 2009 | A1 |
20090295792 | Liu et al. | Dec 2009 | A1 |
20090299709 | Liu | Dec 2009 | A1 |
20090303233 | Lin et al. | Dec 2009 | A1 |
20090319243 | Suarez-Rivera et al. | Dec 2009 | A1 |
20100013831 | Gilje et al. | Jan 2010 | A1 |
20100053161 | Chuter | Mar 2010 | A1 |
20100125349 | Abasov et al. | May 2010 | A1 |
20100132450 | Pomerantz et al. | Jun 2010 | A1 |
20100161292 | Shook et al. | Jun 2010 | A1 |
20100161300 | Yeten et al. | Jun 2010 | A1 |
20100169018 | Brooks | Jul 2010 | A1 |
20100171740 | Andersen et al. | Jul 2010 | A1 |
20100172209 | Miller et al. | Jul 2010 | A1 |
20100174489 | Bryant et al. | Jul 2010 | A1 |
20100179797 | Cullick et al. | Jul 2010 | A1 |
20100185395 | Pirovolou et al. | Jul 2010 | A1 |
20100191516 | Benish et al. | Jul 2010 | A1 |
20100206559 | Sequeira, Jr. et al. | Aug 2010 | A1 |
20100214870 | Pepper et al. | Aug 2010 | A1 |
20100225642 | Murray et al. | Sep 2010 | A1 |
20100235154 | Meurer | Sep 2010 | A1 |
20100252270 | Kim et al. | Oct 2010 | A1 |
20100271232 | Clark et al. | Oct 2010 | A1 |
20100283788 | Rothnemer et al. | Nov 2010 | A1 |
20100286917 | Hazlett et al. | Nov 2010 | A1 |
20100299125 | Ding et al. | Nov 2010 | A1 |
20100307742 | Phillips et al. | Dec 2010 | A1 |
20110002194 | Imhof | Jan 2011 | A1 |
20110022435 | Reid et al. | Jan 2011 | A1 |
20110029293 | Petty et al. | Feb 2011 | A1 |
20110040533 | Terrens et al. | Feb 2011 | A1 |
20110040536 | Levitan | Feb 2011 | A1 |
20110044532 | Holl et al. | Feb 2011 | A1 |
20110054857 | Moguchaya | Mar 2011 | A1 |
20110060572 | Brown et al. | Mar 2011 | A1 |
20110063292 | Holl | Mar 2011 | A1 |
20110074766 | Page et al. | Mar 2011 | A1 |
20110099547 | Banga | Apr 2011 | A1 |
20110106514 | Omeragic et al. | May 2011 | A1 |
20110107246 | Vik | May 2011 | A1 |
20110112802 | Wilson et al. | May 2011 | A1 |
20110115787 | Kadlec | May 2011 | A1 |
20110126192 | Frost et al. | May 2011 | A1 |
20110153300 | Holl et al. | Jun 2011 | A1 |
20110157235 | FitzSimmons | Jun 2011 | A1 |
20110161133 | Staveley et al. | Jun 2011 | A1 |
20110168391 | Saleri et al. | Jul 2011 | A1 |
20110175899 | Bittar et al. | Jul 2011 | A1 |
20120137281 | Kleiner et al. | May 2012 | A1 |
20120150449 | Dobin | Jun 2012 | A1 |
20120166166 | Czernuszenko | Jun 2012 | A1 |
20120285701 | Cheng | Nov 2012 | A1 |
20130064040 | Imhof | Mar 2013 | A1 |
20130112407 | Cheng et al. | May 2013 | A1 |
20130140037 | Sequeira, Jr. | Jun 2013 | A1 |
20130317798 | Cheng et al. | Nov 2013 | A1 |
20130338984 | Braaksma | Dec 2013 | A1 |
20130338987 | Cheng et al. | Dec 2013 | A1 |
20140278117 | Dobin et al. | Sep 2014 | A1 |
20140365192 | Cheng et al. | Dec 2014 | A1 |
20150049084 | Cheng et al. | Feb 2015 | A1 |
20150094994 | Sequeira, Jr. et al. | Apr 2015 | A1 |
20160003008 | Uribe | Jan 2016 | A1 |
Number | Date | Country |
---|---|---|
1036341 | Feb 2005 | EP |
1230566 | Feb 2005 | EP |
2000014574 | Mar 2000 | WO |
2008121950 | Oct 2008 | WO |
2009039422 | Mar 2009 | WO |
2009148681 | Dec 2009 | WO |
2011038221 | Mar 2011 | WO |
Entry |
---|
Peer-Timo Bremer, NPL, “Maximizing Adaptivity in Hierarchical Topological Models”, Mar. 2005 (google). |
P. Vrolijk, B. James, R. Myers, J. Maynard, L. Sumpter, and M. Sweet, “Reservoir Connectivity Analysis-Defining Reservoir Connections and Plumbing”, SPE 93577, pp. 1-23, 2005. |
Bremer et al, “Maximizing Adaptivity in Hierarchical topology Models using Extrema Trees” Department of Computer Science, 18 pgs, 2005. |
P. Vrolijk, B. James, R. Myers, J. Maynard, L. Sumpter, and M. Sweet, “Reservoir Connectivity Analysis-Defining Reservoir Connections and Plumbing”, pp. 1-23, 2005. |
P. T. Bremer, V. Pascucci, and B. Hamann, “Maximizing Adaptivity in Hierarchical topology Models using Extrema Trees”, pp. 1-18, 2005. |
International Search Report and Written Opinion for corresponding PCT Application No. PCT/US2011/63359 dated Apr. 19, 2012, (14 pages). |
Bremer et al, “Maximizing Adaptivity in Hierarchical Topological Models Using Extrema Trees,” Department of Computer Science, 18 pp. |
Gyulassy et al., “A Topological Approach to Simplification of Three-dimensional Scalar Functions,” IEEE Transactions on Visualization and Cumputer Graphics, pp. 1-13. |
Weber et al., “Topology-controlled Volume Rendering,” IEEE, pp. 1-13. |
Carr et al., Contour Tree Simplification With Local Geometric Measures, Dept. of Computer Science University College Dublin, (2 pages). |
Stephen Smale, “Morse Inequalities for a Dynamical System”, Bulletin of American Mathematical Society, 66, 43-491960. |
Y.I.Gingold et al., “Control-topology Filtering”, Computer-Aided Design (2007), 9 pages. |
Michael Sweet et al., Genesis Field, Gulf of Mexico: Recognizing Reservoir Compartments on Geologic and Production Time Scales in Deep-Water Reservoirs, AAPG Bulletin) (Dec. 2007) pp. 1701-1729). |
M. Ellen Meurer et al., “Reservoir Connectivity: Definitions, Strategies and Applications”, AAPG Search and Discovery (2008). |
Bharat, K, et al. (2001), “Who Links to Whom. Mining Linkage Between Web sites”, Proceedings of the 2001 IEE Int'l Conf. on Data Mining, pp. 51-58. |
Cabral, B., et al (1995). “Accelerated vol. Rendering and Tomographic Reconstruction Using Texture Mapping Hardware”, IEEE in Symposium on Volume Visualization, pp. 91-98, 131. |
Crawfis, R., et al. (1992), “Direct Volume Visualization of Three-Dimensional Vector Fields”, Proceedings of the 1992 Workshop on Volume Visualization, pp. 55-60. |
Dhillon, S. (2008), “Managing License Incompatibilities Distributing Eclipse Application Stacks”, Thesis, pp. 1-116. |
Drebin, R., et al. (1988), “Volume Rendering” Computer Graphics, the Proceedings of 1988 SIGGRAPH Conference, vol. 22, No. 4, pp. 65-74. |
Lorensen, W., et al., (1987), “Marching Cubes: A High-Resolution 3D Surface Construction Algorithm”, Computer Graphics, The Proceeding of 1987 SIGGRAPH Conference, vol. 21, No. 4, pp. 163-169. |
McCann, P., et al. (2003), “Horizontal Well Path Planning and Correction Using Optimization Techniques,” J. of Energy Resources Tech. 123, pp. 187-193. |
Mugerin. C., et al. (2002), “Well Design Optimization: Implementation in GOCAD,” 22nd Gocade Meeting, Jun. 2002 pp. 1-14. |
Rainaud, J.F., et al. (2004), “WOG—Well Optimization by Geosteering: A Pilot Software for Cooperative Modeling on Internet,” Oil & Gas Science & Tech. 59(4), pp. 427-445. |
Reed, P., et al. (2003) “Simplifying Multiobjective Optimization Using Genetic Algorithms,” Proceedings of World Water and Environmental Resources Congress, 10 pgs. |
Udoh, E., et at (2003), “Applications of Strategic Optimization Techniques to Development and Management of Oil and Gas Resources”, 27th SPE Meeting, 16 pgs. |
Number | Date | Country | |
---|---|---|---|
20130338987 A1 | Dec 2013 | US |
Number | Date | Country | |
---|---|---|---|
61436462 | Jan 2011 | US |