Expand description
Immutable k-d trees (faster and smaller, but cannot be modified after construction).
Intended for use when the smallest possible on-disk serialized size of a tree is of paramount importance, and / or the fastest possible query speed is required.
Expect improvements in query time of 10-15%, and a reduction
in the size of serialized trees by 33% or so on average vs
the standard float::kdtree::KdTree
These capabilities come with a few trade-offs:
- This tree does not provide the capability to modify its contents after it has been constructed. The co-ordinates of the points to be stored must have all been generated in advance.
- Construction time can be a bit slower - anecdotally
this can be twice as long as the default
float::kdtree::KdTree. NB construction time improved massively in Kiddo v5 compared to earlier versions.
As per the other Kiddo float-type trees, points being stored
in the tree must be floats (f64 or f32,
or f16 in conjunction with the
half crate
Modulesยง
- float
- Immutable k-d trees (faster and smaller, but cannot be modified after construction).