nearest neighbor in 2D

[David Eppstein]

In article <bo8j4v$tqt$03$1 at news.t-online.com>,
 Peter Otten <__peter__ at web.de> wrote:

> This is of course all premature optimization as the most promising approach
> is to try hard to reduce the number of candidate points, as David Eppstein
> seems to have done. But then, he could use complex numbers, too.

Well, yes, but then my code wouldn't work very well in dimensions higher 
than two...

-- 
David Eppstein                      http://www.ics.uci.edu/~eppstein/
Univ. of California, Irvine, School of Information & Computer Science