根据两个矩形顶点坐标判断两个矩形是否相交

def is_intersect(coord1, coord2):
    crd_min_x = min(np.array(coord1).flatten()[0::2])
    crd_max_x = max(np.array(coord1).flatten()[0::2])
    crd_min_y = min(np.array(coord1).flatten()[1::2])
    crd_max_y = max(np.array(coord1).flatten()[1::2])
    #print(crd_min_x,crd_max_x,crd_min_y,crd_max_y)
    red_min_x = min(np.array(coord2).flatten()[0::2])
    red_max_x = max(np.array(coord2).flatten()[0::2])
    red_min_y = min(np.array(coord2).flatten()[1::2])
    red_max_y = max(np.array(coord2).flatten()[1::2])
    #print(red_min_x, red_max_x, red_min_y, red_max_y)

    if red_min_x >= crd_max_x or red_max_x <= crd_min_x or red_min_y \
            >= crd_max_y or red_max_y <= crd_min_y:
        return False
    else:
        return True