Alternatives and similar repositories for kd-tree-javascript:

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

• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆219Updated 7 months ago
• mourner / kdbush
  A fast static index for 2D points
  ☆655Updated 7 months ago
• w8r / martinez
  Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…
  ☆725Updated 9 months ago
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆309Updated 4 years ago
• andriiheonia / hull
  This repository is deprecated and no longer maintained.
  ☆591Updated 3 months ago
• 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
• mikolalysenko / cdt2d
  2D constrained Delaunay triangulation
  ☆246Updated 5 years ago
• r3mi / poly2tri.js
  A 2D constrained Delaunay triangulation library
  ☆332Updated 6 years ago
• scijs / ndarray
  📈 Multidimensional arrays for JavaScript
  ☆1,227Updated 3 years ago
• brendankenny / libtess.js
  Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.
  ☆298Updated 9 years ago
• w8r / polygon-offset
  Small lib for polygon offsetting(margin/padding)
  ☆256Updated 2 years ago
• mourner / tinyqueue
  The smallest and simplest priority queue in JavaScript.
  ☆446Updated 10 months ago
• velipso / polybooljs
  Boolean operations on polygons (union, intersection, difference, xor)
  ☆618Updated last year
• jcoglan / sylvester
  Vector, matrix and geometry math JavaScript
  ☆1,161Updated 5 years ago
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆232Updated last year
• mapbox / concaveman
  A very fast 2D concave hull algorithm in JavaScript
  ☆666Updated 2 years ago
• alexbol99 / flatten-js
  Javascript library for 2d geometry
  ☆587Updated 7 months ago
• mapbox / earcut
  The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
  ☆2,294Updated last month
• mourner / flatbush
  A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
  ☆1,469Updated last month
• thelonious / kld-intersections
  A library of intersection algorithms covering all SVG shape types
  ☆352Updated last year
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆176Updated 2 years ago
• mourner / robust-predicates
  Fast robust predicates for computational geometry in JavaScript
  ☆308Updated 10 months ago
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆582Updated last year
• timohausmann / quadtree-js
  A lightweight quadtree implementation for javascript
  ☆630Updated last year
• mikolalysenko / vectorize-text
  Turns a text string into a 2D poly line
  ☆315Updated last year
• collinhover / threeoctree
  (sparse + dynamic) 3D spatial representation structure for fast searches
  ☆223Updated 3 years ago
• uber-web / math.gl
  A 3D/WebGL math library
  ☆414Updated last year
• mikolalysenko / delaunay-triangulate
  Easy to use robust Delaunay triangulation
  ☆160Updated 10 years ago
• mourner / rbush
  RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
  ☆2,563Updated 7 months ago
• d3 / d3-voronoi
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆250Updated 5 years ago