Search results
50 packages found
Function that finds the convex hull of a set of points via the Graham Scan algorithm.
Client for the Convex Cloud
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
Gomjau-hogg notation tessellations of regular polygons
gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm
Any dimensional convex hull
A collection of useful code to complement the official convex package.
Computes the closest point to a polytope in arbitrary dimensions
Convex hull algorithms in R^2 code bricks for JavaScript
Robust 2D convex hull algorithm
Clean polygon or polyline coordinates: remove duplicates, collinear or degenerate segments, holes, trim etc.
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
Merge non continuous geojson polygons into multiples concave polygons based on polygons distance.
Any dimensional Minkowski sums of convex polytopes
Polygon convex partitioning and triangulation.
A JS mock of the Convex backend for testing your Convex functions.
Merge solid polygons and decompose into convexes.