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:
| Drag with the left mouse button to see the hull from different
|| Select a different algorithm from the bottom left menu to see how
the gift-wrapping or divide-and-conquer algorithms construct the
|| Follow this link to see this applet
animate Delaunay triangulation algorithms.
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.
email@example.com Last modified: Wed Sep 23 18:23:37 AET 1998