I am looking for the help with finding the most efficient algorithm to solve this problem. I have a set of overlapping rectangles (possibly unlimited number of them). Every rectangle is defined by four points in X,Y axis.
I would like to get all extreme points of their convex hull.
The problem is that the result should be non-convex polygon as it shows example below.
This example shows three overlapping rectangles:
