The Simple, Thread-safe Approximate Nearest Neighbor (STANN) C++ Library is a library designed to perform nearest neighbor searches on point clouds. The STANN library was designed to be easily included into applications, and to showcase and compare various nearest neighbor algorithms, including dynamic and parallel algorithms.
STANN is available for download here: STANN_0.74.tar.gz
New users should check out the STANN User Guide
Problems? Comments? Post an issue on our new Issues List, courtesy of Google Code.
Interested in modifying STANN? Check out the STANN API (still under construction)
Papers related to STANN:
November 15, 2010
Version 0.74 released!
Minimum Spanning Tree code has been re-added, using Fair Split Trees instead of slower quadtrees.
A number of user reported errors have been corrected, including problems with the sample code, missing header files in the package,
problems with offsets in zorder code, and a lack of an error parameter in the k-nearest neighbor graph code.
Thanks for comments/emails/bug reports!
September 7, 2010
Identified a bug slowing down STANNs MST code. Temporarily removed MST from the STANN library, new and improved code will be up soon. -NOTE: The bug makes the MST code slower than advertised, but it will still produce correct results. If this is acceptable, no need to download the new version.
December 7, 2009
Fixed a bug in comp_quad_tree.hpp that produced a seg fault in some data sets. Fixed version of STANN is 0.71, now available for download.
October 1, 2009