Any dimensional convex hull

Creates a convex hull around points

Robust 2D convex hull algorithm

Incremental n-dimensional convex hull algorithm

Monotone Chain Convex Hull algorithm

Creates a concave hull around points.

Finds the affine hull of a point set

Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)

Fast 2D convex hull (Graham Scan)

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

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

Hull Connector Archetype (Uses Builder)

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

Convex hull computation algorithms

gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm

A high-performance JavaScript 2D convex hull library

Workable refactoring into a module of a concave hull algorithm.

Hull Connector Archetype (Uses Builder) (Development)

Calculate the convex hull for a set of latitudes and longitudes.

Hull is an AI coding agent for the terminal.