k-dimensional-tree

Here is 1 public repository matching this topic...

WillKirkmanM / k-dimensional-tree

A K-Dimensional Tree is a Space-Partitioning Data Structure used to Organise Points in a k-Dimensional Space. It is Functionally Similar to a Binary Search Tree that Works Across Multiple Dimensions (x, y, z) instead of just one.

k-d-tree parsonlabs k-dimensional-tree

Updated Dec 27, 2025
Rust

Improve this page

Add a description, image, and links to the k-dimensional-tree topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the k-dimensional-tree topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

k-dimensional-tree

Here is 1 public repository matching this topic...

WillKirkmanM / k-dimensional-tree

Improve this page

Add this topic to your repo