laura wrote: > Dear all, > > I have a problem and I don't know how to solve it: > > I have 2 concave polygons and I need a way to match them so that the > surrounding rectangle is minimal (has a minimal surface). > > Are there any fast algorithms for this problem? > What about the case when the polygons are convex? > > Thanks, > Laura
By "surface", do you mean area or perimeter? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
