Alternatives and similar repositories for tinyqueue

Users that are interested in tinyqueue are comparing it to the libraries listed below

• mourner / kdbush
  A fast static index for 2D points
  ☆685Updated last month
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆227Updated last month
• mourner / flatqueue
  A very fast and simple JavaScript priority queue
  ☆142Updated last month
• mourner / quickselect
  A fast selection algorithm in JavaScript.
  ☆96Updated last month
• adamhooper / js-priority-queue
  Priority queues in JavaScript
  ☆238Updated 6 years ago
• ubilabs / kd-tree-javascript
  JavaScript k-d Tree Implementation
  ☆653Updated 2 years ago
• mourner / geokdbush
  The fastest spatial index for geographic locations in JavaScript
  ☆379Updated last month
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆236Updated 2 years ago
• mourner / flatbush
  A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
  ☆1,544Updated last month
• andriiheonia / hull
  This repository is deprecated and no longer maintained.
  ☆588Updated 11 months ago
• lemire / FastPriorityQueue.js
  a fast heap-based priority queue in JavaScript
  ☆364Updated last year
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆183Updated 5 months ago
• anvaka / isect
  Segments intersection detection library
  ☆280Updated 2 weeks ago
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆613Updated last year
• w8r / avl
  Fast AVL tree for Node and browser
  ☆118Updated last month
• mziccard / node-timsort
  Tim Sort implementation for Node.js
  ☆247Updated 5 years ago
• w8r / GreinerHormann
  Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…
  ☆247Updated last month
• w8r / splay-tree
  Fast splay-tree data structure
  ☆121Updated last week
• rawify / BitSet.js
  The RAW arbitrary size Bit-Vector implementation in JavaScript
  ☆235Updated last year
• astrolukasz / density-clustering
  Density Based Clustering in JavaScript
  ☆227Updated 6 years ago
• mapbox / potpack
  A tiny rectangle packing JavaScript library (for sprite layouts)
  ☆348Updated 5 months ago
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆311Updated 5 years ago
• mikolalysenko / robust-point-in-polygon
  Exactly test if a point is inside, outside or on the boundary of a polygon
  ☆251Updated 2 years ago
• uber-web / math.gl
  A 3D/WebGL math library
  ☆419Updated last year
• mapbox / concaveman
  A very fast 2D concave hull algorithm in JavaScript
  ☆719Updated 5 months ago
• mikolalysenko / functional-red-black-tree
  A purely functional red-black tree data structure
  ☆388Updated 2 years ago
• calvinmetcalf / catiline
  JavaScript library to take the pain out of web workers.
  ☆586Updated 8 years ago
• anvaka / ngraph.path.demo
  This is a demo project for ngraph.path
  ☆192Updated 7 months ago
• mapbox / pbf
  A low-level, lightweight protocol buffers implementation in JavaScript.
  ☆857Updated last year
• rawify / Complex.js
  The RAW Complex.js is a complex numbers library written in JavaScript
  ☆250Updated last month