K-dimensional tree in Rust for fast geospatial indexing and lookup
-
Updated
Jul 23, 2026 - Rust
#
k-dimensional
Here are 8 public repositories matching this topic...
Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.
tree algorithm minimal geometry mst minimum euclidean spanning minimum-spanning-tree kdtree emst euclidean-distance minimal-spanning-tree k-dimensional spanning-tree
-
Updated
Jun 21, 2021 - C++
Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
-
Updated
Jun 28, 2026 - Crystal
VoronoiX (or VX) - C++ library, with JS interface on top of it, that allows to work with different data structures and algorithms related to Voronoi diagram, Delaunay triangulation and other geometric structures.
-
Updated
Jun 18, 2020 - C++
My solutions to CS61B taught by Josh Hug at Berkely spring 2019.
hashing algorithms maps priority-queue data-structures debug binary-search-tree red-black-tree sorting-algorithms heap balanced-search-trees exception-handling union-find merge-sort quick-sort k-trees percolation-system algorithms-and-data-structures union-by-rank-and-path-compression k-dimensional
-
Updated
May 29, 2020 - Java
An implementation of a KD-Tree in vanilla JavaScript
-
Updated
Oct 9, 2019 - JavaScript
Finding nearest city to a position in android using k-d trees
android maps nearest-neighbor-search nearest-neighbor trees androidstudio kdtrees kdtree k-dimensional trees-graphs
-
Updated
Jul 28, 2020 - Java
Raku package with implementations of the K-Dimensional Tree (KDTree) algorithm.
-
Updated
May 31, 2026 - Raku
Add this topic to your repo
To associate your repository with the k-dimensional topic, visit your repo's landing page and select "manage topics."