mikolalysenko/incremental-convex-hu...

This is a low-level JavaScript module that implements an incremental convex hull algorithm for computing the convex hull of points in general position by incremental insertion. It's designed for use by other computational geometry modules and handles arbitrary dimensions, though performance degrades beyond 5D. The module is not meant for direct use by most developers, as it doesn't handle degeneracies and is intended as an internal building block for more complete convex hull and Delaunay triangulation implementations.