> I have never used Matlab's dsearchn, but scipy.spatial.cKDTree can > search rather quickly for nearest-neighbour points (time complexity > O(log n) for each search). Thanks, yes, and here I found pretty much what I needed using scipy.spatial.cKDTree: http://permalink.gmane.org/gmane.comp.python.scientific.user/19610 Evan