libkdtree++
libkdtree++ is a C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretically unlimited number of dimensions, and can store any data structure. Provided the data structure, it provides operator[0 - k-1] to access the individual dimensional components (arrays, std::vector already do) and a std::less implementation for the type of dimensional components. It has support for custom allocators, implements iterators, and provides standard find as well as range queries. It has amortised O(lg n) time (O(n lg n) worst case) on most operations (insert/erase/find optimised) and worst-case O(n) space, and also provides a means to rebalance and thus optimise the tree.
| Tags | Games/Entertainment Scientific/Engineering Artificial Intelligence Mathematics Software Development Libraries |
|---|---|
| Licenses | Artistic |
| Operating Systems | OS Independent |
| Implementation | C++ |
Recent releases
- 06 Mar 2008 01:39
No changes have been submitted for this release.
- 15 Nov 2004 12:17
Changes: The code was cleaned up to support GCC 3.4 and 4.0pre0.
- 15 Nov 2004 04:02
Changes: This release includes some minor feature enhancements and bugfixes.
- 23 May 2004 10:04
No changes have been submitted for this release.
