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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
WillKirkmanM/k-dimensional-tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published