Constructs a convex hull of vectors in the passed list. The returned list will be an ordered list of the points on the hull boundary, starting with the point of the lowest x Value. The last point will be identical to the first. Uses Andrew's algorithm with a complexity of O (n log n)