This applet demonstrates four algorithms (Incremental, Gift Wrap, Divide and Conquer, QuickHull) for computing the convex hull of points in three and two dimensions. There are some detailed instructions, but if you don't want to look at them, try the following:
Here are some links to other algorithm animation pages and geometric software pages.
You can also see some implementation notes.
If you found this applet interesting or useful, or have suggestions for improvements, please send me mail.