kiddo_v1 icon indicating copy to clipboard operation
kiddo_v1 copied to clipboard

K-dimensional tree in Rust for fast geospatial indexing and lookup

Results 9 kiddo_v1 issues
Sort by recently updated
recently updated
newest added

Is support for discrete index type planned ? Using u32 as dimension can be useful in many fields. My usage is a sparse 3d grid for discrete physics simulation.

enhancement
help wanted
good first issue

* feat: PBC now expects the period as an argument when querying using PBC functions, rather than storing it in the tree. This prevents the memory layout of the KdTree...

Currently, `within_unsorted` returns a `Vec` of all points within the specified radius. I want to be able to stop the search for these points prematurely if a yielded value fulfills...

enhancement
good first issue

There currently seems to be no way of determining if two trees contain the same points and values. This could be implemented by implementing something like IntoIterator over all points...

enhancement
good first issue

This incorporates some of the feedback you gave me on the last attempt. I had made a mess of my branch so I'm here with a new one and a...

Any plans on implementing periodic boundary conditions?

I'd like to be able to do whats stated in the title. It seems like `.within()` only returns the values of points, but not the actual coordinates. Is it possible...

Hi! I read through the implementation and found that almost everything is an Option/Result due to the choice from the original kdtree to include *hrm* "useful" runtime errors such as...

How easy it would be to hack this lib to get the furthest node from a 3d point?