A simple visualization I made to showcase different convex hull algorithms such as graham scan, quick hull and divide & conquer.
link : https://nishanthprajith.github.io/Convex_Hull_Visualization/
Just to make sure the controls is as simple as possible, all you as the user needs to do is click on the algorithm from the list at the top and let the javascript do the rest of the work. Once clicked the algorithm will begin executing. And only once the current execution is finished you the user will be allowed to choosen a different algorithm.
Please note that the time it takes for the visualization is in no way representative of the speed of the alogrithm as this has been slowed down to create a more appealing affect.
Note that the time complexitiy of each alogithms is based on the number of inputs (n)
Time Complexity : O(nlogn)
This algorithm finds all vertices of convex hull by going through all the points along the boundary. This algorithms uses the stack data structure to add and remove vertices during the convex hull calculation.
Time Complexity : O(nlogn)
This alogrithm is very similar to the quicksort alogorithm and uses a divide and conquer approach for finding the convex hull. Althought, this alogirthm is quite efficient in cases of high symmetry it becomes very slow making it's time complexitity close to o(n^2)