A binary tree in which every node is a k-dimensional point.

jtsiomb 0a5ee0c04f variable side in kd_nearest_i didn't do anything ... git-svn-id: http://kdtree.googlecode.com/svn/trunk@29 58b2c0e6-ac2f-0410-a5b6-b51bcff41737		2010-07-29 20:11:27 +00:00
doc	moving arround files	2009-08-27 20:21:37 +00:00
examples	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	variable side in kd_nearest_i didn't do anything	2010-07-29 20:11:27 +00:00
kdtree.h	implementing N nearest neighbors search	2009-09-04 13:45:35 +00:00
Makefile.in	moving arround files	2009-08-27 20:21:37 +00:00