Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A consecutive set of data points, P1, P2, P3, and P4, is selected. A first line is created through P1 and P3. A first tangent vector originating at P2, parallel to the first line, is created. A second line through P2 and P4 is created. A second tangent vector through P3 is created. The second tangent vector is parallel to the second line. A baseline through P2 and P3 is created. A Bezier curve between P2 and P3 is 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.

Abstract: 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.

Abstract: 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.

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

Abstract: A consecutive set of data points, P1, P2, P3, and P4, is selected. A first line is created through P1 and P3. A first tangent vector originating at P2, parallel to the first line, is created. A second line through P2 and P4 is created. A second tangent vector through P3 is created. The second tangent vector is parallel to the second line. A baseline through P2 and P3 is created. A Bezier curve between P2 and P3 is 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.

Abstract: 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.

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

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

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.