Utilities
Brute-force search
The brute-force search does not require any supporting data structure like the kdtree. It is used for testing.
DistanceQueries.bfnearest — Functionδ, idx = bfnearest(x::Pts, y)Brute-force computation of nearest point, where Pts is Points{N,T} or Tree.