Trees | Indices | Help |
---|
|
1 """ 2 The KD tree data structure can be used for all kinds of searches that 3 involve N-dimensional vectors. For example, neighbor searches (find all points 4 within a radius of a given point) or finding all point pairs in a set 5 that are within a certain radius of each other. See "Computational Geometry: 6 Algorithms and Applications" (Mark de Berg, Marc van Kreveld, Mark Overmars, 7 Otfried Schwarzkopf). 8 """ 9 10 from KDTree import KDTree 11
Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Wed Dec 16 11:27:00 2009 | http://epydoc.sourceforge.net |