海量数据最近邻查找可以用kd tree
目前理解,kd tree需要的数据维度相同,否则会出问题
kd tree实现:https://github.com/stefankoegl/kdtree
下面是测试代码:
import kdtree # Create an empty tree by specifying the number of # dimensions its points will have emptyTree = kdtree.create(dimensions=3)