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.
| Version: | 0.5.5 |
| Depends: | methods |
| Published: | 2022-10-03 |
| DOI: | 10.32614/CRAN.package.SearchTrees |
| Author: | Gabriel Becker |
| Maintainer: | Gabriel Becker <gabembecker at gmail.com> |
| BugReports: | https://github.com/gmbecker/SearchTrees/issues |
| License: | LGPL-2 | LGPL-2.1 | LGPL-3 [expanded from: LGPL] |
| URL: | https://github.com/gmbecker/SearchTrees |
| NeedsCompilation: | yes |
| CRAN checks: | SearchTrees results |
| Reference manual: | SearchTrees.html , SearchTrees.pdf |
| Package source: | SearchTrees_0.5.5.tar.gz |
| Windows binaries: | r-devel: SearchTrees_0.5.5.zip, r-release: SearchTrees_0.5.5.zip, r-oldrel: SearchTrees_0.5.5.zip |
| macOS binaries: | r-release (arm64): SearchTrees_0.5.5.tgz, r-oldrel (arm64): SearchTrees_0.5.5.tgz, r-release (x86_64): SearchTrees_0.5.5.tgz, r-oldrel (x86_64): SearchTrees_0.5.5.tgz |
| Old sources: | SearchTrees archive |
| Reverse imports: | cmsafops |
| Reverse suggests: | cmsaf, cmsafvis |
Please use the canonical form https://CRAN.R-project.org/package=SearchTrees to link to this page.