Do I need to install anything?

No. It runs in any modern browser, free, with no account required.

For K-12 Students · Convex Hull

Convex Hull for a decision tree

Built for k-12 students learning it in middle or high school. Watch the idea come alive with plain-language steps and everyday examples — perfect for projects and homework. Simulate a decision tree live below — adjust the inputs and watch it respond, right in your browser.

Convex HullLive

Andrew's monotone chain

Controls

Presets

Points

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).

▶ Run in Python

Data Inspector

Points30

Hull vertices0

ComplexityO(n log n)

Governing equation

(a - o) \times (b - o) \leq 0 \Rightarrow pop; h = 0 of 30

Reading this result: Add points and a boundary polygon appears — the hull is the smallest convex shape wrapping them all.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

Also for:Students Researchers Educators Engineers Hobbyists & Makers First Responders General version →

More with Convex Hull

Convex Hull for a neural network Convex Hull for a sorting algorithm Convex Hull for a search tree Convex Hull for a hash table Convex Hull for a recommendation engine Convex Hull for an image classifier Convex Hull for a chatbot Convex Hull for a pathfinding AI

Frequently asked questions

Is this good for k-12 students?: Yes — this version of "Convex Hull for a decision tree" is framed for k-12 students learning it in middle or high school. Watch the idea come alive with plain-language steps and everyday examples — perfect for projects and homework.
Do I need to install anything?: No. It runs in any modern browser, free, with no account required.