Finding the Shortest Path Between Two Points in a Polygon (beta 1.2)

Instructions for using the applet:

1. Getting the right browser - I don't know what version of Netscape (or Microsoft IE) this applet requires, but if it doesn't work for you, then chances are that yours is too old.  Sorry.  I have successfully used Netscape 4.06 and 4.5.  Go visit Netscape or Microsoft, update, and come back.
2. Creating the polygon - A polygon can be created in one of two ways - a random polygon can be created by first entering the number of desired points and then clicking 'Create Random Polygon,' whereas an arbitrary polygon can be constructed by selecting 'Draw New Polygon' and then clicking at the location of each desired vertex.  Either way, the points can then be dragged around the canvas until the start and finish points are selected.  From that point on, the polygon cannot be changed. If drawing the points, please do so in clockwise order. Otherwise the algorithm may get confused.
3. Executing the algorithm - Each successive step is executed by clicking the 'Next Step' button.  The step to be executed is displayed in the button itself.  Status messages will appear in the message box at the bottom.