Algorithm to problem!!!

[kcakir]

Hi to all!
I search an algorithm to that problem:
You have N rectangles N is may be between 0 and 1000. You must arrange them with the least area. You are given the dimensions of all rectangles (may be square you know from math all squares are rectangle ).
and they want the minimum area includes all rectangles and coordinates of left corner of each rectangle assuming (0,0) the upper left corner.
Thans for your help

[dglienna]

Homework? Don't you know? The answer is ALWAYS: B

[kcakir]

It is not homework. if you have any idea about the topic write your idea dont search why i ask

[Zachm]

and they want the minimum area includes all rectangles

By "minimum area" do you mean "minimum rectangular area" ?
If the required area is not bound to some geometric 2D shape, then the "minimum area" is exactly the area sum of all the rectangles.

Regards,
Zachm

[kcakir]

I forgot to say it will be a 2d shape it will be a rectangle!

[Zachm]

Even simpler versions of the problem you described are known as NP-Complete. You can try using an approximation algorithm. See this (http://www.csc.liv.ac.uk/~epa/) link for example.

Regards,
Zachm

[kcakir]

Thanks for your help but it looks i must search a lot