Hedra
Wrap the points in their tightest shape.
What it is
Hedra is a computational-geometry toolkit that wraps a set of points in their tightest enclosing shape and answers related spatial questions. The signature technique is Andrew's monotone-chain convex hull, with shoelace area, point-in-polygon, and segment intersection all derived from the cross product, plus a property-based fuzz test proving the hull is convex, encloses every point, and is minimal. It is a from-scratch, dependency-light build you can download and run locally.
Andrew's monotone-chain hull, shoelace area, point-in-polygon, and segment intersection - all from the cross product. 13 tests, including a property-based fuzz that the hull is convex, encloses every point, and is minimal.
What's inside
The full source, the tests, and CI. Open it, read it, change it. A zero-dependency core, free, in the MIT spirit.
Run it after unzip
pnpm install && pnpm dev