A binary tree in which every node is a k-dimensional point.
Go to file
jtsiomb cb79847cd3 whitespace fixes
git-svn-id: http://kdtree.googlecode.com/svn/trunk@31 58b2c0e6-ac2f-0410-a5b6-b51bcff41737
2011-11-25 00:08:45 +00:00
doc moving arround files 2009-08-27 20:21:37 +00:00
examples whitespace fixes 2011-11-25 00:08:45 +00:00
Makefile.in moving arround files 2009-08-27 20:21:37 +00:00
configure moving arround files 2009-08-27 20:21:37 +00:00
kdtree.c solved an issue where if dim was < 16 the data would not get copied for the float versions of insert and nearest* 2011-11-25 00:04:54 +00:00
kdtree.h implementing N nearest neighbors search 2009-09-04 13:45:35 +00:00