I am not sure of a solution for this, but ain't this an NP-complete problem?
On 6/19/07, ihinayana <[EMAIL PROTECTED]> wrote: > > > Description: > Given a group of rectangles with different integer width and > height,such as 5*4, 2*3,1*7,etc. The total number of rectangles is > like 10 or more.The problem is how to find a bigger rectangle with a > minimal area which can hold all those given ones. To fix them in,those > rectangles can be rotated with 90 degree and the order is regardless. > > Did anybody solve a similar problem? > > > > > -- "Chaos is the rule in nature, not an exception" http://ramaswamy.r.googlepages.com --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
