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.
  ☆592Updated 2 months ago
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆309Updated 4 years ago
• mikolalysenko / cdt2d
  2D constrained Delaunay triangulation
  ☆245Updated 5 years ago
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆217Updated 6 months ago
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆232Updated last year
• mourner / kdbush
  A fast static index for 2D points
  ☆653Updated 6 months ago
• mikolalysenko / vectorize-text
  Turns a text string into a 2D poly line
  ☆315Updated last year
• jcoglan / sylvester
  Vector, matrix and geometry math JavaScript
  ☆1,161Updated 5 years ago
• scijs / ndarray
  📈 Multidimensional arrays for JavaScript
  ☆1,226Updated 3 years ago
• brendankenny / libtess.js
  Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.
  ☆297Updated 9 years ago
• d3 / d3-voronoi
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆250Updated 5 years ago
• mapbox / concaveman
  A very fast 2D concave hull algorithm in JavaScript
  ☆666Updated 2 years ago
• mourner / tinyqueue
  The smallest and simplest priority queue in JavaScript.
  ☆445Updated 9 months ago
• mourner / robust-predicates
  Fast robust predicates for computational geometry in JavaScript
  ☆308Updated 9 months ago
• mapbox / potpack
  A tiny rectangle packing JavaScript library (for sprite layouts)
  ☆326Updated 9 months ago
• mourner / flatbush
  A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
  ☆1,467Updated last month
• collinhover / threeoctree
  (sparse + dynamic) 3D spatial representation structure for fast searches
  ☆223Updated 3 years ago
• r3mi / poly2tri.js
  A 2D constrained Delaunay triangulation library
  ☆332Updated 6 years ago
• mapbox / earcut
  The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
  ☆2,289Updated 2 weeks ago
• thelonious / kld-intersections
  A library of intersection algorithms covering all SVG shape types
  ☆352Updated last year
• w8r / polygon-offset
  Small lib for polygon offsetting(margin/padding)
  ☆253Updated 2 years ago
• hiddentao / linear-algebra
  Efficient, high-performance linear algebra for node.js and browsers
  ☆166Updated 4 years ago
• darkskyapp / delaunay-fast
  Fast Delaunay Triangulation in JavaScript.
  ☆782Updated 7 years ago
• stackgl / headless-gl
  🎃 Windowless WebGL for node.js
  ☆1,801Updated last week
• w8r / GreinerHormann
  Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…
  ☆240Updated 2 years ago
• tsherif / picogl.js
  A minimal WebGL 2 rendering library
  ☆792Updated 2 years ago
• mikolalysenko / robust-point-in-polygon
  Exactly test if a point is inside, outside or on the boundary of a polygon
  ☆245Updated 2 years ago
• w8r / martinez
  Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…
  ☆721Updated 8 months ago
• uhho / density-clustering
  Density Based Clustering in JavaScript
  ☆219Updated 5 years ago
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆578Updated 11 months ago