Search results
36 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.
Monotone Chain Convex Hull algorithm
Incremental n-dimensional convex hull algorithm
gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm
Operations for two-dimensional polygons.
Any dimensional convex hull
Convex hull algorithms in R^2 code bricks for JavaScript
Robust 2D convex 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
Finds the affine hull of a point set
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Implements Graham's Scan for finding the convex hull of a set of 2D vertices.
Fast 2D convex hull (Graham Scan)
Voxelized hierarchical approximate convex mesh decomposition
A Typescript library for generating multidimensional convex hulls and delaunay triangulations.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Calculate the outer hull of a 2d matrix of same size, touching squares