Hull Packages

Operations for two-dimensional polygons.

Robust 2D convex hull algorithm

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

Incremental n-dimensional convex hull algorithm

Any dimensional convex hull

Finds the affine hull of a point set

Any dimensional alpha shape computation

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

Monotone Chain Convex Hull algorithm

Fast 2D convex hull (Graham Scan)

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

Hull Connector Archetype (Uses Builder)

Hull Connector Archetype (Uses Builder) (Development)

Function that finds the convex hull of a set of points via the Graham Scan algorithm.

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

Finds a basis for the affine complement of a set of points

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

Calculates a series of convex hulls for periods of timestamped 2D point data

Calculate the outer hull of a 2d matrix of same size, touching squares

Computational Geometry Algorithms in Javascript!