 |
|
|
|
|
 |
 |
|
Nearest Neighbours Using kd-Trees
|
|
|
|
|
|
| Organization: | Department of Computer Science, Cardiff University |
|
|
|
|
|
|
0208-471
|
|
|
|
|
|
1996-12-03
|
|
|
|
|
|
The algorithm for finding the set of nearest neighbours given by Bentley in "An Algorithm for Finding Best Matches in Logarithmic Expected Time" (ACM Math. Software 3, 1977) is implemented using Mathematica as a prototyping tool.
|
|
|
|
|
|
|
|
|
|
|
|
nearest neighbours, nearest neighbors, kd-Trees
|
|
|
 |
|
|
| NNcode.nb (133 KB) - Mathematica Notebook | | NNdescription.ps (203.1 KB) - Postscript file |
Files specific to Mathematica 2.2 version:
| | NNcode.ma (58.4 KB) - Mathematica Notebook 2.2 or older |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
