From Franklin & Marshall College:
Shows an animation of algorithms for triangulating an arbitrary simple polygon: 1. User enters vertices of polygon 2. Vertices are classified. 3. Polygon is broken into monotone polygons. 4. Each monotone polygon is triangulated.
Additionally, the user may see the solution to the "Art Gallery Problem," in which one sees the position of the minimum number of guards necessary to guard an art gallery in the shape of the user's polygon.
Help, instructions and explanations are provided at each step.