I have 1 red polygon say and 50 randomly placed blue polygons – they are situated in geographical 2D space. What is the quickest/speediest algorithim to find the the shortest distance between a red polygon and its nearest blue polygon?
Bear in mind that it is not a simple case of taking the points that make up the vertices of the polygon as values to test for distance as they may not necessarily be the closest points.
So in the end – the answer should give back the closest blue polygon to the singular red one.
This is harder than it sounds!