Alternatives and similar repositories for density-clustering

Users that are interested in density-clustering are comparing it to the libraries listed below

• solzimer / skmeans
  Super fast simple k-means implementation for unidimiensional and multidimensional data.
  ☆76Updated 2 years ago
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆225Updated last week
• harthur / clustering
  K-means and hierarchical clustering
  ☆512Updated 3 years ago
• mljs / hclust
  Hierarchical clustering in JavaScript
  ☆57Updated 3 years ago
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆182Updated 4 months ago
• errcw / gaussian
  A JavaScript model of the normal distribution
  ☆183Updated 2 years ago
• andriiheonia / hull
  This repository is deprecated and no longer maintained.
  ☆588Updated 9 months ago
• albertorestifo / node-dijkstra
  A NodeJS implementation of Dijkstra's algorithm
  ☆160Updated 2 weeks ago
• ubilabs / kd-tree-javascript
  JavaScript k-d Tree Implementation
  ☆654Updated 2 years ago
• brian3kb / graham_scan_js
  An implementation of the Graham's Scan Convex Hull algorithm in JavaScript.
  ☆117Updated 2 years ago
• seabre / simplify-geometry
  Simplify geometry using the Ramer–Douglas–Peucker algorithm.
  ☆79Updated 10 years ago
• upphiminn / jDBSCAN
  Javascript DBSCAN – Spatial and temporal (GPS location) data ready!
  ☆84Updated 4 years ago
• mourner / quickselect
  A fast selection algorithm in JavaScript.
  ☆96Updated this week
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆310Updated 4 years ago
• mikolalysenko / robust-point-in-polygon
  Exactly test if a point is inside, outside or on the boundary of a polygon
  ☆250Updated 2 years ago
• darkskyapp / sphere-knn
  Find the k nearest neighbors for points on a sphere.
  ☆123Updated 5 years ago
• mikolalysenko / contour2d
  Extracts a rectilinear polygon contour from a binary image
  ☆25Updated 11 years ago
• anvaka / ngraph.graph
  Graph data structure in JavaScript
  ☆564Updated this week
• mourner / tinyqueue
  The smallest and simplest priority queue in JavaScript.
  ☆459Updated this week
• morganherlocker / cubic-spline
  interpolate for X in a 2d array
  ☆100Updated 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…
  ☆245Updated 2 years ago
• philogb / mingle
  A JS implementation of the MINGLE edge bundling algorithm
  ☆205Updated 10 years ago
• mljs / pca
  Principal component analysis
  ☆101Updated last year
• Philmod / node-kmeans
  Node.js asynchronous implementation of the clustering algorithm k-means.
  ☆101Updated 2 years ago
• bpostlethwaite / colormap
  output rgb or hex colormaps
  ☆239Updated 3 years ago
• fpirsch / vptree.js
  Javascript implementation of the Vantage-Point Tree nearest neighbor search algorithm
  ☆162Updated 3 years ago
• mapbox / timespace
  compute fuzzy local time from a location
  ☆71Updated last year
• pelias / polygon-lookup
  Fast point-in-polygon intersection for large numbers of polygons.
  ☆73Updated 2 months ago
• d3 / d3-quadtree
  Two-dimensional recursive spatial subdivision.
  ☆234Updated 2 years ago
• mapbox / point-geometry
  A standalone point geometry primitive.
  ☆36Updated last year