Alternatives and similar repositories for density-clustering

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

• harthur / clustering
  K-means and hierarchical clustering
  ☆510Updated 3 years ago
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆225Updated last year
• mljs / hclust
  Hierarchical clustering in JavaScript
  ☆57Updated 3 years ago
• solzimer / skmeans
  Super fast simple k-means implementation for unidimiensional and multidimensional data.
  ☆76Updated 2 years ago
• andriiheonia / hull
  This repository is deprecated and no longer maintained.
  ☆588Updated 8 months ago
• ubilabs / kd-tree-javascript
  JavaScript k-d Tree Implementation
  ☆653Updated last year
• errcw / gaussian
  A JavaScript model of the normal distribution
  ☆183Updated 2 years ago
• philogb / mingle
  A JS implementation of the MINGLE edge bundling algorithm
  ☆205Updated 10 years ago
• mikolalysenko / robust-point-in-polygon
  Exactly test if a point is inside, outside or on the boundary of a polygon
  ☆249Updated 2 years ago
• mljs / pca
  Principal component analysis
  ☆101Updated last year
• math-utils / hierarchical-clustering
  Hierarchical clustering
  ☆27Updated 9 years ago
• mikolalysenko / static-kdtree
  A static kdtree data structure
  ☆310Updated 4 years ago
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆182Updated 3 months ago
• albertorestifo / node-dijkstra
  A NodeJS implementation of Dijkstra's algorithm
  ☆160Updated last month
• pelias / polygon-lookup
  Fast point-in-polygon intersection for large numbers of polygons.
  ☆73Updated 2 months ago
• upphiminn / jDBSCAN
  Javascript DBSCAN – Spatial and temporal (GPS location) data ready!
  ☆84Updated 4 years ago
• brian3kb / graham_scan_js
  An implementation of the Graham's Scan Convex Hull algorithm in JavaScript.
  ☆117Updated 2 years ago
• fpirsch / vptree.js
  Javascript implementation of the Vantage-Point Tree nearest neighbor search algorithm
  ☆162Updated 3 years ago
• NathanEpstein / clusters
  k-means clustering in Javascript
  ☆112Updated 10 years ago
• mikolalysenko / vectorize-text
  Turns a text string into a 2D poly line
  ☆317Updated last year
• mourner / quickselect
  A fast selection algorithm in JavaScript.
  ☆96Updated last year
• w8r / polygon-offset
  Small lib for polygon offsetting(margin/padding)
  ☆261Updated 2 years ago
• tinker10 / D3-Labeler
  D3 plug-in for automatic label placement using simulated annealing.
  ☆224Updated 7 years ago
• Philmod / node-kmeans
  Node.js asynchronous implementation of the clustering algorithm k-means.
  ☆101Updated 2 years ago
• bpostlethwaite / colormap
  output rgb or hex colormaps
  ☆238Updated 3 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
• BorisChumichev / everpolate
  Numerical interpolation and extrapolation lib
  ☆115Updated 4 years ago
• morganherlocker / cubic-spline
  interpolate for X in a 2d array
  ☆100Updated 2 years ago
• mapbox / timespace
  compute fuzzy local time from a location
  ☆70Updated last year
• emeeks / d3-bboxCollide
  Bounding box collision detection for forceSimulation in d3v4
  ☆100Updated 4 years ago