diff --git a/src/main/java/azgracompress/kdtree/KDTree.java b/src/main/java/azgracompress/kdtree/KDTree.java
index 57529b667814979b8017a556a28ff0c84b524e17..fb1938f08a46482df96f193e694787b2db824026 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;