mourner / tinyqueueLinks
The smallest and simplest priority queue in JavaScript.
☆451Updated last year
Alternatives and similar repositories for tinyqueue
Users that are interested in tinyqueue are comparing it to the libraries listed below
Sorting:
- A fast static index for 2D points☆666Updated 10 months ago
- k-nearest neighbors search (KNN) for RBush☆223Updated 10 months ago
- A very fast and simple JavaScript priority queue☆137Updated 3 years ago
- A fast selection algorithm in JavaScript.☆91Updated 10 months ago
- A very fast static spatial index for 2D points and rectangles in JavaScript 🌱☆1,489Updated 2 weeks ago
- Priority queues in JavaScript☆238Updated 5 years ago
- The fastest spatial index for geographic locations in JavaScript☆369Updated last year
- a fast heap-based priority queue in JavaScript☆366Updated last year
- JavaScript k-d Tree Implementation☆647Updated last year
- Two-dimensional recursive spatial subdivision.☆232Updated last year
- Segments intersection detection library☆279Updated 4 months ago
- This repository is deprecated and no longer maintained.☆591Updated 5 months ago
- Fast splay-tree data structure☆120Updated last year
- A very fast 2D concave hull algorithm in JavaScript☆695Updated 2 weeks ago
- Tim Sort implementation for Node.js☆245Updated 5 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆587Updated last year
- JavaScript library to take the pain out of web workers.☆586Updated 8 years ago
- A very fast JavaScript polyline and polygon clipping library☆178Updated 2 weeks ago
- NOTE: The viewport-mercator-project repo is archived and code has moved to☆140Updated 5 years ago
- A low-level, lightweight protocol buffers implementation in JavaScript.☆839Updated 11 months ago
- The fastest JavaScript priority queue out there. Zero dependencies.☆720Updated 2 years ago
- RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles☆2,602Updated 10 months ago
- A JavaScript library for doing geometry.☆1,014Updated 6 months ago
- Density Based Clustering in JavaScript☆222Updated 6 years ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆242Updated 2 years ago
- Exactly test if a point is inside, outside or on the boundary of a polygon☆247Updated 2 years ago
- Generate random numbers from various distributions.☆139Updated last year
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆738Updated last week
- 📈 Multidimensional arrays for JavaScript☆1,231Updated 3 years ago
- Serialize Canvas path commands to SVG.☆195Updated last year