search

KristofferC / NearestNeighbors.jl

High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
Other
413 stars 65 forks source link

It should be possible to make `KDNode` smaller #165

Closed KristofferC closed 9 months ago

KristofferC commented 9 months ago

KDNode has the following definition

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.