Search results
23 packages found
Function that finds the convex hull of a set of points via the Graham Scan algorithm.
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
Incremental n-dimensional convex hull algorithm
Monotone Chain Convex Hull algorithm
gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm
Any dimensional convex hull
Convex hull algorithms in R^2 code bricks for JavaScript
Robust 2D convex hull algorithm
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
Fast 2D convex hull (Graham Scan)
Implements Graham's Scan for finding the convex hull of a set of 2D vertices.
Voxelized hierarchical approximate convex mesh decomposition
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
Any dimensional alpha shape computation
Calculate the convex hull for a set of latitudes and longitudes.
A port of qhull to JavaScript
Implementation of Graham's Scan with a visualizer.
Fast implementation of the graham scan algorithm