我正在嘗試使用 Kdtree 數據結構從數組中移除最近的點，最好不要 for 循環。import sysimport timeimport scipy.spatialclass KDTree:    """    Nearest neighbor search class with KDTree    """    def __init__(self, data):        # store kd-tree        self.tree = scipy.spatial.cKDTree(data)    def search(self, inp, k=1):        """        Search NN        inp: input data, single frame or multi frame        """        if len(inp.shape) >= 2:  # multi input            index = []            dist = []            for i in inp.T:                idist, iindex = self.tree.query(i, k=k)                index.append(iindex)                dist.append(idist)            return index, dist        dist, index = self.tree.query(inp, k=k)        return index, dist    def search_in_distance(self, inp, r):        """        find points with in a distance r        """        index = self.tree.query_ball_point(inp, r)        return np.asarray(index)import numpy as npimport matplotlib.pyplot as pltimport matplotlib.animation as animationstart = time.time()fig, ar = plt.subplots()t = 0R = 50.0u = R *np.cos(t)v = R *np.sin(t)x = np.linspace(-100,100,51)y = np.linspace(-100,100,51)xx, yy = np.meshgrid(x,y)points =np.vstack((xx.ravel(),yy.ravel())).TTree = KDTree(points)ind = Tree.search_in_distance([u, v],10.0)ar.scatter(points[:,0],points[:,1],c='k',s=1)infected = points[ind]ar.scatter(infected[:,0],infected[:,1],c='r',s=5)def animate(i):    global R,t,start,points    ar.clear()    u = R *np.cos(t)    v = R *np.sin(t)    ind = Tree.search_in_distance([u, v],10.0)    ar.scatter(points[:,0],points[:,1],c='k',s=1)    infected = points[ind]    ar.scatter(infected[:,0],infected[:,1],c='r',s=5)    #points = np.delete(points,ind)    t+=0.01    end = time.time()    if end - start != 0:        print((end - start), end="\r")        start = endani = animation.FuncAnimation(fig, animate, interval=20)plt.show()  但無論我做什么，我都無法讓 np.delete 處理 ball_query 方法返回的索引。我錯過了什么？我想讓紅色點在點數組的每次迭代中消失。