On Sep 2, 2011, at 4:50 AM, Benny Malengier wrote:
> I was on euroscipy last week, and talked about a likewise algorithm to > determine overlap of grains. Gave some slides about FiPy which drew some > attention :-) Good! > Anyway, they advised to do a test with scipy.spatial (pdist function, or even > ckdtree) to see if it is not faster for my use-case. For different meshes I > don't think that would work however (as you don't want to compare with points > of the same mesh). So, if you have a general function, submitting for > inclusion in scipy.spatial is an option that could benefit many people. We've thought about tree searches, but haven't really explored it much. I looked into NetworkX very superficially awhile back for another, related, problem, but it and scipy.spatial deserve another look. > I'll look at your final commit and merge your improvements back in my > project, and see if I did not find another optimization myself which could go > back in fipy. Please do.
