As of 2007-10-02 0:00:00 GMT, this project may now be found at http://libkdtree.alioth.debian.org.
a C++ template container implementation of k-dimensional space sorting based on the kd-tree data structure. THIS PROJECT HAS MOVED TO ALIOTH.DEBIAN.ORG
Be the first to post a text review of libkdtree++. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Development of libkdtree has moved to GNU arch. It is now available as category libkdtree--main--0 from the following archive: madduck@arch.madduck.net--2005-coding http://arch.madduck.net/~madduck/pub/2005/coding The tree may be viewed online at http://arch.madduck.net/cgi-bin/archzoom.cgi/madduck@arch.madduck.net--2005-coding/libkdtree--main--LATEST--LATEST
Thanks to Paul Harris, version 0.2.0 of libkdtree++ features some minor enhancements to the code. The most important are: - a full set of range constructors and insert(range) methods. It now works with inserter(tree,tree.begin()). - Target type no longer needs a default constructor. - Added a new method: count_within_range(). Thanks, Paul, and thank you for using libkdtree++!
Paul Harris has submitted two patches to fix bugs[0][1] in the code, so I am making a new minor release. 0. http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=279614 1. http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=279620 You can get the new files from http://people.debian.org/~madduck/packages/stage/libkdtree++/source Alternatively, add deb http://people.debian.org/~madduck/packages/stage/libkdtree++ ./ deb-src http://people.debian.org/~madduck/packages/stage/libkdtree++ ./ to /etc/apt/sources.list if you are using Debian to always get the latest files. The packages are signed. More information is here[2]. 2. http://people.debian.org/~madduck/packages/ Thanks for using libkdtree++!
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?
Thanks for your review!
Get credit for your review by logging in via OpenID. Click your account provider: