Convex Packages

Robust 2D convex hull algorithm

Incremental n-dimensional convex hull algorithm

Any dimensional convex hull

Computes the closest point to a polytope in arbitrary dimensions

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

Convex decomposition for 2D polygons

An algorithm to decompose polygons with holes from "A practical algorithm for decomposing polygonal domains into convex polygons by diagonals" by J Fernández

2D/3D convex polygon tessellators

Fast 2D convex hull (Graham Scan)

2D polygon clipping / offsetting (Sutherland-Hodgeman, Grainer-Hormann)

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

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.

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

Any dimensional Minkowski sums of convex polytopes

A package to find the area weighted center of a convex polygon whose mass is evenly distributed across the surface.

Determines wheather a point is in side geojson polygons

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