We're given a big rectangle, and a list of small rectangles contained inside it, with their vertex coordinates.
We want a list of the minimum number of lines defined by a pair of points (x,y) that cut up the big rectangle into the small ones.
For example for this case:
The minimum number of cuts would be 7, and they are represented in the following picture.
Any idea to achieve this? (The rectangles are not always touching the borders.)