Convex Hull Arena

This visualisation uses AI Generated code, finetuned for the best visualisation, not code quality

convexhull.mov

Interactive Raylib arena for comparing convex hull algorithms such as Graham Scan, Monotonic Chain, and QuickHull on the same point set.

What This Visualisation Shows

• How each algorithm decides which points belong on the outer envelope
• How turn tests and recursive or stack-based decisions shape the hull
• Why different hull algorithms feel different even when they return the same boundary
• A side-by-side presentation of multiple construction styles

Visual Map

flowchart LR
    A["Point Cloud"]
    B["Sort / Partition Points"]
    C["Apply Hull Rule"]
    D["Reject Interior Turns"]
    E["Build Outer Boundary"]
    F["Final Convex Hull"]

    A --> B
    B --> C
    C --> D
    D --> E
    E --> F

Loading

Controls

• q: quit
• Active algorithm and scene interactions are shown in the top-level UI

Run

make run