TypeScript definitions for kd-tree-javascript
A very fast static 2D index for points based on kd-tree.
tree module for kd
100% JS k-d tree. Port of kd-tree-javascript.
100% JS k-d tree. Port of kd-tree-javascript.
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
kd-tree
simple experimental kd tree for sloppy json objects
A base implementation of kd-tree
100% JS k-d tree. Port of kd-tree-javascript.
nanoflann KD-tree compiled to WebAssembly -- k-nearest neighbors in browsers and Node.js
轻量化kd-tree搜索方法
KD-tree spatial index for static point sets and nearest-neighbor queries
KD tree implentation
signed or unsigned distance function for triangles using r-tree and/or bvh and/or kd-tree
A simple-yet-powerful KD-tree library for NodeJS, with support for lightning-fast k-Nearest Neighbour queries. Supports normalization, weights, key and filter parameters
This library has functionality for sorting and querying data in a [KD Tree](https://en.wikipedia.org/wiki/K-d_tree) like structure. KD Trees are typically constructed by starting with a relatively large amount of data. Possibly all of the data that's int
KD tree implentation
A high-performance TypeScript Vector Database with LSM storage and KD-tree indexing
A very fast static 2D index for points based on kd-tree. Forked from KDBush
A very fast static 2D index for points based on kd-tree.
A very fast static 2D index for points based on kd-tree. Input points are one dimension array.
A kdtree data structure
K-Dimension tree in typescript
k-dimensional tree
Neighbor-based algorithms for sklears: k-NN, radius neighbors
Deterministic manifold snapping with O(log n) KD-tree indexing — maps continuous vectors to exact Pythagorean coordinates
A very fast static spatial index for 2D points based on a flat KD-tree.
A very fast static spatial index for 2D points based on a flat KD-tree.
Fast, Dependency-free Spacial Queries
High-performance spatial index for radius queries in D-dimensional Euclidean space
FNNTW: Fastest Nearest Neighbor (in the) West. A fast kdtree/kNN library.
A Rust library for KD-Tree, implemented based on nanoflann, primarily optimized for 2D or 3D point clouds.
A zero-dependency, embeddable, self-tuning spatial index for Rust
The core modules defining the flow and structs of data in computational chemistry routines.
A lean 2d kd-tree ported from OpenCamLib
Great for nearest neighbor search in k dimensions! (as long as k is reasonable)
A simple Ruby implementation of a k-d tree.
A KDTree Library
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.