K-d tree to use with map visualizations
JavaScript
14
2
No license
This is an iterative k-d tree implementation for efficiently finding nearest neighbors in spatial datasets, particularly useful for map visualizations and geographic applications. The library is designed for developers working with geospatial data who need to perform proximity searches or spatial queries on point collections, such as finding nearby locations on a map. It's built for use with mapping libraries like Leaflet and handles coordinate data in formats like GeoJSON.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of w8r/k-d-tree
A mature CSV toolset with simple api, full of options and tested against large datasets.
A tool concentrating on converting csv data to JSON with customised parser supporting
JavaScript library for mobile-friendly interactive maps
Miscellaneous plugins for Leaflet library for services that need to display route information and need satellite imagery from different providers
interface to mapbox services
Mapbox plugin for Leaflet
Computes the convex hull of a given set of points using the Quick Hull algorithm.
Next-generation ES module bundler
Compile ES2015 with buble
Allows specifying multiple entry points with rollup.
Fixes stack traces for files with source maps
A module for serving static files. Does etags, caching, etc.
Simple JS "transform" tool that will call window.close or process.exit when TAP output is complete
tap-producing test harness for node and browsers
convert an arbitrary string into an identifying color
Support the repos that depend on this repository
Top contributors
w8r
9 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet