Calculates a series of convex hulls for periods of timestamped 2D point data
Incremental n-dimensional convex hull algorithm
Any dimensional convex hull
Robust 2D convex hull algorithm
Function that finds the convex hull of a set of points via the Graham Scan algorithm.
Computes the closest point to a polytope in arbitrary dimensions
Monotone Chain Convex Hull algorithm
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
2D convex polygon clipping (Sutherland-Hodgeman)
2D/3D convex polygon tessellators
Clean polygon or polyline coordinates: remove duplicates, collinear or degenerate segments, holes, trim etc.
A package to find the area weighted center of a convex polygon whose mass is evenly distributed across the surface.
Convex decomposition for 2D polygons
Determines wheather a point is in side geojson polygons
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
Any dimensional Minkowski sums of convex polytopes
turf boolean-concave module
Finds the boundary of a convex polytope formed by the intersection of halfspaces