From: Devin Mullins <twifkak@...>
Date: 2006-12-21T11:54:35+09:00
Subject: Re: Common point puzzle

Bil Kleb wrote:
> M. Edward (Ed) Borasky wrote:
>> Are these grids large enough that brute force in-core solutions are 
>> ruled out? :)
> Unfortunately, I don't understand the question.
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 code's destined not to look to 
ugly (possibly helped with clever application of #zip or sth? dunno), 
but if you have stricter speed requirements...

(Not the OP.. just taking a crack at a translation.)

Devin