Convex Hull Graham Scan
GeometryHardCompute the minimal enclosing boundary around coordinates points.
Alt+Shift+H
Convex Hull Visual Border (Drag points to check dynamic updates)
Time Complexity
O(N log N) sorting + O(N) stack sweeps
Space Complexity
O(N) stack storage
Conceptual Overview
Convex Hull is the smallest convex polygon that contains all points of a given dataset, forming a boundary border enclosing the points.
Mathematical Formula
\text{Orientation test (CCW): } (y_B - y_A)(x_C - x_B) - (x_B - x_A)(y_C - y_B) < 0
Source: CP-Algorithms geometry reference