Essentially, the purpose of this demo is to demonstrate how the quick hull algorithm is utilized to create a tight bounding volume which would be used in collision detection. The first step is to locate the extremities of all of the points and create a box with those four points. After these four points are found, any points that lie inside the shape are deleted since they cannot be a part of the hull.
Afterwards, if there are still points remaining, the farthest point from each edge is connected to the other points to form new sides. Any points that lie in the triangular regions formed from this step are then deleted since they too cannot be on the hull. This procedure is called recursively until no points no longer lie outside of the hull.
Ian Switaj 