Handouts: Summary of Melkman's algorithm (on web)
3/5/08: Convex hulls in 2D


See Convex hull algorithm applets
Summary and review of methods so far: SuperSlowCH: O(n^4) to identify vertices; SlowCH: O(n^3) to identify edges of CH(S);
Jarvis March ("Gift Wrap"): output-sensitive O(nh), but worst-case O(n^2). Here, h is the output size (number of hull vertices. Discussion of the fact that E(h) = O(log n), if the n points are uniformly distributed in a square. (Here, E(h) is the expected value of the number, h, of hull vertices.)
Graham scan.