Search results
50 packages found
turf boolean-concave module
Implements Graham's Scan for finding the convex hull of a set of 2D vertices.
Convex decomposition for 2D polygons
Finds the boundary of a convex polytope formed by the intersection of halfspaces
2D/3D convex polygon tessellators
2D polygon clipping / offsetting (Sutherland-Hodgeman, Grainer-Hormann)
Fast 2D convex hull (Graham Scan)
Voxelized hierarchical approximate convex mesh decomposition
Relations, default values, unique fields, RLS for Convex
Computes the convex hull of a given set of points using the Quick Hull algorithm.
Convex decomposition for 2D polygons
Calculates a series of convex hulls for periods of timestamped 2D point data
Any dimensional alpha shape computation
An algorithm to decompose polygons with holes from "A practical algorithm for decomposing polygonal domains into convex polygons by diagonals" by J Fernández
A port of qhull to JavaScript
Core code used by [convex](https://www.npmjs.com/package/convex).
Implementation of Graham's Scan with a visualizer.
Fast implementation of the graham scan algorithm
Calculate the convex hull for a set of latitudes and longitudes.