Hi Legolas. Legolas Woodland: > Thank you for reading my post , and Im sorry if this place is not > suitable place for this question
Probably not the right place, but no matter... > Now i should find an algorithm or method to sort those X,Y points in a > way that head movement become minimum. > is there such algorithm around ? This general problem is the Travelling Saleseman Problem[1,2], which unfortunately is NP hard. You may have luck with some heuristic algorithms that result in a "good" solution, but still not minimal. Cameron [1] http://en.wikipedia.org/wiki/Traveling_salesman_problem [2] http://mathworld.wolfram.com/TravelingSalesmanProblem.html -- Cameron McCormack ICQ: 26955922 cam (at) mcc.id.au MSN: cam (at) mcc.id.au http://mcc.id.au/ JBR: heycam (at) jabber.org --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
