High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
-
Updated
Nov 12, 2024 - Julia
High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
Efficient approximate k-nearest neighbors graph construction and search in Julia
Shrike.jl: Fast approximate nearest neighbor search with random projection trees. (Benchmarks included)
A Julia wrapper for Fast Library for Approximate Nearest Neighbors (FLANN)
Built-in solvers for the GeoStats.jl framework
Locally weighted regression solver for the GeoStats.jl framework
Julia wrapper around the Faiss library for similarity search with PythonCall.jl
Inverse distance estimation solver for the GeoStats.jl framework
Geostatistical estimation solvers for the GeoStats.jl framework
Adversarial Generalized TSP, MST and NN
Add a description, image, and links to the nearest-neighbors topic page so that developers can more easily learn about it.
To associate your repository with the nearest-neighbors topic, visit your repo's landing page and select "manage topics."