Alternatives and similar repositories for kd-tree-javascript

Users that are interested in kd-tree-javascript are comparing it to the libraries listed below

• andriiheonia / hull
  This repository is deprecated and no longer maintained.
  ☆591Updated 5 months ago
• mourner / kdbush
  A fast static index for 2D points
  ☆666Updated 10 months ago
• jcoglan / sylvester
  Vector, matrix and geometry math JavaScript
  ☆1,163Updated 6 years ago
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆310Updated 4 years ago
• mikolalysenko / cdt2d
  2D constrained Delaunay triangulation
  ☆253Updated 6 years ago
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆223Updated 10 months ago
• brendankenny / libtess.js
  Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.
  ☆302Updated 9 years ago
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆587Updated last year
• w8r / martinez
  Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…
  ☆738Updated last week
• w8r / polygon-offset
  Small lib for polygon offsetting(margin/padding)
  ☆260Updated 2 years ago
• mapbox / concaveman
  A very fast 2D concave hull algorithm in JavaScript
  ☆695Updated 2 weeks ago
• osuushi / Smooth.js
  Turn arrays into smooth functions.
  ☆527Updated 3 years ago
• scijs / ndarray
  📈 Multidimensional arrays for JavaScript
  ☆1,231Updated 3 years ago
• mikolalysenko / vectorize-text
  Turns a text string into a 2D poly line
  ☆316Updated last year
• w8r / GreinerHormann
  Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…
  ☆242Updated 2 years ago
• mourner / flatbush
  A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
  ☆1,489Updated 2 weeks ago
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆232Updated last year
• darkskyapp / delaunay-fast
  Fast Delaunay Triangulation in JavaScript.
  ☆780Updated 8 years ago
• r3mi / poly2tri.js
  A 2D constrained Delaunay triangulation library
  ☆335Updated 6 years ago
• mourner / rbush
  RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
  ☆2,602Updated 10 months ago
• schteppe / poly-decomp.js
  Decompose 2D polygons into convex pieces.
  ☆452Updated last year
• maxkueng / victor
  A JavaScript 2D vector class with methods for common vector operations
  ☆839Updated last year
• collinhover / threeoctree
  (sparse + dynamic) 3D spatial representation structure for fast searches
  ☆225Updated 3 years ago
• d3 / d3-voronoi
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆251Updated 5 years ago
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆178Updated 2 weeks ago
• velipso / polybooljs
  Boolean operations on polygons (union, intersection, difference, xor)
  ☆620Updated last year
• thelonious / kld-intersections
  A library of intersection algorithms covering all SVG shape types
  ☆353Updated last year
• mikolalysenko / delaunay-triangulate
  Easy to use robust Delaunay triangulation
  ☆160Updated 11 years ago
• mourner / tinyqueue
  The smallest and simplest priority queue in JavaScript.
  ☆451Updated last year
• alexbol99 / flatten-js
  Javascript library for 2d geometry
  ☆598Updated 10 months ago