|
About:
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.
Author:
martin f. krafft <libkdtree [at] pobox [dot] madduck [dot] net>
[contact developer]
Homepage:
http://libkdtree.alioth.debian.org/
Tar/GZ:
https://alioth.debian.org/[..]wnload.php/2207/libkdtree++-0.6.2.tar.gz
Tar/BZ2:
https://alioth.debian.org/[..]nload.php/2205/libkdtree++-0.6.2.tar.bz2
Changelog:
http://git.debian.org/[..]libkdtree.git;a=blob;f=ChangeLog;hb=HEAD
CVS tree (cvsweb):
http://git.debian.org/?p=libkdtree/libkdtree.git;a=summary
Mailing list archive:
http://lists.alioth.debian.org/pipermail/libkdtree-devel/
Trove categories:
[change]
Dependencies:
[change]
No dependencies filed
|
|
» Rating:
(not rated)
» Vitality: 0.02% (Rank 3385)
» Popularity: 0.53% (Rank 10934)
 
(click to enlarge graphs)
Record hits: 4,840
URL hits: 1,817
Subscribers: 15
|
|
