Convex Hull

1. Pick the points by clicking on the black rectangle area of the applet.
2. Choose which algorithm you want to use, then click on the GO button.
3. If you choose additional point during calculation will cause the program to recalculate from beginning.

There are many solutions to the convex hull problem. Two of them were implemented. The purpose is to compare the speed and techniques of each algorithm in finding the hull.

Quick Hull Algorithm : Recursive solution to split the points and check which points can be skipped and which points shall be keep checking. Best Case ---> O(n log n)

Brute Force Algorithm : compare all possible lines with all other points and find out is the line on the hull. ---> O(n pow 3)

Convex Hull

This program was created by Jeff So.