xiaoyan159/vtm
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
Izumi Kawashima
2019-05-18 03:21:51 +09:00
committed by Emux
parent 70741d8f5b
commit 551c0231a0
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
vtm/src/org/oscim/utils/RTree.java
View File

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