Alternatives and similar repositories for tinyqueue

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

• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆225Updated last year
• mourner / kdbush
  A fast static index for 2D points
  ☆678Updated 3 months ago
• mourner / flatqueue
  A very fast and simple JavaScript priority queue
  ☆141Updated 3 months ago
• mourner / quickselect
  A fast selection algorithm in JavaScript.
  ☆96Updated last year
• mourner / flatbush
  A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
  ☆1,531Updated last week
• ubilabs / kd-tree-javascript
  JavaScript k-d Tree Implementation
  ☆654Updated last year
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆234Updated 2 years ago
• lemire / FastPriorityQueue.js
  a fast heap-based priority queue in JavaScript
  ☆364Updated last year
• mourner / geokdbush
  The fastest spatial index for geographic locations in JavaScript
  ☆377Updated last year
• adamhooper / js-priority-queue
  Priority queues in JavaScript
  ☆238Updated 6 years ago
• mziccard / node-timsort
  Tim Sort implementation for Node.js
  ☆246Updated 5 years ago
• andriiheonia / hull
  This repository is deprecated and no longer maintained.
  ☆588Updated 9 months ago
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆182Updated 3 months ago
• topojson / topojson-client
  Manipulate TopoJSON, such as to merge shapes, and convert it back to GeoJSON.
  ☆228Updated 3 years ago
• astrolukasz / density-clustering
  Density Based Clustering in JavaScript
  ☆226Updated 6 years ago
• uber-web / math.gl
  A 3D/WebGL math library
  ☆418Updated last year
• mikolalysenko / functional-red-black-tree
  A purely functional red-black tree data structure
  ☆386Updated 2 years ago
• mapbox / pbf
  A low-level, lightweight protocol buffers implementation in JavaScript.
  ☆849Updated last year
• w8r / splay-tree
  Fast splay-tree data structure
  ☆121Updated last year
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆606Updated last year
• anvaka / isect
  Segments intersection detection library
  ☆280Updated 8 months ago
• uber-archive / viewport-mercator-project
  NOTE: The viewport-mercator-project repo is archived and code has moved to
  ☆140Updated 6 years ago
• d3 / d3-path
  Serialize Canvas path commands to SVG.
  ☆195Updated 2 years ago
• rowanwins / point-in-polygon-hao
  A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…
  ☆146Updated 3 months ago
• w8r / martinez
  Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…
  ☆749Updated 3 months ago
• scijs / ndarray
  📈 Multidimensional arrays for JavaScript
  ☆1,239Updated 3 years ago
• w8r / GreinerHormann
  Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…
  ☆244Updated 2 years ago
• mikolalysenko / robust-point-in-polygon
  Exactly test if a point is inside, outside or on the boundary of a polygon
  ☆249Updated 2 years ago
• mourner / rbush
  RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
  ☆2,654Updated last year
• w8r / avl
  Fast AVL tree for Node and browser
  ☆118Updated 3 weeks ago