Resume boolean multidimensional arrays

type Point
{ 
 int x,y
}

type Rectangle
{
  Point upperLeft, lowerRight;
}

Let S = the set of rectangles found in source array
Let Result = Empty list of rectangles

For every rectangle A in S
 For every rectangle B in S that is Not A
    Let Tr = new Rectangle(
      new Point(Min(A.upperleft.x, B.upperleft.X), Min(A.upperleft.Y, B.upperleft.Y)),
      new Point(Min(A.Lowerright.x, B.Lowerright.X), Min(A.Lowerright.Y, B.Lowerright.Y));
    
  If (A.Area + B.Area) / Tr.Area > SomeThreshold Then // The threshold can be something like 0.75 the bigger the picker
    S.Remove(A)
    S.Remove(B)
    Result.Add(Tr)
    For every rectangle I in S (that is not A or B)
      If I is completely inside Tr Then S.Remove(I)
    End
  End
 End
End