Algorithm

Graham scan — O(n log n) Jarvis march — O(n·h) Quickhull — O(n log n) avg

Points N: 40 Preset shape

Speed: 6 steps/s

Show cross products / turns Show hull numbers

Stats

AlgorithmGraham

Points N40

Hull size h0

Cross-products0

Stack / queue0

ComplexityO(n log n)

Compare

Graham CP—

Jarvis CP—

Quickhull CP—

Click empty space to add a point. Click and drag a point to move it. The convex hull is the smallest convex polygon enclosing all points; the algorithms differ in how they discover its boundary.