41 packages found
Polygon convex partitioning and triangulation.
Merge solid polygons and decompose into convexes.
Function that finds the convex hull of a set of points via the Graham Scan algorithm.
Clean polygon or polyline coordinates: remove duplicates, collinear or degenerate segments, holes, trim etc.
Calculates a series of convex hulls for periods of timestamped 2D point data
Any dimensional convex hull
Incremental n-dimensional convex hull algorithm
Merge non continuous geojson polygons into multiples concave polygons based on polygons distance.
Monotone Chain Convex Hull algorithm
Robust 2D convex hull algorithm
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
Computes the closest point to a polytope in arbitrary dimensions
Computes the convex hull of a set allowing for possible lower dimensional degeneracies
Convex decomposition for 2D polygons
An algorithm to decompose polygons with holes from "A practical algorithm for decomposing polygonal domains into convex polygons by diagonals" by J Fernández
Any dimensional Minkowski sums of convex polytopes
2D/3D convex polygon tessellators
2D polygon clipping / offsetting (Sutherland-Hodgeman, Grainer-Hormann)