Search results
21 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
A very fast static 2D index for points based on kd-tree.
Fast nd point clustering.
- snap-points-2d
- supercluster
- quadtree
- quad-tree
- kdtree
- kd-tree
- ann-tree
- point
- scatter
- point2d
- 2d
- cluster
- clustering
- geospatial
- View more
a vector similarity search engine in WASM
Fast nd point clustering.
- snap-points-2d
- supercluster
- quadtree
- quad-tree
- kdtree
- kd-tree
- ann-tree
- point
- scatter
- point2d
- 2d
- cluster
- clustering
- geospatial
- View more
100% JS k-d tree. Port of kd-tree-javascript.
search for k nearest neighbors on a sphere
n-D spatial indexing data structures with a shared ES6 Map/Set-like API
KDBush with flat API
Zero-dependency offline geocoding library for India — forward geocode, reverse geocode, fuzzy search, and bounding-box queries. No internet required.
- geocode
- geocoding
- reverse-geocode
- india
- offline
- maps
- geolocation
- spatial
- kd-tree
- trie
- geonames
- latitude
- longitude
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
Objects and functions for representing and manipulating colors in a locale-aware manner across 74 languages
- berlin-kay
- blend
- ciede2000
- cielab
- color-conversion
- color-difference
- color-distance
- color-lookup
- color-manipulation
- color-mixing
- color-name
- color-names
- color-naming
- color-parser
- View more
Fast hierarchical agglomerative clustering powered by WebAssembly.
- nodejs
- browser
- cpp
- clustering
- kd-tree
- webassembly
- wasm
- image-processing
- nearest-neighbour
- image-compression
- image-analysis
- palette-generation
- hierarchical-clustering
- color-clustering
- View more
100% JS k-d tree. Port of kd-tree-javascript.
KD-tree spatial index for static point sets and nearest-neighbor queries
KD tree implentation
轻量化kd-tree搜索方法
kd-tree
A very fast static 2D index for points based on kd-tree. Input points are one dimension array.
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.