Landmark Graphics Corporation

Landmark Graphics Corporation, a Halliburton Company

Zitao Xu

Jeffrey Marc Yarus

Genbao Shi

Richard L Chambers

ChiKang David Chien

Scott David Senften

Charles M Sembroski

Venkatraman Viswanathan

Mary J Cole

Ya Sun

Chikang David Chien

Sean Andrew Spicer

Maurice Christopher Gehin

Andres Cesar Callegari

Randy Guetter

Maurice Gehin

Jeffrey Yarus

Mayrice Gehin

Systems and methods for mapping vertices from one coordinate system in an earth model to another coordinate system in a two-dimensional (2D) array without disrupting the topology of the vertices.

Mapping vertices from an earth model to a 2D array

A method includes generating a faulted point cloud representing a faulted geological formation including a first fault block having a first surface, a second fault block having a second surface, and a fault formed therebetween and having a fault surface, generating a first fault trace from an intersection of the first surface and the fault surface and a second fault trace from an intersection of the second surface and the fault surface, generating a first fault polygon using the first and second fault traces, generating a center polyline, generating third and fourth fault traces separated from the first and second fault traces, respectively, generating a second fault polygon using the third and fourth fault traces, expanding a first area including the first and third fault traces, expanding a second area including the second and fourth fault traces, and generating an unfaulted point cloud representing an unfaulted geological formation.

Systems and methods for unfaulting point clouds

In various examples, a method includes storing one or more data structures on a storage device, the one or more data structures identifying a plurality of faults in a geographical formation and a plurality of fault blocks on either side of the plurality of faults in the geographic formation; for each pair of faults blocks on opposite sides of a fault identified in the one or more data structures: determining, using at least one processor, a fault polygon of a respective pair of fault blocks with respect to a fault of the plurality of faults; and calculating a matching factor between the respective pair of fault blocks based on the fault polygon; selecting a pair of fault blocks to merge based on the calculated matching factor; and updating the one or more data structures to indicate the selected pair of fault blocks has been merged.

Global grid building unfaulting sequence for complex fault-network topologies

A consecutive set of data points, P, P, P, and P, is selected. A first line is created through Pand P. A first tangent vector originating at P, parallel to the first line, is created. A second line through Pand Pis created. A second tangent vector through Pis created. The second tangent vector is parallel to the second line. A baseline through Pand Pis created. A Bezier curve between Pand Pis created, wherein the Bezier curve has a degree. The degree of the Bezier curve is determined based on a comparison of the first tangent vector, the second tangent vector, and the baseline.

Tri-cubic and hybrid interpolation in a 3D texture shader

Systems and methods for reducing the amount of texture cache memory needed to store a texture atlas by using uniquely grouped refined triangles to create each texture atlas.

Systems and methods for creating a three-dimensional texture atlas

Systems and methods for creating a surface in a faulted space, which includes using interpolation techniques.

Systems and methods for creating a surface in a faulted space

A method to generate a global grid may include storing at least one data structure representing a plurality of fault blocks associated with one or more faults in a geographic formation; selecting two fault blocks associated with a fault of the one or more faults; changing the position of a first of the two fault blocks in the at least one data structure representative of a shift of the first fault block towards the other fault block of the two fault blocks to position the center of gravity of a fault boundary of the first fault block with the center of gravity of a fault boundary of the other fault block; aligning the first fault block with the other fault block according to a permitted level of conflict between fault blocks; and updating the at least one data structure to indicate a merging of the two selected fault blocks.

Global grid building in reverse faulted areas by an optimized unfaulting method

Calculating a fault throw. At least some embodiments are methods of determining an underground surface or horizon including: identifying an occluded zone residing between a first and second faults, the occluded zone not penetrated by an actual borehole, and the first and second faults intersect an expected location of the surface; calculating a fault throw for the first fault; and calculating the underground surface using the fault throw. Calculating the fault throw may include: calculating a first pseudo depth at a first end of the first fault, the calculating the first pseudo depth using at least one actual depth value that resides across the first fault from the first end; calculating a second pseudo depth at a second end of the first fault, the second end distinct from the first end; and determining the fault throw using the first and second pseudo depths.

Method and system of calculating a fault throw

A system and methods are disclosed for automatically approximating an editable surface from a 3D data set or a 3D point set, which may be imaged in the form of a NURBS surface.

Growing community of inventors

Katy, TX, United States of America

Zitao Xu