Computational Geometry Project

For your second project, your task is to implement both Graham's Scan and Jarvis's March to compute the convex hull of a set of points.

In addition, choose one of two options:

• Animate the running of the two algorithms using Java's graphics facilities or a similar system.
• Conduct rigorous experiments to compare the performance of the two algorithms; you may either look into which performs best on average or try to characterize on what kinds of input each algorithms performs better on (for example, normally distributed vs uniformly distributed).

I've written a simple class to hold a random set of points. It also has a main method that demonstrates a simple use of Java graphics relevant to this project. You may use/modify/get ideas from/ignore this class as you wish:

/homes/tvandrun/Public/cs445/PointSet.java

Due: Friday, Dec 5, at 5:00 pm