EP2603877B1 - Systems and methods for creating a surface in a faulted space - Google Patents
Systems and methods for creating a surface in a faulted space Download PDFInfo
- Publication number
- EP2603877B1 EP2603877B1 EP10855973.3A EP10855973A EP2603877B1 EP 2603877 B1 EP2603877 B1 EP 2603877B1 EP 10855973 A EP10855973 A EP 10855973A EP 2603877 B1 EP2603877 B1 EP 2603877B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- fault
- value
- well top
- grid node
- adjusted
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims description 41
- 230000015572 biosynthetic process Effects 0.000 claims description 5
- 238000004088 simulation Methods 0.000 claims description 4
- 238000009499 grossing Methods 0.000 claims description 2
- 238000003860 storage Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 229930195733 hydrocarbon Natural products 0.000 description 1
- 150000002430 hydrocarbons Chemical class 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/17—Function evaluation by approximation methods, e.g. inter- or extrapolation, smoothing, least mean square method
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V1/00—Seismology; Seismic or acoustic prospecting or detecting
- G01V1/28—Processing seismic data, e.g. for interpretation or for event detection
- G01V1/30—Analysis
- G01V1/301—Analysis for determining seismic cross-sections or geostructures
- G01V1/302—Analysis for determining seismic cross-sections or geostructures in 3D data cubes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V20/00—Geomodelling in general
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/60—Analysis
- G01V2210/64—Geostructures, e.g. in 3D data cubes
- G01V2210/641—Continuity of geobodies
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/60—Analysis
- G01V2210/64—Geostructures, e.g. in 3D data cubes
- G01V2210/642—Faults
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/60—Analysis
- G01V2210/66—Subsurface modeling
- G01V2210/665—Subsurface modeling using geostatistical modeling
Definitions
- the present disclosure generally relates to systems and methods for creating a surface in a faulted space. More particularly, the present disclosure relates to creating a surface by interpolation in a faulted space.
- Interpolation techniques are often used in the oil and gas industry to create a surface, sometimes referred to as a horizon, which may be used to locate hydrocarbons in a subsurface formation. Creating a surface from well tops, which are points on a well representing a surface level on a horizon at that point, in a faulted space is always challenging. It is also possible to use secondary information, such as, but not limited to, seismic data, to aid in the creation of the interpolated surface. Ideally, the interpolation should be done in the unfaulted space and then translated back into the faulted domain. This technique, which is commonly referred to as global unfaulting, effectively restores the faulted space to the unfaulted space on a global basis before faulting occurred. However, global unfaulting is very difficult, especially in the presence of many faults.
- Refinement gridding is an interpolation technique that translates a coarse approximation of known data into a finer approximation by increasing the number of interpolated nodes on a step-by-step basis.
- Refinement gridding interpolation therefore, provides an approach to creating a surface in the faulted space directly. It generates very smooth surfaces when there is no fault, and the performance is very good, but it often creates significant undesirable artifacts 102 along the fault and at its edges as illustrated by the interpolated surface 100 in FIG. 1 .
- Traditional kriging which is synonymous with optimal prediction, is another interpolation technique, which predicts unknown values from data observed in known locations.
- Kriging uses variograms to express the spatial variation, and minimizes the error of predicted values, which are estimated by spatial distribution of the predicted values.
- Traditional Kriging in the presence of a fault can generate cleaner edges along the fault when search neighborhoods are restricted to one side of the fault 202 or the other side of the fault 204 as illustrated by the interpolated surface 200 in FIG. 2 .
- Traditional kriging does not always eliminate artifacts 302 near fault terminations as illustrated by the interpolated surface 300 in FIG. 3 .
- US 2003/023383 A1 discloses a system for information extraction from geologic time volumes.
- US 2003/018436 A1 discloses a system for multi-dimensional data analysis.
- US 6 138 076 A discloses an automatic non-artificially extended fault surface based horizon modelling system.
- the present disclosure meets the above needs and overcomes one or more deficiencies in the prior art by providing systems and methods for creating a surface in a faulted space using interpolation techniques.
- the present disclosure includes a computer-implemented method for creating a surface related to a subsurface formation and having one or more faults, based on data comprising well tops and faults associated with the subsurface formation, the method comprising: a) estimating a surface level on each side of each fault, an elevation difference between the estimated surface levels on each side of a respective fault representing a respective fault throw value; b) adjusting each fault throw value; c) locating each local well top within a predefined search neighborhood from a grid node within a grid on the surface; d) identifying each fault that crosses a vector between the grid node and each respective local well top, each vector between the grid node and each respective local well top representing an intersecting vector; e) accumulating each adjusted fault throw value along each respective intersecting vector, which represents an accumulated fault throw value for each respective intersecting vector; f) adjusting a value for each local well top based on a respective accumulated fault throw value, the value for each local well top being adjusted by adding the value of
- step may be used herein to describe different elements of methods employed, the term should not be interpreted as implying any particular order among or between various steps herein disclosed unless otherwise expressly limited by the description to a particular order. While the following description refers to the oil and gas industry, the systems and methods of the present invention are not limited thereto and may also be applied to other industries to achieve similar results.
- FIG. 4 a flow diagram illustrates one embodiment of a method 400 for implementing the present invention.
- the method 400 creates a surface in a faulted space using interpolation techniques.
- the method 400 in this example uses only well tops across faults to create the interpolated surface.
- the method 400 not only generates sharp edges around the faults, but also interpolates smoothly away from them.
- input data are stored using the client interface and/or video interface described in reference to FIG. 7 .
- the input data comprises well tops and faults comprising numerous fault segments.
- Each well top is preferably stored in KD tree, which is a well known data structure for fast and efficient retrieval of the input data.
- Each fault segment is preferably stored in a Quad tree, which is also a well known data structure used for fast and efficient retrieval.
- step 404 the surface level along both sides of each fault is estimated.
- the estimate is preferably done by finding each well top, which is stored as input data in step 402 , in each fault block and interpolating the surface level along both sides of each fault using one or more, but not necessarily all, of the well tops found in each respective fault block. Interpolation is meant to encompass any well known interpolation technique such as, for example, kriging, collocated cokriging, simulation and collocated cosimulation algorithms.
- Each fault throw which is defined as the amount of vertical displacement ( i.e. elevation change) between the estimated surface levels, is stored as a value in the Quad tree data structure described in reference to step 402 with the estimated surface levels. As illustrated in FIG.
- one fault block is defined by fault segments 502 , 504 , 506 and an edge 508 of the interpolated surface 500.
- Another fault block is defined by fault segments 510 , 512 , 514 and 516 .
- the real data used for the interpolated surface 500 includes 9,995 fault segments and 329 well tops, which are illustrated within a 500 by 500 grid 540.
- a fault 501 includes fault segment 502 at one end of the fault 501 and another fault segment 514 toward another end of the fault 501.
- Each fault block may contain one or more well tops as demonstrated by the fault block containing well tops 518-526.
- the fault block defined by an edge 528 of the interpolated surface 500 and fault segments 530 , 532 and 534 may also contain one or more well tops.
- the surface level 538 along one side of the fault 501 therefore, was estimated by i) finding each well top in the fault block defined by fault segments 502 , 504 , 506 and the edge 508 of the interpolated surface 500 ; and ii) kriging that surface level using one or more of the well tops in the fault block.
- the surface level 536 along another side of the fault 501 therefore, was estimated by i) find each well top in the fault block defined by fault segments 530 , 532 , 534 and the edge 528 of the interpolated surface 500 ; and ii) kriging that surface level using one or more of the well tops in the fault block.
- the surface level on each side of the fault 501 may be estimated in this manner (fault block by fault block) from one end of the fault 501 to another end of the fault 501. Alternatively, this step may begin anywhere between each end of the fault 501 and proceed in any manner or sequence until the entire surface level on each side of the fault 501 is estimated.
- each fault throw value is adjusted by i) smoothing the surface levels estimated in step 404 along each side of each fault that belong to the same fault block; and ii) tapering each fault throw value to zero at each distal end of each fault.
- the tapering should not effect a fault intersecting another fault and thus, necessarily occurs between each distal end of a fault and the closest point at which another fault intersects the fault.
- the local well tops within a predefined search neighborhood from a grid node are located using the well tops stored as input data in step 402 , regardless of whether the local well tops cross fault segments and/or fault blocks.
- Each local well top has a local well top value that represents the surface level of that local well top.
- the local well tops within a predefined search neighborhood from grid node 542 may or may not include well tops 518-526 depending on the size of the predefined search neighborhood.
- the predefined search neighborhood may include any geometric shape, however, is preferably predefined by a radius from the grid node forming a circular search neighborhood.
- step 410 all faults that cross a vector between the grid node and each respective local well top located in step 408 are identified using the faults stored in step 402.
- Each vector between the grid node and each respective local well top located in step 408 represents an intersecting vector.
- step 412 the adjusted fault throw values in step 406 are accumulated (added together) along each respective intersecting vector and the result represents an accumulated fault throw value for each respective intersecting vector. Because each intersecting vector corresponds with (intersects) a separate local well top and the accumulated fault throw value represents the adjusted fault throw values along each intersecting vector, each accumulated fault throw value may be different for each respective local well top.
- step 414 the value of each local well top found in step 408 is adjusted based on the accumulated fault throw value that corresponds with each intersecting vector for a respective local well top.
- Each adjusted local well top value therefore, is equal to the value of the respective local well top plus the accumulated fault throw value for the intersecting vector that intersects that respective local well top.
- the adjusted local well top values temporarily remove the local fault throw.
- interpolation is performed at the grid node using the adjusted local well top values from step 414 .
- Interpolation is meant to encompass any well known interpolation technique such as, for example, kriging, collocated cokriging, simulation and collocated cosimulation algorithms.
- other well known interpolation techniques may be used. In this manner, the new adjusted local well tops are interpolated onto the grid.
- step 418 the method 400 determines whether there is another grid node within the grid. If there is not another grid node within the grid, then the method 400 ends. If there is another grid node within the grid, then the method 400 returns to step 408 and repeat steps 408 , 410 , 412 , 414 and 416 for each grid node within the grid.
- the method 400 produced an interpolated surface 500 with fewer artifacts around the end of each fault when compared to other conventional methods.
- FIG. 3 and FIG. 6 which illustrates a surface interpolated according to method 400 using the same data used to produce the interpolated surface in FIG. 3
- the method 400 provides a significant improvement in reducing undesirable artifacts.
- the artifacts 302 located near the termination of the fault 304 in the interpolated surface 300 are not present near the termination of the fault 604 in the interpolated surface 600 of FIG. 6 .
- This approach therefore, represents a substantial improvement for interpolating surfaces having one or more faults.
- the present invention may be implemented through a computer-executable program of instructions, such as program modules, generally referred to as software applications or application programs executed by a computer.
- the software may include, for example, routines, programs, objects, components, and data structures that perform particular tasks or implement particular abstract data types.
- the software forms an interface to allow a computer to react according to a source of input.
- DecisionSpaceTM which is a commercial software application marketed by Landmark Graphics Corporation, may be used as an interface application to implement the present invention.
- the software may also cooperate with other code segments to initiate a variety of tasks in response to data received in conjunction with the source of the received data.
- the software may be stored and/or carried on any variety of memory media such as CD-ROM, magnetic disk, bubble memory and semiconductor memory ( e.g. , various types of RAM or ROM).
- the software and its results may be transmitted over a variety of carrier media such as optical fiber, metallic wire and/or through any of a variety of networks such as the Internet.
- the invention may be practiced with a variety of computer-system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable-consumer electronics, minicomputers, mainframe computers, and the like. Any number of computer-systems and computer networks are acceptable for use with the present invention.
- the invention may be practiced in distributed-computing environments where tasks are performed by remote-processing devices that are linked through a communications network.
- program modules may be located in both local and remote computer-storage media including memory storage devices.
- the present invention may therefore, be implemented in connection with various hardware, software or a combination thereof, in a computer system or other processing system.
- the system includes a computing unit, sometimes referred to a computing system, which contains memory, application programs, a client interface, a video interface and a processing unit.
- the computing unit is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention.
- the memory primarily stores the application programs, which may also be described as program modules containing computer-executable instructions, executed by the computing unit for implementing the present invention described herein and illustrated in FIGS. 4-6 .
- the memory therefore, primarily includes a surface interpolation module, which performs steps 402-418 illustrated in FIG. 4 .
- DecisionSpaceTM may be used to interface with the surface interpolation module to perform steps 402-418, other interface applications may be used instead of DecisionSpaceTM or the surface interpolation module may be used as a stand alone application.
- DecisionSpaceTM provides a common interface for the surface interpolation module and other applications and/or modules illustrated in FIG. 7 . It allows the user to access data, view it in 1D, 2D and 3D viewers and perform various types of data interpretation and computations.
- the surface interpolation module is currently configured to be implemented through the Dynamic GeomodelingTM module in DecisionSpaceTM as illustrated in FIG. 7 .
- the computing unit typically includes a variety of computer readable media.
- computer readable media may comprise computer storage media.
- the computing system memory may include computer storage media in the form of volatile and/or nonvolatile memory such as a read only memory (ROM) and random access memory (RAM).
- ROM read only memory
- RAM random access memory
- a basic input/output system (BIOS) containing the basic routines that help to transfer information between elements within the computing unit, such as during start-up, is typically stored in ROM.
- the RAM typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by the processing unit.
- the computing unit includes an operating system, application programs, other program modules, and program data.
- the components shown in the memory may also be included in other removable/nonremovable, volatile/nonvolatile computer storage media or they may be implemented in the computing unit through application program interface ("API"), which may reside on a separate computing unit connected through a computer system or network.
- API application program interface
- a hard disk drive may read from or write to nonremovable, nonvolatile magnetic media
- a magnetic disk drive may read from or write to a removable, non-volatile magnetic disk
- an optical disk drive may read from or write to a removable, nonvolatile optical disk such as a CD ROM or other optical media.
- removable/non-removable, volatile/non-volatile computer storage media may include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like.
- the drives and their associated computer storage media discussed above provide storage of computer readable instructions, data structures, program modules and other data for the computing unit.
- a client may enter commands and information into the computing unit through the client interface, which may be input devices such as a keyboard and pointing device, commonly referred to as a mouse, trackball or touch pad.
- Input devices may include a microphone, joystick, satellite dish, scanner, or the like.
- a monitor or other type of display device may be connected to the system bus via an interface, such as a video interface.
- a graphical user interface may also be used with the video interface to receive instructions from the client interface and transmit instructions to the processing unit.
- computers may also include other peripheral output devices such as speakers and printer, which may be connected through an output peripheral interface.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- Life Sciences & Earth Sciences (AREA)
- Computer Graphics (AREA)
- General Life Sciences & Earth Sciences (AREA)
- Geophysics (AREA)
- Computational Mathematics (AREA)
- Mathematical Physics (AREA)
- Data Mining & Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Acoustics & Sound (AREA)
- Environmental & Geological Engineering (AREA)
- Geology (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Complex Calculations (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Apparatus For Radiation Diagnosis (AREA)
- Processing Or Creating Images (AREA)
- Testing And Monitoring For Control Systems (AREA)
- Image Processing (AREA)
Description
- The present disclosure generally relates to systems and methods for creating a surface in a faulted space. More particularly, the present disclosure relates to creating a surface by interpolation in a faulted space.
- Interpolation techniques are often used in the oil and gas industry to create a surface, sometimes referred to as a horizon, which may be used to locate hydrocarbons in a subsurface formation. Creating a surface from well tops, which are points on a well representing a surface level on a horizon at that point, in a faulted space is always challenging. It is also possible to use secondary information, such as, but not limited to, seismic data, to aid in the creation of the interpolated surface. Ideally, the interpolation should be done in the unfaulted space and then translated back into the faulted domain. This technique, which is commonly referred to as global unfaulting, effectively restores the faulted space to the unfaulted space on a global basis before faulting occurred. However, global unfaulting is very difficult, especially in the presence of many faults.
- Refinement gridding is an interpolation technique that translates a coarse approximation of known data into a finer approximation by increasing the number of interpolated nodes on a step-by-step basis. Refinement gridding interpolation therefore, provides an approach to creating a surface in the faulted space directly. It generates very smooth surfaces when there is no fault, and the performance is very good, but it often creates significant
undesirable artifacts 102 along the fault and at its edges as illustrated by the interpolatedsurface 100 inFIG. 1 . - Traditional kriging, which is synonymous with optimal prediction, is another interpolation technique, which predicts unknown values from data observed in known locations. Kriging uses variograms to express the spatial variation, and minimizes the error of predicted values, which are estimated by spatial distribution of the predicted values. Traditional Kriging in the presence of a fault can generate cleaner edges along the fault when search neighborhoods are restricted to one side of the
fault 202 or the other side of thefault 204 as illustrated by the interpolatedsurface 200 inFIG. 2 . Traditional kriging, however, does not always eliminateartifacts 302 near fault terminations as illustrated by the interpolatedsurface 300 inFIG. 3 . - There is therefore, a need for creating surfaces in a faulted space that reduces the incidental production of artifacts along faults and near fault terminations.
-
US 2003/023383 A1 discloses a system for information extraction from geologic time volumes. -
US 2003/018436 A1 discloses a system for multi-dimensional data analysis. -
US 6 138 076 A discloses an automatic non-artificially extended fault surface based horizon modelling system. - In a first aspect of the present invention, there is provided a computer-implemented method according to Claim 1.
- In a second aspect of the present invention, there is provided a non-transitory program carrier device according to Claim 10.
- The present invention is described below with references to the accompanying drawings in which like elements are referenced with like reference numerals, and in which:
-
FIG. 1 illustrates a surface and artifacts produced by conventional refinement gridding interpolation using real data. -
FIG. 2 illustrates a surface produced by traditional kriging interpolation and the same data used to produce the interpolated surface inFIG. 1 . -
FIG. 3 illustrates a surface and artifacts produced by traditional kriging interpolation and artificial data. -
FIG. 4 is a flow diagram illustrating one embodiment of a method for implementing the present invention. -
FIG. 5 illustrates a surface created by interpolation according to the present invention using real data. -
FIG. 6 illustrates a surface created by interpolation according to the present invention using the same data used to produce the interpolated surface inFIG. 3 . -
FIG. 7 is a block diagram illustrating one embodiment of a computer system for implementing the present invention. - The present disclosure meets the above needs and overcomes one or more deficiencies in the prior art by providing systems and methods for creating a surface in a faulted space using interpolation techniques.
- In one embodiment, the present disclosure includes a computer-implemented method for creating a surface related to a subsurface formation and having one or more faults, based on data comprising well tops and faults associated with the subsurface formation, the method comprising: a) estimating a surface level on each side of each fault, an elevation difference between the estimated surface levels on each side of a respective fault representing a respective fault throw value; b) adjusting each fault throw value; c) locating each local well top within a predefined search neighborhood from a grid node within a grid on the surface; d) identifying each fault that crosses a vector between the grid node and each respective local well top, each vector between the grid node and each respective local well top representing an intersecting vector; e) accumulating each adjusted fault throw value along each respective intersecting vector, which represents an accumulated fault throw value for each respective intersecting vector; f) adjusting a value for each local well top based on a respective accumulated fault throw value, the value for each local well top being adjusted by adding the value of each local well top to the respective accumulated fault throw value; g) performing interpolation at the grid node using the adjusted value for each local well top; h) repeating steps c) - g) for each grid node within the grid, wherein the value for each local well top is adjusted by adding the value of each local well top to the respective accumulated fault throw value.
- Additional aspects, advantages and embodiments of the disclosure will become apparent to those skilled in the art from the following description of the various embodiments and related drawings.
- The subject matter of the present invention is described with specificity, however, the description itself is not intended to limit the scope of the invention, which is defined by the claims.
- Moreover, although the term "step" may be used herein to describe different elements of methods employed, the term should not be interpreted as implying any particular order among or between various steps herein disclosed unless otherwise expressly limited by the description to a particular order. While the following description refers to the oil and gas industry, the systems and methods of the present invention are not limited thereto and may also be applied to other industries to achieve similar results.
- Referring now to
FIG. 4 , a flow diagram illustrates one embodiment of amethod 400 for implementing the present invention. Themethod 400 creates a surface in a faulted space using interpolation techniques. Themethod 400 in this example uses only well tops across faults to create the interpolated surface. Themethod 400 not only generates sharp edges around the faults, but also interpolates smoothly away from them. - In
step 402, input data are stored using the client interface and/or video interface described in reference toFIG. 7 . The input data comprises well tops and faults comprising numerous fault segments. Each well top is preferably stored in KD tree, which is a well known data structure for fast and efficient retrieval of the input data. Each fault segment is preferably stored in a Quad tree, which is also a well known data structure used for fast and efficient retrieval. - In
step 404, the surface level along both sides of each fault is estimated. The estimate is preferably done by finding each well top, which is stored as input data instep 402, in each fault block and interpolating the surface level along both sides of each fault using one or more, but not necessarily all, of the well tops found in each respective fault block. Interpolation is meant to encompass any well known interpolation technique such as, for example, kriging, collocated cokriging, simulation and collocated cosimulation algorithms. Each fault throw, which is defined as the amount of vertical displacement (i.e. elevation change) between the estimated surface levels, is stored as a value in the Quad tree data structure described in reference tostep 402 with the estimated surface levels. As illustrated inFIG. 5 , which represents an interpolatedsurface 500 using real input data instep 402, one fault block is defined byfault segments edge 508 of the interpolatedsurface 500. Another fault block is defined byfault segments surface 500 includes 9,995 fault segments and 329 well tops, which are illustrated within a 500 by 500grid 540. Afault 501 includesfault segment 502 at one end of thefault 501 and anotherfault segment 514 toward another end of thefault 501. Each fault block may contain one or more well tops as demonstrated by the fault block containing well tops 518-526. The fault block defined by anedge 528 of the interpolatedsurface 500 andfault segments surface level 538 along one side of thefault 501 therefore, was estimated by i) finding each well top in the fault block defined byfault segments edge 508 of the interpolatedsurface 500; and ii) kriging that surface level using one or more of the well tops in the fault block. Thesurface level 536 along another side of thefault 501 therefore, was estimated by i) find each well top in the fault block defined byfault segments edge 528 of the interpolatedsurface 500; and ii) kriging that surface level using one or more of the well tops in the fault block. The surface level on each side of thefault 501 may be estimated in this manner (fault block by fault block) from one end of thefault 501 to another end of thefault 501. Alternatively, this step may begin anywhere between each end of thefault 501 and proceed in any manner or sequence until the entire surface level on each side of thefault 501 is estimated. - In
step 406, each fault throw value is adjusted by i) smoothing the surface levels estimated instep 404 along each side of each fault that belong to the same fault block; and ii) tapering each fault throw value to zero at each distal end of each fault. The tapering should not effect a fault intersecting another fault and thus, necessarily occurs between each distal end of a fault and the closest point at which another fault intersects the fault. - In
step 408, the local well tops within a predefined search neighborhood from a grid node are located using the well tops stored as input data instep 402, regardless of whether the local well tops cross fault segments and/or fault blocks. Each local well top has a local well top value that represents the surface level of that local well top. As illustrated by thegrid 540 inFIG. 5 , the local well tops within a predefined search neighborhood fromgrid node 542 may or may not include well tops 518-526 depending on the size of the predefined search neighborhood. The predefined search neighborhood may include any geometric shape, however, is preferably predefined by a radius from the grid node forming a circular search neighborhood. - In
step 410, all faults that cross a vector between the grid node and each respective local well top located instep 408 are identified using the faults stored instep 402. Each vector between the grid node and each respective local well top located instep 408 represents an intersecting vector. - In
step 412, the adjusted fault throw values instep 406 are accumulated (added together) along each respective intersecting vector and the result represents an accumulated fault throw value for each respective intersecting vector. Because each intersecting vector corresponds with (intersects) a separate local well top and the accumulated fault throw value represents the adjusted fault throw values along each intersecting vector, each accumulated fault throw value may be different for each respective local well top. - In
step 414, the value of each local well top found instep 408 is adjusted based on the accumulated fault throw value that corresponds with each intersecting vector for a respective local well top. Each adjusted local well top value therefore, is equal to the value of the respective local well top plus the accumulated fault throw value for the intersecting vector that intersects that respective local well top. As a result, the adjusted local well top values temporarily remove the local fault throw. - In step 416, interpolation is performed at the grid node using the adjusted local well top values from
step 414. Interpolation is meant to encompass any well known interpolation technique such as, for example, kriging, collocated cokriging, simulation and collocated cosimulation algorithms. Optionally, other well known interpolation techniques may be used. In this manner, the new adjusted local well tops are interpolated onto the grid. - In
step 418, themethod 400 determines whether there is another grid node within the grid. If there is not another grid node within the grid, then themethod 400 ends. If there is another grid node within the grid, then themethod 400 returns to step 408 and repeatsteps - Although the fault network lying within the interpolated
surface 500 inFIG. 5 is complicated, themethod 400 produced an interpolatedsurface 500 with fewer artifacts around the end of each fault when compared to other conventional methods. As illustrated by the comparison ofFIG. 3 andFIG. 6 , which illustrates a surface interpolated according tomethod 400 using the same data used to produce the interpolated surface inFIG. 3 , themethod 400 provides a significant improvement in reducing undesirable artifacts. For example, theartifacts 302 located near the termination of thefault 304 in the interpolatedsurface 300 are not present near the termination of thefault 604 in the interpolatedsurface 600 ofFIG. 6 . This approach therefore, represents a substantial improvement for interpolating surfaces having one or more faults. - The present invention may be implemented through a computer-executable program of instructions, such as program modules, generally referred to as software applications or application programs executed by a computer. The software may include, for example, routines, programs, objects, components, and data structures that perform particular tasks or implement particular abstract data types. The software forms an interface to allow a computer to react according to a source of input. DecisionSpaceTM, which is a commercial software application marketed by Landmark Graphics Corporation, may be used as an interface application to implement the present invention. The software may also cooperate with other code segments to initiate a variety of tasks in response to data received in conjunction with the source of the received data. The software may be stored and/or carried on any variety of memory media such as CD-ROM, magnetic disk, bubble memory and semiconductor memory (e.g., various types of RAM or ROM). Furthermore, the software and its results may be transmitted over a variety of carrier media such as optical fiber, metallic wire and/or through any of a variety of networks such as the Internet.
- Moreover, those skilled in the art will appreciate that the invention may be practiced with a variety of computer-system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable-consumer electronics, minicomputers, mainframe computers, and the like. Any number of computer-systems and computer networks are acceptable for use with the present invention. The invention may be practiced in distributed-computing environments where tasks are performed by remote-processing devices that are linked through a communications network. In a distributed-computing environment, program modules may be located in both local and remote computer-storage media including memory storage devices. The present invention may therefore, be implemented in connection with various hardware, software or a combination thereof, in a computer system or other processing system.
- Referring now to
FIG. 7 , a block diagram of a system for implementing the present invention on a computer is illustrated. The system includes a computing unit, sometimes referred to a computing system, which contains memory, application programs, a client interface, a video interface and a processing unit. The computing unit is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. - The memory primarily stores the application programs, which may also be described as program modules containing computer-executable instructions, executed by the computing unit for implementing the present invention described herein and illustrated in
FIGS. 4-6 . The memory therefore, primarily includes a surface interpolation module, which performs steps 402-418 illustrated inFIG. 4 . Although DecisionSpaceâ„¢ may be used to interface with the surface interpolation module to perform steps 402-418, other interface applications may be used instead of DecisionSpaceâ„¢ or the surface interpolation module may be used as a stand alone application. DecisionSpaceâ„¢ provides a common interface for the surface interpolation module and other applications and/or modules illustrated inFIG. 7 . It allows the user to access data, view it in 1D, 2D and 3D viewers and perform various types of data interpretation and computations. The surface interpolation module is currently configured to be implemented through the Dynamic Geomodelingâ„¢ module in DecisionSpaceâ„¢ as illustrated inFIG. 7 . - Although the computing unit is shown as having a generalized memory, the computing unit typically includes a variety of computer readable media. By way of example, and not limitation, computer readable media may comprise computer storage media. The computing system memory may include computer storage media in the form of volatile and/or nonvolatile memory such as a read only memory (ROM) and random access memory (RAM). A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within the computing unit, such as during start-up, is typically stored in ROM. The RAM typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by the processing unit. By way of example, and not limitation, the computing unit includes an operating system, application programs, other program modules, and program data.
- The components shown in the memory may also be included in other removable/nonremovable, volatile/nonvolatile computer storage media or they may be implemented in the computing unit through application program interface ("API"), which may reside on a separate computing unit connected through a computer system or network. For example only, a hard disk drive may read from or write to nonremovable, nonvolatile magnetic media, a magnetic disk drive may read from or write to a removable, non-volatile magnetic disk, and an optical disk drive may read from or write to a removable, nonvolatile optical disk such as a CD ROM or other optical media. Other removable/non-removable, volatile/non-volatile computer storage media that can be used in the exemplary operating environment may include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The drives and their associated computer storage media discussed above provide storage of computer readable instructions, data structures, program modules and other data for the computing unit.
- A client may enter commands and information into the computing unit through the client interface, which may be input devices such as a keyboard and pointing device, commonly referred to as a mouse, trackball or touch pad. Input devices may include a microphone, joystick, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit through a system bus, but may be connected by other interface and bus structures, such as a parallel port or a universal serial bus (USB).
- A monitor or other type of display device may be connected to the system bus via an interface, such as a video interface. A graphical user interface ("GUI") may also be used with the video interface to receive instructions from the client interface and transmit instructions to the processing unit. In addition to the monitor, computers may also include other peripheral output devices such as speakers and printer, which may be connected through an output peripheral interface.
- Although many other internal components of the computing unit are not shown, those of ordinary skill in the art will appreciate that such components and their interconnection are well known.
Claims (10)
- A computer-implemented method for creating a surface related to a subsurface formation and having one or more faults, based on data comprising well tops and faults associated with the subsurface formation, the method comprising:a) estimating a surface level (538) on each side of each fault (501), an elevation difference between the estimated surface levels on each side of a respective fault representing a respective fault throw value;b) adjusting each fault throw value;characterised in that the method further comprises:c) locating each local well top (518) within a predefined search neighborhood from a grid node (542) within a grid on the surface;d) identifying each fault that crosses a vector between the grid node and each respective local well top, each vector between the grid node and each respective local well top representing an intersecting vector;e) accumulating each adjusted fault throw value along each respective intersecting vector, which represents an accumulated fault throw value for each respective intersecting vector;f) adjusting a value for each local well top based on a respective accumulated fault throw value, the value for each local well top being adjusted by adding the value of each local well top to the respective accumulated fault throw value;g) performing interpolation at the grid node using the adjusted value for each local well top; andh) repeating steps c) - g) for each grid node within the grid,wherein the value for each local well top is adjusted by adding the value of each local well top to the respective accumulated fault throw value.
- The method of claim 1, further comprising storing input data comprising well tops and faults, each fault comprising one or more fault segments, each well top being stored in a KD tree data structure and each fault segment being stored in a Quad tree data structure.
- The method of claim 1, wherein the surface level on each side of each fault is estimated by finding each well top in each fault block and interpolating the surface level along each side of each fault using one or more of the well tops found in each respective fault block.
- The method of claim 3, wherein the interpolation is performed by kriging, collocated cokriging, simulation or collocated cosimulation.
- The method of claim 1, wherein each fault throw value is adjusted by smoothing the estimated surface levels along each side of each fault that belong to the same fault block and tapering each fault throw value to zero at each distal end of each fault.
- The method of claim 1, wherein the predefined search neighborhood forms a circular search neighborhood with a radius from the grid node.
- The method of claim 1, wherein each adjusted fault throw value is accumulated by adding each fault throw value along each respective intersecting vector.
- The method of claim 1, wherein the respective accumulated fault throw value is the accumulated fault throw value for the intersecting vector that intersects the respective well top.
- The method of claim 1, wherein performing interpolation at the grid node comprises kriging, collocated cokriging, simulation or collocated cosimulation at the grid node using the adjusted value for each local well top.
- A non-transitory program carrier device tangibly carrying computer executable instructions for creating a surface having one or more faults, the instructions being executable to implement a method as claimed in any preceding claim.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/US2010/044850 WO2012021119A1 (en) | 2010-08-09 | 2010-08-09 | Systems and methods for creating a surface in a faulted space |
Publications (3)
Publication Number | Publication Date |
---|---|
EP2603877A1 EP2603877A1 (en) | 2013-06-19 |
EP2603877A4 EP2603877A4 (en) | 2017-10-11 |
EP2603877B1 true EP2603877B1 (en) | 2020-07-01 |
Family
ID=45567876
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP10855973.3A Active EP2603877B1 (en) | 2010-08-09 | 2010-08-09 | Systems and methods for creating a surface in a faulted space |
Country Status (9)
Country | Link |
---|---|
US (2) | US9436658B2 (en) |
EP (1) | EP2603877B1 (en) |
CN (1) | CN103140860B (en) |
AU (1) | AU2010359075B2 (en) |
BR (1) | BR112013003023A2 (en) |
CA (1) | CA2805036C (en) |
EA (1) | EA201390084A1 (en) |
MX (1) | MX2013000646A (en) |
WO (1) | WO2012021119A1 (en) |
Families Citing this family (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9134454B2 (en) | 2010-04-30 | 2015-09-15 | Exxonmobil Upstream Research Company | Method and system for finite volume simulation of flow |
US9058445B2 (en) | 2010-07-29 | 2015-06-16 | Exxonmobil Upstream Research Company | Method and system for reservoir modeling |
CA2803066A1 (en) | 2010-07-29 | 2012-02-02 | Exxonmobil Upstream Research Company | Methods and systems for machine-learning based simulation of flow |
CA2805446C (en) | 2010-07-29 | 2016-08-16 | Exxonmobil Upstream Research Company | Methods and systems for machine-learning based simulation of flow |
US9436658B2 (en) * | 2010-08-09 | 2016-09-06 | Landmark Graphics Corporation | Systems and methods for creating a surface in a faulted space |
WO2012039811A1 (en) | 2010-09-20 | 2012-03-29 | Exxonmobil Upstream Research Company | Flexible and adaptive formulations for complex reservoir simulations |
CA2843929C (en) | 2011-09-15 | 2018-03-27 | Exxonmobil Upstream Research Company | Optimized matrix and vector operations in instruction limited algorithms that perform eos calculations |
US10036829B2 (en) | 2012-09-28 | 2018-07-31 | Exxonmobil Upstream Research Company | Fault removal in geological models |
WO2016018723A1 (en) | 2014-07-30 | 2016-02-04 | Exxonmobil Upstream Research Company | Method for volumetric grid generation in a domain with heterogeneous material properties |
US10359523B2 (en) | 2014-08-05 | 2019-07-23 | Exxonmobil Upstream Research Company | Exploration and extraction method and system for hydrocarbons |
US10317569B2 (en) * | 2014-09-11 | 2019-06-11 | Chevron U.S.A. Inc. | Method of stratigraphic modeling of faults |
CA2963416A1 (en) | 2014-10-31 | 2016-05-06 | Exxonmobil Upstream Research Company | Handling domain discontinuity in a subsurface grid model with the help of grid optimization techniques |
EP3213127A1 (en) | 2014-10-31 | 2017-09-06 | Exxonmobil Upstream Research Company | Managing discontinuities in geologic models |
AU2015339883B2 (en) | 2014-10-31 | 2018-03-29 | Exxonmobil Upstream Research Company | Methods to handle discontinuity in constructing design space for faulted subsurface model using moving least squares |
AU2016409869A1 (en) * | 2016-06-07 | 2018-10-11 | Landmark Graphics Corporation | Systems and methods for unfaulting point clouds |
US10839114B2 (en) | 2016-12-23 | 2020-11-17 | Exxonmobil Upstream Research Company | Method and system for stable and efficient reservoir simulation using stability proxies |
WO2019209609A1 (en) * | 2018-04-22 | 2019-10-31 | Schlumberger Technology Corporation | Fault radiation based grid compartmentalization |
CN110910499B (en) * | 2019-11-22 | 2021-12-28 | ä¸å±±å¤§å¦ | Method and device for constructing geological environment carrier fault model based on Revit software |
US11681838B2 (en) | 2020-05-26 | 2023-06-20 | Landmark Graphics Corporation | Distributed Sequential Gaussian Simulation |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6014343A (en) | 1996-10-31 | 2000-01-11 | Geoquest | Automatic non-artificially extended fault surface based horizon modeling system |
GB0017227D0 (en) * | 2000-07-14 | 2000-08-30 | Schlumberger Ind Ltd | Fully coupled geomechanics in a commerical reservoir simulator |
US6853922B2 (en) | 2001-07-20 | 2005-02-08 | Tracy Joseph Stark | System for information extraction from geologic time volumes |
US6850845B2 (en) * | 2001-07-20 | 2005-02-01 | Tracy Joseph Stark | System for multi-dimensional data analysis |
US6791900B2 (en) * | 2002-06-13 | 2004-09-14 | Exxonmobil Upstream Research Company | Method of calculating a throw volume for quantitative fault analysis |
US7248539B2 (en) * | 2003-04-10 | 2007-07-24 | Schlumberger Technology Corporation | Extrema classification |
EP2395375A3 (en) * | 2006-06-21 | 2012-04-11 | Terraspark Geosciences, LLC | Extraction of depositional systems |
US8055449B2 (en) * | 2007-10-08 | 2011-11-08 | Westerngeco L.L.C. | Determining fault transmissivity in a subterranean reservoir |
US8190414B2 (en) * | 2008-03-26 | 2012-05-29 | Exxonmobil Upstream Research Company | Modeling of hydrocarbon reservoirs containing subsurface features |
FR2930350B1 (en) * | 2008-04-17 | 2011-07-15 | Inst Francais Du Petrole | PROCESS FOR SEARCHING FOR HYDROCARBONS IN A GEOLOGICALLY COMPLEX BASIN USING BASIN MODELING |
CN101303414B (en) * | 2008-05-22 | 2011-03-30 | åŒ—äº¬èˆªç©ºèˆªå¤©å¤§å¦ | Method for generating ground layer surface and geologic body based on level set |
US9436658B2 (en) * | 2010-08-09 | 2016-09-06 | Landmark Graphics Corporation | Systems and methods for creating a surface in a faulted space |
-
2010
- 2010-08-09 US US13/816,450 patent/US9436658B2/en active Active
- 2010-08-09 AU AU2010359075A patent/AU2010359075B2/en not_active Ceased
- 2010-08-09 BR BR112013003023-2A patent/BR112013003023A2/en not_active IP Right Cessation
- 2010-08-09 WO PCT/US2010/044850 patent/WO2012021119A1/en active Application Filing
- 2010-08-09 CN CN201080068369.6A patent/CN103140860B/en not_active Expired - Fee Related
- 2010-08-09 EP EP10855973.3A patent/EP2603877B1/en active Active
- 2010-08-09 CA CA2805036A patent/CA2805036C/en not_active Expired - Fee Related
- 2010-08-09 EA EA201390084A patent/EA201390084A1/en unknown
- 2010-08-09 MX MX2013000646A patent/MX2013000646A/en active IP Right Grant
-
2016
- 2016-08-10 US US15/233,639 patent/US9817792B2/en active Active
Non-Patent Citations (1)
Title |
---|
None * |
Also Published As
Publication number | Publication date |
---|---|
EP2603877A1 (en) | 2013-06-19 |
US9436658B2 (en) | 2016-09-06 |
US9817792B2 (en) | 2017-11-14 |
EP2603877A4 (en) | 2017-10-11 |
BR112013003023A2 (en) | 2018-01-30 |
WO2012021119A1 (en) | 2012-02-16 |
CN103140860B (en) | 2016-02-17 |
CA2805036C (en) | 2020-07-14 |
MX2013000646A (en) | 2013-10-17 |
CA2805036A1 (en) | 2012-02-16 |
EA201390084A1 (en) | 2013-06-28 |
AU2010359075A1 (en) | 2013-01-31 |
AU2010359075B2 (en) | 2014-01-09 |
US20130138412A1 (en) | 2013-05-30 |
US20160350263A1 (en) | 2016-12-01 |
CN103140860A (en) | 2013-06-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9817792B2 (en) | Systems and methods for creating a surface in a faulted space | |
US9646414B2 (en) | Systems and methods for modeling 3D geological structures | |
AU2013389292B2 (en) | Basin-to-reservoir modeling | |
AU2013395722B2 (en) | Reservoir history matching | |
EP2756447A1 (en) | Systems and methods for assisted property modeling | |
AU2015384813A1 (en) | Selecting potential well locations in a reservoir grid model | |
US9874094B2 (en) | Identifying formation layer boundaries on well log measurements | |
AU2014386269B2 (en) | Modeling geologic surfaces using unilateral non-node constraints from neighboring surfaces in the stratigraphic sequence | |
CA2796915C (en) | Systems and methods for computing a default 3d variogram model | |
AU2016401214A1 (en) | Visualizing attributes of multiple fault surfaces in real time | |
CN112731527A (en) | Multi-attribute research-based method and device for enhancing characteristics of broken solution |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20130122 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR |
|
DAX | Request for extension of the european patent (deleted) | ||
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602010064816 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: G06G0007480000 Ipc: G01V0001300000 |
|
RA4 | Supplementary search report drawn up and despatched (corrected) |
Effective date: 20170911 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06G 7/48 20060101ALI20170905BHEP Ipc: G06T 17/20 20060101ALI20170905BHEP Ipc: G01V 99/00 20090101ALI20170905BHEP Ipc: G06T 17/05 20110101ALI20170905BHEP Ipc: G01V 1/30 20060101AFI20170905BHEP |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20190711 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: CHAMBERS, RICHARD, L. Inventor name: SHI, GENBAO Inventor name: GUETTER, RANDY Inventor name: YARUS, JEFFREY Inventor name: XU, ZITAO |
|
INTG | Intention to grant announced |
Effective date: 20200203 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: LANDMARK GRAPHICS CORPORATION |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP Ref country code: AT Ref legal event code: REF Ref document number: 1286685 Country of ref document: AT Kind code of ref document: T Effective date: 20200715 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602010064816 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201001 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20200701 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1286685 Country of ref document: AT Kind code of ref document: T Effective date: 20200701 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201102 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201002 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201001 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201101 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602010064816 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200831 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200831 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200809 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20200831 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 |
|
26N | No opposition filed |
Effective date: 20210406 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20201001 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20210302 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200901 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200809 Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20201001 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200831 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: MT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200701 |