java - Which one is better for (Spatial indexing and Searching algorithm)

Question

I have 3-dimensional data. I keep this data on the kd-tree and perform spatial indexing. Then I search using the k-nn search algorithm. I wonder if there is a more performance tree structure than kd-tree for 3 dimensional data structure ? (It will increase the speed of my search algorithms)

Thanks in advance

Answer 1

等待大神答复