| Re: expanded 2d matching [message #73429] |
Mon, 08 November 2010 16:09 |
Jeremy Bailin
Messages: 618
Registered: April 2008
|
Senior Member |
|
|
On Nov 7, 7:16 am, Gray <grayliketheco...@gmail.com> wrote:
> Hi all,
>
> I've run into several situations where I needed to match 2d
> coordinates between multiple sets. First it was three, and that
> involved the simple-to-code solution of 3 calls to match_2d and two to
> cmset_op. Then came matching between 7 sets of coords, and I did
> crute force for that one too, so it was 21 calls to match_2d with the
> results stored into an expanding array of indices.
>
> Does anyone have a better algorithm for matching coordinates across N
> multiple sets than (N choose 2) calls to match_2d? I have to match
> across 62 sets, now, and I don't want to write 1891 matches...
>
> --Gray
Given the way match_2d works, I would expect that you could use the
general outline of the algorithm to do an arbitrary number of data
sets. Can you be more specific about what you want? In match_2d, one
of the sets is primary - you may get a different answer as to what the
best match is if you swap them - but the way you're describing it, I
think you don't want that.
-Jeremy.
|
|
|
|
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
