Alternatives and similar repositories for hull

Users that are interested in hull are comparing it to the libraries listed below

• ubilabs / kd-tree-javascript
  JavaScript k-d Tree Implementation
  ☆652Updated last year
• 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
• w8r / polygon-offset
  Small lib for polygon offsetting(margin/padding)
  ☆261Updated 2 years ago
• mikolalysenko / cdt2d
  2D constrained Delaunay triangulation
  ☆256Updated 6 years ago
• brendankenny / libtess.js
  Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.
  ☆302Updated 9 years ago
• mfogel / polygon-clipping
  Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.
  ☆598Updated last year
• w8r / martinez
  Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…
  ☆746Updated 2 months ago
• mapbox / concaveman
  A very fast 2D concave hull algorithm in JavaScript
  ☆703Updated 2 months ago
• mourner / kdbush
  A fast static index for 2D points
  ☆673Updated last month
• junmer / clipper-lib
  Boolean operations and offsetting library in Javascript
  ☆198Updated 2 years ago
• mourner / rbush-knn
  k-nearest neighbors search (KNN) for RBush
  ☆225Updated last year
• thelonious / kld-intersections
  A library of intersection algorithms covering all SVG shape types
  ☆355Updated last year
• mapbox / lineclip
  A very fast JavaScript polyline and polygon clipping library
  ☆182Updated 2 months ago
• r3mi / poly2tri.js
  A 2D constrained Delaunay triangulation library
  ☆337Updated 6 years ago
• alexbol99 / flatten-js
  Javascript library for 2d geometry
  ☆612Updated last week
• mikolalysenko / vectorize-text
  Turns a text string into a 2D poly line
  ☆317Updated last year
• mattdesl / three-line-2d
  lines expanded in a vertex shader
  ☆247Updated 4 years ago
• collinhover / threeoctree
  (sparse + dynamic) 3D spatial representation structure for fast searches
  ☆226Updated 3 years ago
• d3 / d3-voronoi
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆251Updated 6 years ago
• uber-web / math.gl
  A 3D/WebGL math library
  ☆420Updated last year
• d3 / d3-contour
  Compute contour polygons using marching squares.
  ☆514Updated 10 months ago
• mikolalysenko / monotone-convex-hull-2d
  Robust and fast 2D convex hull
  ☆51Updated 3 years ago
• mourner / robust-predicates
  Fast robust predicates for computational geometry in JavaScript
  ☆320Updated last year
• mattdesl / polyline-normals
  gets miter normals for a 2D polyline
  ☆140Updated last year
• mattdesl / extrude-polyline
  triangulates a 2D polyline into a stroke
  ☆178Updated 6 years ago
• RaumZeit / MarchingSquares.js
  A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation
  ☆173Updated 4 years ago
• Doodle3D / clipper-js
  Clipper Abstraction (simplified API)
  ☆129Updated 2 years ago
• d3 / d3-delaunay
  Compute the Voronoi diagram of a set of two-dimensional points.
  ☆645Updated last year
• mikolalysenko / robust-point-in-polygon
  Exactly test if a point is inside, outside or on the boundary of a polygon
  ☆249Updated 2 years ago
• velipso / polybooljs
  Boolean operations on polygons (union, intersection, difference, xor)
  ☆621Updated last year