davidmoten/rtree

How to do an incremental knn search?

Open

#163 opened on 2022年11月30日

GitHub で見る
 (5 comments) (0 reactions) (0 assignees)Java (209 forks)batch import
help wantedquestion

Repository metrics

Stars
 (1,038 stars)
PR merge metrics
 (平均マージ 1m) (30d で 1 merged PR)

説明

Incremental knn search save the priority queue in each round generated by knn search if best-first strategy is adopted, and use priority queue saved in the previous round to search knn in the current round. I want to do an incremental knn search. Does anyone can teach me, thank you very much!

コントリビューターガイド