A binary tree in which every node is a k-dimensional point.
Find a file
Gregory Burd 8f97282953 basics
2014-05-05 21:28:29 -04:00
doc moving arround files 2009-08-27 20:21:37 +00:00
examples whitespace fixes 2011-11-25 00:08:45 +00:00
.gitignore basics 2014-05-05 21:28:29 -04:00
configure moving arround files 2009-08-27 20:21:37 +00:00
kdtree.c updated the email address in copyright statements 2011-11-25 00:21:09 +00:00
kdtree.h updated the email address in copyright statements 2011-11-25 00:21:09 +00:00
LICENSE basics 2014-05-05 21:28:29 -04:00
Makefile.in moving arround files 2009-08-27 20:21:37 +00:00
README basics 2014-05-05 21:28:29 -04:00

kdtree is a simple, easy to use C library for working with kd-trees.

Kd-trees are an extension of binary search trees to k-dimensional data. They facilitate very fast searching, and nearest-neighbor queries.

This particular implementation is designed to be efficient and very easy to use. It is completely written in ANSI/ISO C, and thus completely cross-platform.

http://code.google.com/p/kdtree/