Path: news.mathworks.com!not-for-mail
From: "John D'Errico" <woodchips@rochester.rr.com>
Newsgroups: comp.soft-sys.matlab
Subject: Re: sorting, 2D vector, puzzle piece shaped
Date: Fri, 14 Nov 2008 22:26:03 +0000 (UTC)
Organization: John D'Errico (1-3LEW5R)
Lines: 16
Message-ID: <gfkttr$fg7$1@fred.mathworks.com>
References: <gfk6hl$snc$1@fred.mathworks.com> <gfkkr6$a33$1@fred.mathworks.com> <gfknui$lf9$1@fred.mathworks.com>
Reply-To: "John D'Errico" <woodchips@rochester.rr.com>
NNTP-Posting-Host: webapp-02-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1226701563 15879 172.30.248.37 (14 Nov 2008 22:26:03 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Fri, 14 Nov 2008 22:26:03 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 869215
Xref: news.mathworks.com comp.soft-sys.matlab:500918


"Mahdieh" <mahdieh.emrani@capitalhealth.ca> wrote in message <gfknui$lf9$1@fred.mathworks.com>...

> I have tried the TSP code, provided by Joseph Kirk and large data it takes very very long to sort them, as you stated ...
> I have 1000 points on each curve and I need to analyze 18 curves at a time ... 
> So, I will try to combine the simple sorting solutions, such as the angle and centroid, with the TSP problem. i.e. first sort the points with the simple solution, then evaluate the points by some heuristic funny algorithms, and for the parts that the algorithm has failed, I will try to use the TSP code ....
> 
> Meanwhile, if someone come up with something, let me know ...

Oh. You did not tell us it was that large of a problem.
The TSP is truly nasty for large sets of points.

However, you might be willing to solve the TSP for say
every 5th point from your set, then add the rest of the
points back in.

John