The problem I am trying to solve is as follows: Given two lists of equal length containing points, find a mapping that minimizes the sum of distances between pairs. The reason I'm trying to do this is to find the closest points in two polygons for a genetic algorithm I'm building, that would ideally line up two genes based on the output of this computation to maximize the spatial similarity.
+3
A:
This is known as the linear assignment problem. The Hungarian algorithm is one way to solve it.
Zach Scrivena
2009-02-20 05:42:48
Thank you for the name, that helped my search a lot.
Evan Senter
2009-02-20 07:15:16
+1
A:
I actually asked basically the same question a few days ago here. There are a bunch of good links to explanations of possible solutions including simulated annealing.
MahlerFive
2009-02-20 06:18:32