hyper-tree
| Crates.io | hyper-tree |
| lib.rs | hyper-tree |
| version | 0.1.1 |
| source | src |
| created_at | 2024-11-30 03:06:47.859152 |
| updated_at | 2024-11-30 03:25:47.636325 |
| description | Quadtrees and Octrees generalized to any dimension and type |
| homepage | |
| repository | |
| max_upload_size | |
| id | 1466266 |
| size | 24,232 |
Gaetan Almela (llGaetanll)
documentation
README
hyper-tree
A zero-cost generalization over quadtrees and octrees that store points.
- No dependecies!
- 100% safe code
- Small footprint
This is not a kd-tree! While kd-trees are also used for binary space partitioning, their splits are not necessarily equal, as they are in quadtrees, octrees, and more general forms.
What can I do with this?
Right now, not much. This is still very much a work in progress.
Work in Progress!
The library needs to be tested and benched.
- Write tests
- Benchmark
- Allow creating padded trees Right now, new points can't be added to a tree without having to completely rebuild it.