GrahamScan

Graham scan is a fast algorithm taking O(nlogn) time to calculate the convex hull of a set of points.

Plane Size

Sparse Radius

# of Points

Initialize data types

>|arr=points, Stack s;
  lowest=findLowestY()
  arr=SortWLowest(arr,lowest)
  Add first 2 points to stack
  for i=3 to n:
  	while PQxQR < 0 :
		test if left or right turn
  displayHull()