TBruteForceNearestNeighborClassifier = class(TNearestNeighborClassifier);
Brute-force nearest neighbor search: The brute-force search structure is very simple but inefficient. It has been provided primarily for the sake of comparison with and validation of the more complex search structures.
Query processing is the same as described above, but the value of epsilon is ignored, since all distance calculations are performed exactly.
WARNING: This data structure is very slow, and should not be used unless the number of points is very small.
Internal information:
This data structure bascially consists of the array of points (each a pointer to an array of coordinates). The search is performed by a simple linear scan of all the points.
TObject Recognion_NearestNeighbor.TNearestNeighborClassifier Recognion_NearestNeighbor.TBruteForceNearestNeighborClassifier