Computes the convex hull of a given set of points using the Quick Hull algorithm.

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

Incremental n-dimensional convex hull algorithm

Monotone Chain Convex Hull algorithm

Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.

Robust 2D convex hull algorithm

Any dimensional convex hull

Finds the affine hull of a point set

Computes the convex hull of a set allowing for possible lower dimensional degeneracies

TypeScript definitions for d3-polygon

A quickhull implementation for 3d points

Fast 2D convex hull (Graham Scan)

Creates a concave hull around points.

TypeScript definitions for concaveman

TypeScript definitions for delaunator

TypeScript definitions for hull.js

A Node.js client for hull.io

Simple “Least Recently Used” (LRU) cache