From 2ca3d033025e0029a87e68a38a036d7f52fca451 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Vojt=C4=9Bch=20Moravec?= <theazgra@gmail.com>
Date: Sun, 6 Sep 2020 11:08:26 +0200
Subject: [PATCH] New note.

We should look at Best Bin First algorithm which should provide better
search performace. The algorithm `approximating` the nearest neighbor,
but in **almost all** cases finds the nearest one.
---
 src/main/java/azgracompress/kdtree/KDTree.java | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/main/java/azgracompress/kdtree/KDTree.java b/src/main/java/azgracompress/kdtree/KDTree.java
index 57529b6..fb1938f 100644
--- a/src/main/java/azgracompress/kdtree/KDTree.java
+++ b/src/main/java/azgracompress/kdtree/KDTree.java
@@ -5,6 +5,8 @@ import java.util.Arrays;
 // TODO(Moravec):   One more time read the paper and check the implementation!
 //                  Fix the spreadest function (max-min) may be used.
 //                  https://dl.acm.org/doi/pdf/10.1145/355744.355745
+//                  Actually get rid of this kdTree and look into BBF (Best Bin First)
+//                  https://www.cs.ubc.ca/~lowe/papers/cvpr97.pdf
 
 public class KDTree {
     private final int maximumBucketSize;
-- 
GitLab