Math::vector::real::kdtree implements a kd-tree data structure in perl and common algorithms on top of it.

the following methods are provided:
* new()
* clone()
* insert()
* size()
* at()
* move()
* find_nearest_vector()
* find_farthest_vector()
* k_means_start()
* k_means_step()
* k_means_loop()
* k_means_assign()
* find_in_ball()
* ordered_by_proximity()