A Javascript implementation of the "k-Nearest-Neighbor" machine-learning algorithm

A light K-nearest neighbor module created by Georgios Kontopoulos

Calculates an index based the average distances between points in the dataset, thereby providing inference as to whether the data is clustered, dispersed, or randomly distributed within the study area.

a poorman's implementation of k-nearest-neighbor algorithm

very fast JS GIF encoder

A kdtree data structure

Find the nearest point to a sample point

A basic but super fast JavaScript implementation of the k-dimensional tree data structure.

High-performance vector database with HNSW indexing - 50k+ inserts/sec, built in Rust for AI/ML similarity search and semantic search applications

Finds the nearest point from a FeatureCollection of Features with Point geometries to a given point.

Calculate the influence or weight of points over an area based on their distances.

RaBitQ 1-bit quantized vector index in WebAssembly — 32× embedding compression with high-recall rerank, for browsers, Cloudflare Workers, Deno, and Bun

Finds the nearest point on a line to a given point

TypeScript definitions for find-root

Resize a decoded raw image.

Semantic router for AI agents - vector-based intent matching with HNSW indexing and SIMD acceleration

Vehicle routing optimization: TSP, CVRP and VRPTW with constructive heuristics, local search, GA with Split, and ALNS.

Finds the nearest point based on a delaunay diagram

Nearest neighbor algorithm to find the most similar object within an array of objects.

Returns the closest point, of a collection of points, to a line.