Convex Hull

The convex hull of a set of points is the smallest convex set that includes the points. For a two dimensional finite set the convex hull is a convex polygon.

This applet lets you get a feel for the way the the convex hull depends on the points.

You can move a point by dragging it with the mouse, add a new one by clicking the mouse, and delete one by holding down the Shift key while clicking on it.

My convex hull applet demonstrates four algorithms for computing the convex hull.

Fukuda's polyhedral computation FAQ has more information about the properties of convex hulls.


lambert@cse.unsw.edu.au
Last modified: Fri Nov 1 01:24:54 MET