Basic libkdtree binding to node
A kdtree data structure
TypeScript definitions for static-kdtree
[](https://badge.fury.io/js/kdtree-typescript)
kdtree data structure
A thing to convert CSV with lat/lon into kdtree + data files
This project is wasm wrapper for rust kdtree lib in order to use in Nodejs and browser environment.
A pure javascript KDTree implementation
Doping for https://www.npmjs.com/package/density-clustering
static-kdtree ============= [kd-trees](http://en.wikipedia.org/wiki/K-d_tree) are a [compact](http://en.wikipedia.org/wiki/Succinct_data_structure) data structure for answering orthogonal range and nearest neighbor queries on higher dimensional point data
create a kdtree from lat/long and return the closest points
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
A Node.js KDTree implementation with lazy indexing for sparse object collision detection.
This library was generated with [Angular CLI](https://github.com/angular/angular-cli) version 8.1.2.
TypeScript definitions for kd-tree-javascript
KD-tree implementation targeting WebAssembly, written in Rust and taylored for Node.js environments.
==============
Math library for JavaScript 2D/3D graphics rendering.
Basic libkdtree binding to node
simple experimental kd tree for sloppy json objects
Collection of algorithms and data structures written in TypeScript for fun and profit
A base implementation of kd-tree
Computing geometry module
Utility data stuctures, math, and types for JS
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
k-dimensional tree
Fast Kdtree implementation for raytracer
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
K-dimensional tree implemented in Rust for fast NN querying.
A high-performance, flexible, ergonomic k-d tree library. Ideal for geo- and astro- nearest-neighbour and k-nearest-neighbor queries
simple, immutable, flat k-d tree
Rust implementation of KDTree
A Rust library for KD-Tree, implemented based on nanoflann, primarily optimized for 2D or 3D point clouds.
Deterministic manifold snapping with O(log n) KD-tree indexing — maps continuous vectors to exact Pythagorean coordinates
A crate for tracking bevy entities in spatial indices.
A zero-dependency, embeddable, self-tuning spatial index for Rust
A kdtree is a data structure that makes it possible to quickly solve the nearest neighbor problem. This is a native 2d kdtree suitable for production use with millions of points.
Tupalo-kdtree is a thread-safe fork of the kdtree Gem by Adam Doppelt.
My implementation of a 2d k-d tree
Blazingly fast 2d kdtree.
This is a simple FFI wrapped version of libkdtree for Ruby. It's a pure ruby wrapper so this gem can be loaded and run by any ruby runtime that supports FFI. That's all of them: MRI 1.9.x, Rubinius and JRuby.
KDTree updated for Ruby 1.9.x
A fork of gem 'kdtree', which builds on Windows and depends on sc2ai. Use the original 'kdtree' instead. See homepage link.
A KDTree Library
Implements K-Nearest Neighbor algorithm using a KDTree in Ruby. Usefull for sorting geolocation or any other multi-dimensional data.
Get a ActiveSupport/Timezone from a given lat long
Using CIE L*a*b* and kdtrees, take a color (from LESS, SCSS, or other inputs) and find the nearest shade of color from a given palette
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.