hyper-tree
| Crates.io | hyper-tree |
| lib.rs | hyper-tree |
| version | 0.2.0 |
| created_at | 2024-11-30 03:06:47.859152+00 |
| updated_at | 2025-09-17 21:38:00.115176+00 |
| description | Quadtrees and Octrees generalized to any dimension and type |
| homepage | |
| repository | |
| max_upload_size | |
| id | 1466266 |
| size | 55,132 |
Gaetan Almela (llGaetanll)
documentation
README
hyper-tree
A zero-cost generalization over quadtrees and octrees that store points.
- No dependencies!
- 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.
TODO
- Test
- Benchmark
- Add support for padded trees
- Expose basic API