On Jun 21, 1:37 am, "daizi sheng" <[EMAIL PROTECTED]> wrote:
> I have some rectangles A,B,C,D,...
> I wan to place them in a biggerrectangleZ, how to minimize area of Z?
>
> where I say place I mean make Z cover A,cover B & cover all others,
> but A,B,.. should not overlap.
>
> also the position of A,B,C...is not important & u can even rotate the
> rectangles to get smaller Z
>
> I guess there may be a theorem saying that rotating on a rangle a
> (which is not 0,90,180,270, ...) is not neccessary to get the minimum
> Z, but have not found it on Google, also have not proved or disproved
> it
This has been asked at least 2 times before. It is a famous NP-hard
problem (usually denoted as minimum rectangle packing problem).
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
