GLTree A nearest neighbour search algorithm
Download

GLTree Ranking & Summary

GLTree Tags

Finder Algorithm nearest color nearest CSCAN algorithm SSTF Algorithm search algorithm matlab mathemathical algorithm Axiom algorithm FPM algorithm Nearest Neighbor Problem find nearest neighbors NET algorithm nearest neighbour find nearest neighbour logspace data search logspace neighbour GNFS algorithm BIDI algorithm effector algorithm Euclide algorithm DLX algorithm Delaunay algorithm Nearest Neighbour Search Nearest Neighbour Filter K-Nearest Wunsch algorithm Dilation Algorithm display algorithm Pintail algorithm insertionsort algorithm selectionsort algorithm

GLTree Description

GLTree provides you with a simple but effective algorithm for Nearest Neighbour Search. It has been designed for uniformly random data, but works fine even on sparse ones. If points are too sparse, for example logspace data, search is still performed correctly but speed can degenerate to a brute search algorithm. If query points are close to reference it is very efficient on sparse dataset too. The tree can be build without running any search. The pointer passed to workspace can be used for the above routines. The tree costruction has linear time complexity and it is very fast, so it becomes advantageus against brute search even for a small number of points. In GL-Tree searching has linear complexity (on uniform dataset). This release includes: NNSearch KNNSearch RadiusSearch (only2D) It only supports 2D points and 3D points.

GLTree Related Software