mourner / tinyqueueLinks
The smallest and simplest priority queue in JavaScript.
☆460Updated last year
Alternatives and similar repositories for tinyqueue
Users that are interested in tinyqueue are comparing it to the libraries listed below
Sorting:
- k-nearest neighbors search (KNN) for RBush☆225Updated last year
- A very fast and simple JavaScript priority queue☆141Updated last month
- A fast static index for 2D points☆673Updated last month
- A fast selection algorithm in JavaScript.☆92Updated last year
- Priority queues in JavaScript☆238Updated 5 years ago
- JavaScript k-d Tree Implementation☆652Updated last year
- A very fast static spatial index for 2D points and rectangles in JavaScript 🌱☆1,517Updated last month
- Two-dimensional recursive spatial subdivision.☆233Updated last year
- a fast heap-based priority queue in JavaScript☆365Updated last year
- This repository is deprecated and no longer maintained.☆591Updated 7 months ago
- A very fast JavaScript polyline and polygon clipping library☆182Updated 2 months ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆243Updated 2 years ago
- The fastest spatial index for geographic locations in JavaScript☆372Updated last year
- Fast AVL tree for Node and browser☆118Updated 3 weeks ago
- A low-level, lightweight protocol buffers implementation in JavaScript.☆846Updated last year
- Tim Sort implementation for Node.js☆245Updated 5 years ago
- A 3D/WebGL math library☆420Updated last year
- Matrix manipulation and computation library☆378Updated 3 months ago
- A static kdtree data structure☆310Updated 4 years ago
- Segments intersection detection library☆279Updated 6 months ago
- JavaScript library to take the pain out of web workers.☆586Updated 8 years ago
- Generate random numbers from various distributions.☆140Updated last year
- Serialize Canvas path commands to SVG.☆195Updated last year
- Fast splay-tree data structure☆120Updated last year
- A purely functional red-black tree data structure☆385Updated 2 years ago
- Density Based Clustering in JavaScript☆224Updated 6 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆595Updated last year
- Manipulate TopoJSON, such as to merge shapes, and convert it back to GeoJSON.☆228Updated 3 years ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆742Updated 2 months ago
- A binary heap implementation in CoffeeScript/JavaScript.☆128Updated last year