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.
  ☆588Updated 8 months ago
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆310Updated 4 years ago
• jcoglan / sylvester
  Vector, matrix and geometry math JavaScript
  ☆1,160Updated 6 years ago
• mikolalysenko / cdt2d
  2D constrained Delaunay triangulation
  ☆257Updated 6 years ago
• mourner / kdbush
  A fast static index for 2D points
  ☆675Updated 2 months ago
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆234Updated 2 years ago
• darkskyapp / delaunay-fast
  Fast Delaunay Triangulation in JavaScript.
  ☆780Updated 8 years ago
• scijs / ndarray
  📈 Multidimensional arrays for JavaScript
  ☆1,238Updated 3 years ago
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆225Updated last year
• brendankenny / libtess.js
  Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.
  ☆303Updated 9 years ago
• w8r / polygon-offset
  Small lib for polygon offsetting(margin/padding)
  ☆261Updated 2 years ago
• w8r / GreinerHormann
  Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…
  ☆243Updated 2 years ago
• mourner / robust-predicates
  Fast robust predicates for computational geometry in JavaScript
  ☆321Updated this week
• maxkueng / victor
  A JavaScript 2D vector class with methods for common vector operations
  ☆841Updated 2 years ago
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆601Updated last year
• d3 / d3-voronoi
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆251Updated 6 years ago
• mikolalysenko / vectorize-text
  Turns a text string into a 2D poly line
  ☆317Updated last year
• mikolalysenko / delaunay-triangulate
  Easy to use robust Delaunay triangulation
  ☆160Updated 11 years ago
• w8r / martinez
  Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…
  ☆747Updated 3 months ago
• mapbox / concaveman
  A very fast 2D concave hull algorithm in JavaScript
  ☆703Updated 3 months ago
• thelonious / kld-intersections
  A library of intersection algorithms covering all SVG shape types
  ☆358Updated last year
• r3mi / poly2tri.js
  A 2D constrained Delaunay triangulation library
  ☆338Updated 6 years ago
• d3 / d3-delaunay
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆645Updated last year
• collinhover / threeoctree
  (sparse + dynamic) 3D spatial representation structure for fast searches
  ☆226Updated 3 years ago
• velipso / polybooljs
  Boolean operations on polygons (union, intersection, difference, xor)
  ☆621Updated last year
• anvaka / isect
  Segments intersection detection library
  ☆280Updated 7 months ago
• gorhill / Javascript-Voronoi
  A Javascript implementation of Fortune's algorithm to compute Voronoi cells
  ☆1,056Updated 2 years ago
• mattdesl / three-line-2d
  lines expanded in a vertex shader
  ☆247Updated 4 years ago
• mapbox / potpack
  A tiny rectangle packing JavaScript library (for sprite layouts)
  ☆343Updated 3 months ago
• osuushi / Smooth.js
  Turn arrays into smooth functions.
  ☆527Updated 3 years ago