Some tree search (and brute force) methods for nearest-neighbor search.
Currently implemented searchers:
- BruteForce (with Max k heap)
- KdTree
- CoverTree
Currently implemented concepts:
- Metric
- Searcher (for nearest-neighbor problem)
- Dimension Space
- Coordinate
- Point