The smallest convex shape wrapping a cloud of points — the rubber-band boundary. A cornerstone of computational geometry, collision detection, and GIS.
Convex HullLive
Andrew's monotone chain
Controls
Presets
The convex hull is the smallest convex polygon containing every point — the shape a rubber band snaps to. Drag any point on the canvas to reshape the set and watch the hull recompute live. Computed here with Andrew's monotone-chain algorithm in O(n log n).
★ Sign in to save this setupSave your tuned setup, or drop this simulation into your own site, docs, or course page.
How it works
Andrew's monotone-chain algorithm sorts the points, then sweeps once to build the lower boundary and once for the upper, discarding any point that would make a concave turn. The result is the convex hull in O(n log n) time, dominated by the sort.
✦
Ask the AI about this model
The math, the assumptions, real-world uses, or a code translation — explained for this exact simulation.
Yes. Convex Hull runs entirely in your browser using your device's own compute, so local use is free forever. You only pay Compute Tokens if you scale a job to the cloud.
Do I need to install anything?▾
No. Everything runs client-side in a modern browser — no downloads, no license, no account required to start.
Can I save or share my simulation?▾
Create a free account to save projects, and use a shareable embed or minted DOI to publish a live, interactive version anywhere.
How accurate are the results?▾
The solver uses established numerical methods, but results are for research and educational purposes and should be validated against experiment or professional review before you rely on them.