` 1` ` `
` 2` ` `
` 3` ` `
` 4` ` `
` 5` ` `
` 6` `"""KD tree data structure for searching N-dimensional vectors.`
` 7`
` 8` `The KD tree data structure can be used for all kinds of searches that`
` 9` `involve N-dimensional vectors. For example, neighbor searches (find all points`
`10` `within a radius of a given point) or finding all point pairs in a set`
`11` `that are within a certain radius of each other. See "Computational Geometry:`
`12` `Algorithms and Applications" (Mark de Berg, Marc van Kreveld, Mark Overmars,`
`13` `Otfried Schwarzkopf).`
`14` `"""`
`15` ` `
`16` `from` `.``KDTree` `import` `KDTree`
`17` ` `