This is pretty awesome. The trade-offs between the two optimized versions of Graham's scan and Jarvis' march are pretty interesting too, based on the number of points that lie on the hull.
Chan's algorithms is actually able to combine both approaches and runs in n log h. It is a bit trickier though, so I didn't make an interactive for it.