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 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