Self intersection problem

Hello,

I have a number rectangles. I want to intersect them an get intersection lines from them. 

Them problem I have is that I do know how to solve self intersection problem.

For now there are two equal lists of curves that I intersect.

0 curve_0           0 curve_0 

1 curve_1           1 curve_1

2 curve_2           2 curve_2

...                      ...

n curve_n           n curve_n

But what I want to do is to intersect one each curves with a list that does not have that curve:

0 curve_0          

                         1 curve_1

                         2 curve_2

                         ...

                         n curve_n

////////////////////////////////////////

                         0 curve_0      

1 curve_1          

                         2 curve_2

                         ...

                         n curve_n

////////////////////////////////////////

                         0 curve_0      

                         1 curve_1 

                         2 curve_2  

                         ...

n curve_n

I do not know if that is possible at all without looping... 

Thank you in advance.