KdTree
KdTree copied to clipboard
A fast, generic, multi-dimensional Binary Search Tree written in C#
Saving a ```F# let t1 = new KdTree(1, new DoubleMath()); t1.SaveToFile(@"D:\alarms\alarmIndex.bin") ``` Gives the following error with about 7M entries: System.Runtime.Serialization.SerializationException: The internal array cannot expand to greater than Int32.MaxValue...
CSProj files have been updated to enable SourceLink in your nuget --- *[This pull request was created with an automated workflow]* I noticed that your repository and Nuget package are...
It would be very nice to provide some basic usage examples. While using the library (which is very good and solved my tasks) I was confused by multiple things: 1....
I'm confused about split HyperRect. Some articles point out that split HyperRect dimension should has max variance. But you just choose X-aix at first and alerative at next depth. Did...
shouldn't the kdtree be creating nodes on median values of an axis ? nodes should not get deeper than dimensions ?
The code of the Clear function is below, it need to add the line of code with Count = 0 public void Clear() { if (root != null) RemoveChildNodes(root); }