Computes the convex hull of a given set of points using the Quick Hull algorithm.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Robust 2D convex hull algorithm
Operations for two-dimensional polygons.
Creates a convex hull around points
Monotone Chain Convex Hull algorithm
Incremental n-dimensional convex hull algorithm
TypeScript definitions for concaveman
Any dimensional convex hull
Fast 2D convex hull (Graham Scan)
A high-performance JavaScript 2D convex hull library
Finds the affine hull of a point set
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
TypeScript definitions for d3-polygon
gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm
Creates a concave hull around points.
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
A quickhull implementation for 3d points
A pure-JS implementation of the W3C's Canvas-2D Context API that can run on top of either Expo Graphics or a browser WebGL context.
simplex-noise is a fast simplex noise implementation in Javascript. Works in node and in the browser.
A Typescript library for generating multidimensional convex hulls and delaunay triangulations.
TypeScript definitions for delaunator
React component for 2D, 3D, VR and AR force directed graphs
Lightweight, beautiful and user-friendly prompts