Convex Hull
✓ Published0🌍 Public
Mmbostock
Last edited Feb 9, 2016
Created on Dec 8, 2015
A set of one hundred normally distributed points is enclosed by their convex hull, a steel-blue polygon computed with Andrew’s monotone chain algorithm via the `d3-polygon` `hull` function. As the mouse moves, the first point is repositioned and the hull is recomputed in real time. The visualization is drawn on a Canvas using the standard `canvas` API, with the underlying point set generated by `d3-random.normal` from the `d3-random` library.
AI-generated descriptionAndrew’s monotone chain algorithm computes the convex hull of a set of two-dimensional points.
gpl-3.0 Licensed