Re: [math-fun] Re: math-fun Digest, Vol 17, Issue 8

=Phil Carmody Surely the easiest algorithm would be Dijkstra's?

I'm not sure; which algorithm of Dijkstra's do you refer to? Googling on just dijkstra+algorithm mainly gets zillions of references to a shortest path procedure. That's not applicable to this problem of determining the nearest neighbor in an efficient way; the "Dijkstra's algorithm" assumes you have this information a priori. Anyway, if you can provide further keywords to search on let me know and I'll try tossing them in the engine's maw. Thanks!