Re: Multidimensional binary search trees

On Tuesday 17 April 2007 05:29, kingpin@xxxxxxxxxxx wrote:
i've a set S of points in R^n (a vector of n real numbers, where n, in
pratical applications, is between 10 and 60). ...
The most important operation that i would like
to do is finding the nearest neighbour point ...

If kd-trees are suitable for a multidimensional problem, are they
efficient? Are there any other data structures that i can use to solve
the problem?

I suggest Volker Gaede and Oliver Günther, Multidimensional Access
Methods, ACM Computing Surveys, 30(2):170-231, June 1998.

The article catalogs dozens of data structures and notes which are
good at finding the nearest neighbor point.

-paul-
--
Paul E. Black (p.black@xxxxxxx)
.