README - 4/30/90 P. Flynn

This directory contains sources for 2DLab, an interactive tool
for visualizing some common geometric algorithms.  At present,
two minimum spanning tree and two convex hull algorithms are
working.  If time permits, I'll add code for construction of
the Voronoi diagram and Delaunay triangulation.

Thanks to Erica Leibman (of BuzzNUG fame) for a little emailed
motivation.

GETTING STARTED:

The program starts up with ten 2D points in the display.
Select one of the four algorithms to animate and bang the `Animate'
button to see what's going on. New points can be added by mousing in
the graphics area OR by typing the desired number of points into the
text field and hitting Return.  See the Help window (accessible from
the main menu) for more information.

For info on the algorithms, see the source code, or Horowitz and
Sahni's algorithms book (for MST algorithms), or
Preparata and Shamos' book (for convex hull algorithms).

Questions/comments: flynn@cps.msu.edu
