Closed KristofferC closed 9 months ago
KDNode has the following definition
KDNode
https://github.com/KristofferC/NearestNeighbors.jl/blob/80db057df2546ea197b4b573dd876f2578fd09c6/src/kd_tree.jl#L1-L8
However, I don't see why we need to store lo and hi. That should be computable based on the parent hyper rectangle and the split_dim + split_val in a similar way as when we build the tree itself.
lo
hi
split_dim
split_val
KDNode
has the following definitionhttps://github.com/KristofferC/NearestNeighbors.jl/blob/80db057df2546ea197b4b573dd876f2578fd09c6/src/kd_tree.jl#L1-L8
However, I don't see why we need to store
lo
andhi
. That should be computable based on the parent hyper rectangle and thesplit_dim
+split_val
in a similar way as when we build the tree itself.