kd樹的實現(python)

當前的實現針對的是二維空間, 代碼可運行node T = np.array([(2,3),(5,4),(9,6),(4,7),(8,1),(7,2)]) #T = np.array([(3,3),(2,2),(1,2)]) #plt.scatter(T[:,0], T[:,1]) def crt_tree(T, i): if len(T)==1: return Node(

>>阅读原文<<