Convex Hull

Disclaimer

This application is pretty cool, though it does not demonstrate the quality of development I currently do. Presentation and logical code is interspersed and tightly coupled.

Intro

Convex Hull is an application that visually demonstrates two convex hull finding algorithms, Graham's Scan and Jarvis' March (also known as the Gift-Wrapping algorithm).

The application is written in java. To compile, simply run in a terminal:

$ javac *.java

And run with:

$ java Main