Global grid building unfaulting sequence for complex fault-network topologies

    公开(公告)号:US10345482B2

    公开(公告)日:2019-07-09

    申请号:US14913883

    申请日:2013-11-26

    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.

    GLOBAL GRID BUILDING IN REVERSE FAULTED AREAS BY AN OPTIMIZED UNFAULTING METHOD
    2.
    发明申请
    GLOBAL GRID BUILDING IN REVERSE FAULTED AREAS BY AN OPTIMIZED UNFAULTING METHOD 有权
    通过优化的不均匀方法在反向故障区域中的全球网格建筑

    公开(公告)号:US20160116636A1

    公开(公告)日:2016-04-28

    申请号:US14892470

    申请日:2013-09-03

    CPC classification number: G01V99/005 G06F17/30336 G06F17/5009 G06T17/05

    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 translation: 生成全局网格的方法可以包括存储表示与地理地层中的一个或多个故障相关联的多个故障块的至少一个数据结构; 选择与一个或多个故障故障相关联的两个故障块; 将所述至少一个数据结构中的所述两个故障块中的第一个故障块的位置改变为代表所述第一故障块向所述两个故障块的另一个故障块的移位,以将所述第一故障块的故障边界的重心定位在所述第一故障块 故障块与其他故障块的故障边界的重心; 根据允许的故障块之间的冲突等级,将第一个故障块与另一个故障块对齐; 以及更新所述至少一个数据结构以指示所述两个所选故障块的合并。

    GLOBAL GRID BUILDING UNFAULTING SEQUENCE FOR COMPLEX FAULT-NETWORK TOPOLOGIES
    4.
    发明申请
    GLOBAL GRID BUILDING UNFAULTING SEQUENCE FOR COMPLEX FAULT-NETWORK TOPOLOGIES 审中-公开
    全球网格构建复杂故障网络拓扑的不均匀序列

    公开(公告)号:US20160216403A1

    公开(公告)日:2016-07-28

    申请号:US14913883

    申请日:2013-11-26

    CPC classification number: G01V99/005

    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 translation: 在各种示例中,一种方法包括将一个或多个数据结构存储在存储设备上,所述一个或多个数据结构标识地理区域中的多个故障以及地理上的多个故障的任一侧上的多个故障块 形成; 对于在所述一个或多个数据结构中识别的故障的相对侧上的每对故障块,确定相对于所述多个故障的故障的相应故障块对的至少一个处理器的故障多边形; 以及基于所述故障多边形计算所述各对故障块之间的匹配因子; 根据计算的匹配因子选择一对故障块进行合并; 并且更新所述一个或多个数据结构以指示所选择的一对故障块已被合并。

Patent Agency Ranking