What is the quickest way to find the shortest cartesian distance between two polygons

Question

I have 1 red polygon say and 50 randomly placed blue polygons - they are situated in geographical 2D space. What is the quick

Answer 1

You might want to look at Voronoi Culling. Paper and video here:

http://www.cs.unc.edu/~geom/DVD/