def METHOD_NAME():
    shape = (60, 60)
    # Create a diamond-like shape where the four corners form the 1st set
    # of points
    x_diamond = 30
    y_diamond = 30
    r = 10
    plt_x = [0, 1, 0, -1]
    plt_y = [1, 0, -1, 0]
    set_ax = [(x_diamond + r * x) for x in plt_x]
    set_ay = [(y_diamond + r * y) for y in plt_y]
    # Create a kite-like shape where the four corners form the 2nd set of
    # points
    x_kite = 30
    y_kite = 30
    x_r = 15
    y_r = 20
    set_bx = [(x_kite + x_r * x) for x in plt_x]
    set_by = [(y_kite + y_r * y) for y in plt_y]
    # Set up the data to compute the Hausdorff distance
    coords_a = np.zeros(shape, dtype=bool)
    coords_b = np.zeros(shape, dtype=bool)
    for x, y in zip(set_ax, set_ay):
        coords_a[(x, y)] = True
    for x, y in zip(set_bx, set_by):
        coords_b[(x, y)] = True
    # Test the Hausdorff function on the coordinates
    # Should return 10, the distance between the furthest tip of the kite and
    # its closest point on the diamond, which is the furthest someone can make
    # you travel to encounter your nearest neighboring point on the other set.
    assert_almost_equal(hausdorff_distance(coords_a, coords_b), 10.0)
    # There are two pairs of points ((30, 20), (30, 10) or (30, 40), (30, 50)),
    # that are Hausdorff distance apart. This tests for either of them.
    hd_points = hausdorff_pair(coords_a, coords_b)
    assert (
        np.equal(hd_points, ((30, 20), (30, 10))).all()
        or np.equal(hd_points, ((30, 40), (30, 50))).all()
    )
    # Test the Modified Hausdorff function on the coordinates
    # Should return 7.5.
    assert_almost_equal(hausdorff_distance(coords_a, coords_b, method="modified"), 7.5)