def bound_bboxes(bboxes):
group_x0 = min(map(lambda l: l[x0], bboxes))<EOL>group_y0 = min(map(lambda l: l[y0], bboxes))<EOL>group_x1 = max(map(lambda l: l[x1], bboxes))<EOL>group_y1 = max(map(lambda l: l[y1], bboxes))<EOL>return (group_x0, group_y0, group_x1, group_y1)<EOL>
Finds the minimal bbox that contains all given bboxes