选择“最强”相交区域

def calculate_overlap_area(rect1, rect2):
    x_overlap = max(0, min(rect1[2], rect2[2]) - max(rect1[0], rect2[0]))
    y_overlap = max(0, min(rect1[3], rect2[3]) - max(rect1[1], rect2[1]))
    return x_overlap * y_overlap

def find_max_overlap_area(rectangles):
    max_overlap = 0
    for i in range(len(rectangles)):
        for j in range(i + 1, len(rectangles)):
            overlap_area = calculate_overlap_area(rectangles[i], rectangles[j])
            if overlap_area > max_overlap:
                max_overlap = overlap_area
    return max_overlap

# 示例矩形列表
rectangles = [
    (0, 0, 4, 4),
    (2, 2, 6, 6),
    (5, 5, 8, 8)
]

max_overlap_area = find_max_overlap_area(rectangles)
print("最大重叠区域面积:", max_overlap_area)