x-y offsets [message #70964] |
Tue, 18 May 2010 13:29 |
Gray
Messages: 253 Registered: February 2010
|
Senior Member |
|
|
Hi all,
This is a variation on the 2D matching problem that I'm having trouble
algorithm-ing (to coin an incredibly awkward word).
I have two sets of XY coordinates of unequal length (i.e., x1/y1/n1,
x2/y2/n2, n1 ne n2). I want to find offsets in both X and Y that
match the two sets as closely as possible (there will obviously be
some unmatched coordinates in the larger set). I'm just looking for
constant offsets, so basically (for n1 < n2) x1 + Cx -> x2, y1 + Cy ->
y2, with some elements of x2 and y2 being unmatched. How do I go
about doing this? I don't think I can use JD's MATCH_2D because I
don't know a priori what my matching radius is.
Any suggestions? Thanks, as always!
--Gray
|
|
|