计算点集合是否相交

计算两个点集合是否有相交部分：

// 额，之前是用轮廓变化得到的点集合，是以 X*1*2 维表示的ndarray
// _, contours, hierarchy = cv2.findContours(my_mask.copy(), cv2.RETR_EXTERNAL, cv2.CHAIN_APPROX_NONE)
// for cont in contours:
//     xxxxxxxxxx
def f(arrA, arrB):
    return not set(map(tuple, arrA)).isdisjoint(map(tuple, arrB))

def intersect2d(X, Y):
    """
    Function to find intersection of two 2D arrays.
    Returns index of rows in X that are common to Y.
    """
    X = np.tile(X[:, :, None], (1, 1, Y.shape[0]))
    Y = np.swapaxes(Y[:, :, None], 0, 2)
    Y = np.tile(Y, (X.shape[0], 1, 1))
    eq = np.all(np.equal(X, Y), axis=1)
    eq = np.any(eq, axis=1)
    return np.nonzero(eq)[0]