Math
Convex hull
Construct convex hulls with Jarvis wrapping, Graham scan and QuickHull, add points and compare orientation-test counts.
Try this
Click to add a point. Compare three exact orientation-based algorithms on the same seed. The animation reveals the computed boundary; the counter records orientation tests during computation.
Equations used in the module
Equations orient(A,B,C) = (Bx−Ax)(Cy−Ay) − (By−Ay)(Cx−Ax) Jarvis: O(nh); Graham: O(n log n) QuickHull recursively selects the farthest exterior point Area = ½ |Σ(xᵢyᵢ₊₁ − yᵢxᵢ₊₁)|
