Back to index

python-biopython  1.60
Go to the documentation of this file.
00001 """
00002 The KD tree data structure can be used for all kinds of searches that
00003 involve N-dimensional vectors. For example, neighbor searches (find all points
00004 within a radius of a given point) or finding all point pairs in a set
00005 that are within a certain radius of each other. See "Computational Geometry: 
00006 Algorithms and Applications" (Mark de Berg, Marc van Kreveld, Mark Overmars, 
00007 Otfried Schwarzkopf).
00008 """
00010 from KDTree import KDTree