Incremental n-dimensional convex hull algorithm
Computes the convex hull of a collection of points in general position by incremental insertion. No attempt is made to handle degeneracies.
This module is meant to be used internally by other modules for calculating convex hulls and Delaunay triangulations. You probably shouldn't call it directly unless you know what you are doing. Instead, there will (eventually) be a wrapper over this module that handles all the special cases and correctly generates a convex hull.
var ch =var points =0 0 00 0 10 1 01 0 01 1 1console
0 2 31 0 30 1 22 4 34 1 31 4 2
npm install incremental-convex-hull
Constructs a triangulation of the convex hull of
points by incremental insertion.
pointsis a list of points
randomInsertis a flag, which if set uses a randomized jump and walk instead of walking from the last inserted facet.
Returns A list of the boundary cells of the convex hull of the point cloud.
Notes This module works in any dimension greater than 2, though becomes pretty slow after 5d.
(c) 2014 Mikola Lysenko. MIT License