Hello community,

I have a question about how to compute the union and intersection of a list of rectangles (that may overlap between them).

Each rectangle is represented by (xmin, xmax, height). For example (1,3,2) is a rectangle that goes from x = 1 to x = 3 and has height 2. the Y min is always 0.

So how could you do an efficient algorithm to having this input (a list of rectangles), return a list of rectangles that are not overlapped between them?

Thanks in advance.