SearchTrees
Spatial Search Trees
The QuadTree data structure is useful for fast, neighborhood-restricted lookups. We use it to implement fast k-Nearest Neighbor and Rectangular range lookups in 2 dimenions. The primary target is high performance interactive graphics.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.5.5 |
rolling linux/jammy R-4.5 | SearchTrees_0.5.5.tar.gz |
46.3 KiB |
0.5.5 |
rolling linux/noble R-4.5 | SearchTrees_0.5.5.tar.gz |
46.2 KiB |
0.5.5 |
rolling source/ R- | SearchTrees_0.5.5.tar.gz |
11.6 KiB |
0.5.5 |
latest linux/jammy R-4.5 | SearchTrees_0.5.5.tar.gz |
46.3 KiB |
0.5.5 |
latest linux/noble R-4.5 | SearchTrees_0.5.5.tar.gz |
46.2 KiB |
0.5.5 |
latest source/ R- | SearchTrees_0.5.5.tar.gz |
11.6 KiB |
0.5.5 |
2026-04-26 source/ R- | SearchTrees_0.5.5.tar.gz |
11.6 KiB |
0.5.5 |
2026-04-23 source/ R- | SearchTrees_0.5.5.tar.gz |
11.6 KiB |
0.5.5 |
2026-04-09 windows/windows R-4.5 | SearchTrees_0.5.5.zip |
52.0 KiB |
0.5.5 |
2025-04-20 source/ R- | SearchTrees_0.5.5.tar.gz |
11.6 KiB |