2d Problem

Hi everybody. I am trying to complete a task to be solved completely in 2 dimension.

I am trying to write an algorithm that, gets as an input a plan of a building

This algorithm should for each couple of wall ( wall 1 and wall 2)

1) check if the distance between 1 and 2 is greater than a d value

2) a- if value is lower -> do nothing

    b - if value is higher -> offset wall 1 with a d distance 

    c - delete wall 2.

3) trim all the walls that overlaps

4) calculate areas of the new offseted walls.

Actually I solved (1)

Is anybody willing to help?

Thanks a lot!

Domenico