Search npm for packages to use with Deno

Operations for two-dimensional polygons.

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

Finds the affine hull of a point set

Robust 2D convex hull algorithm

Any dimensional convex hull

Incremental n-dimensional convex hull algorithm

Any dimensional alpha shape computation

Monotone Chain Convex Hull algorithm

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

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

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

Voxelized hierarchical approximate convex mesh decomposition

Fast 2D convex hull (Graham Scan)

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

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

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

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

Hull Connector Archetype (Uses Builder)

Hull Connector Archetype (Uses Builder) (Development)

Calculates convex hull for the set of 2d points