A fast static index for 2D points
-
Updated
Sep 24, 2024 - JavaScript
A fast static index for 2D points
Transform a 2D point distribution to a hex grid to avoid overplotting in data visualizations
Generation of 2D points using the Poisson Disk sampling algorithm
Create a symbol table data type whose keys are two-dimensional points. Use a 2d-tree to support efficient range search and nearest neighbor search.
A static spacial index for 2D points in V
k-nearest neighbors search (KNN) for KDBush
Given a weighted set of 2D points, it computes the Heaviest Increasing Point Subset
Add a description, image, and links to the 2d-points topic page so that developers can more easily learn about it.
To associate your repository with the 2d-points topic, visit your repo's landing page and select "manage topics."