https://github.com/engineersbox/kd-tree
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees.
https://github.com/engineersbox/kd-tree
Last synced: 11 months ago
JSON representation
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees.
- Host: GitHub
- URL: https://github.com/engineersbox/kd-tree
- Owner: EngineersBox
- Created: 2020-02-27T13:37:14.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2020-02-27T13:57:21.000Z (over 6 years ago)
- Last Synced: 2025-03-22T17:44:54.837Z (about 1 year ago)
- Language: Python
- Size: 1000 Bytes
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0