From: Bil Kleb <Bil.Kleb@...>
Date: 2006-12-21T21:30:05+09:00
Subject: Re: Common point puzzle

Devin Mullins wrote:
> The naive implementation is n^2 (with n being the number of gridpoints), 
> and simply iterates over the coarsest grid, each time finding the 
> matching points in the two others.

That's going to be my route unless someone comes up
with a nifty array intersection sort of solution.

Speed is not a requirement, yet.

Thanks,
--
Bil Kleb
http://fun3d.larc.nasa.gov