Operations for two-dimensional polygons.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Creates a convex hull around points
Monotone Chain Convex Hull algorithm
Incremental n-dimensional convex hull algorithm
Robust 2D convex hull algorithm
Any dimensional convex hull
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
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
TypeScript definitions for concaveman
Creates a concave hull around points.
TypeScript definitions for delaunator
Fast 2D convex hull (Graham Scan)
Hull Connector Archetype (Uses Builder)
[](https://discord.gg/poimandres)
TypeScript definitions for hull.js
A Node.js client for hull.io
A quickhull implementation for 3d points
A pure javascript implementation of the QuickHull algorithm for finding the smallest polygon enclosing a set of points
gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm
Very old version of hull.js with backported security fixes -- do not use in new projects
Spherical Voronoi Diagram and Delaunay Triangulation
Hull primitives for the RustUse geometry workspace
Facade crate for the RustUse geometry workspace.