__init__.py

00001"""The KD tree data structure can be used for all kinds of searches thatinvolve N-dimensional vectors. For example, neighbor searches (find all pointswithin a radius of a given point) or finding all point pairs in a setthat are within a certain radius of each other. See "Computational Geometry: Algorithms and Applications" (Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf)."""from KDTree import KDTree