R-tree k-nearest neighbors search improvements (#727)

This commit is contained in:
Izumi Kawashima
2019-05-18 03:21:51 +09:00
committed by Emux
parent 70741d8f5b
commit 551c0231a0

View File

@@ -419,9 +419,8 @@ public class RTree<T> implements SpatialIndex<T>, Iterable<T> {
while (!queue.isEmpty() && queue.peek().isLeaf) {
KnnItem knnItem = queue.poll();
T obj = (T) (knnItem.branch);
results.add(obj);
if (results.size() >= k)
results.add((T) knnItem.branch.node);
if (results.size() == k)
return results;
}