KDTree implementation in pure javascript. Not yet complete, probably buggy at this stage. See TODOs.
If you want something higher performance you probably want to look at https://github.com/justinethier/node-kdtree
Example usage: var dimensions = 3; var tree = new KDTree(dimensions);
var data = [ [0,0,0], [10,10,10], [0,9,8], [1,9,12], [100,100,100], [200,200,200] ];
tree.build(data);
var results = tree.nearest([10,10,10], 2);
console.log('results'); for (var i in results) console.log(results[i].node.point + ' distance=%d', results[i].distance);