The following utilities are provided: - Nearest neighbor - K-Nearest neighbors - Radius Search They al supports N-dimensions and work on double, it is possible to choose if return the distances. Here is a time comparison with a vectrized m-code: N=1000000 number of reference points Nq=100 number of query points dim=3 dimension of points k=3 number of neighbor tic [idc,dist]=BruteSearchMex(p ,qp , k ,k) MEX toc tic [idc,dist]=knnsearch(qp,p,k) VECTORIZED M-CODE toc p=rand(N,dim) qp=rand(Nq,dim) Output: Elapsed time is 0.962640 seconds. Elapsed time is 18.813100 seconds.

BruteSearchMex.cpp
BruteSearchTranspose.cpp
TestBruteSearch.m

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．