44 packages found
Function that finds the convex hull of a set of points via the Graham Scan algorithm.
Monotone Chain Convex Hull algorithm
Any dimensional convex hull
Merge non continuous geojson polygons into multiples concave polygons based on polygons distance.
Incremental n-dimensional convex hull algorithm
gets the convex hull of 2D points using the "gift-wrapping" (AKA "Jarvis march") algorithm
Voxelized hierarchical approximate convex mesh decomposition
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
Robust 2D convex hull algorithm
Computes the closest point to a polytope in arbitrary dimensions
Client for the Convex Cloud
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
Convex decomposition for 2D polygons
Clean polygon or polyline coordinates: remove duplicates, collinear or degenerate segments, holes, trim etc.
Polygon convex partitioning and triangulation.
Any dimensional Minkowski sums of convex polytopes
Finds the boundary of a convex polytope formed by the intersection of halfspaces
Merge solid polygons and decompose into convexes.