   Minimum distance between two sets of polygons
  I have two sets of polygons (i.e. {PolyA, PolyB, PolyC}, {PolyD, PolyE, PolyF}).  In MOST cases, at least one of them will be a single polygon, but this isn't always true.  They can be concave.  I'm trying to find the best algorithm to determine the minimum distance between the polygons.  I see algorithms for point to poly, poly overlap, poly distance, but not "multi-poly to multi-poly minimum distance"... Does anyone have pointers, algorithm names, or other hints?  Speed is important obviously, but it's not happening 1,000 times per second or anything.Thanks very much![Edited by - djMaxM on December 31, 2007 4:04:54 PM]