Hi, I think that I've made a mistake in the explanation. Here is the correct one:
I have 2 polygons (any shape). I have to put them on a 2D surface so the the area of the sorrounding rectangle is minimal. The polygons can touch each other, but NO overlapping is allowed. Also the polygons can be rotated by any real angle (in order to obtain a better solution). What I need is an approximation algorithm (which provides a good solution in a reasonable amount of time). Thanks, Laura --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
