Summary
Solution
Approach #1 Jarvis Algorithm [Accepted]
Algorithm
The idea behind Jarvis Algorithm is really simple. We start with the leftmost point among the given set of points and try to wrap up all the given points considering the boundary points in counterclockwise direction.
This means that for every point considered, we try to find out a point , such that this point is the most counterclockwise relative to than all the other points. For checking this, we make use of orientation()
function in the current implementation. This function takes three arguments , the current point added in the hull; , the next point being considered to be added in the hull; , any other point in the given point space. This function returns a negative value if the point is more counterclockwise to than the point .
The following figure shows the concept. The point is more counterclockwise to than the point .
From the above figure, we can observe that in order for the points , and need to be traversed in the same order in a counterclockwise direction, the cross product of the vectors and should be in a direction out of the plane of the screen i.e. it should be positive.
x
The above result is being calculated by the orientation()
function.
Thus, we scan over all the points and find out the point which is the most counterclockwise relative to and add it to the convex hull. Further, if there exist two points(say and ) with the same relative orientation to , i.e. if the points and are collinear relative to , we need to consider the point which lies in between the two points and . For considering such a situation, we've made use of a function inBetween()
in the current implementation. Even after finding out a point , we need to consider all the other points which are collinear to relative to so as to be able to consider all the points lying on the boundary.
Thus, we keep on including the points in the hull till we reach the beginning point.
The following animation depicts the process for a clearer understanding.
!?!../Documents/587_Erect_Fence_1.json:1000,563!?!
Complexity Analysis

Time complexity : . For every point on the hull we examine all the other points to determine the next point. Here n is number of input points and m is number of output or hull points ($$m ≤ n).

Space complexity : . List grows upto size .
Approach #2 Graham Scan [Accepted]
Algorithm
Graham Scan Algorithm is also a standard algorithm for finding the convex hull of a given set of points. Consider the animation below to follow along with the discussion.
!?!../Documents/587_Erect_Fence_2.json:1000,563!?!
The method works as follows. Firsly we select an initial point() to start the hull with. This point is chosen as the point with the lowest ycoordinate. In case of a tie, we need to choose the point with the lowest xcoordinate, from among all the given set of points. This point is indicated as point 0 in the animation. Then, we sort the given set of points based on their polar angles formed w.r.t. a vertical line drawn throught the intial point.
This sorting of the points gives us a rough idea of the way in which we should consider the points to be included in the hull while considering the boundary in counterclockwise order. In order to sort the points, we make use of orientation
function which is the same as discussed in the last approach. The points with a lower polar angle relative to the vertical line come first in the sorted array. In case, if the orientation of two points happens to be the same, the points are sorted based on their distance from the beginning point(). Later on we'll be considering the points in the sorted array in the same order. Because of this, we need to do the sorting based on distance for points collinear relative to , so that all the collinear points lying on the hull are included in the boundary.
But, we need to consider another important case. In case, the collinear points lie on the closing(last) edge of the hull, we need to consider the points such that the points which lie farther from the initial point are considered first. Thus, after sorting the array, we traverse the sorted array from the end and reverse the order of the points which are collinear and lie towards the end of the sorted array, since these will be the points which will be considered at the end while forming the hull and thus, will be considered at the end. Thus, after these preprocessing steps, we've got the points correctly arranged in the way that they need to be considered while forming the hull.
Now, as per the algorithm, we start off by considering the line formed by the first two points(0 and 1 in the animation) in the sorted array. We push the points on this line onto a . After this, we start traversing over the sorted array from the third point onwards. If the current point being considered appears after taking a left turn(or straight path) relative to the previous line(line's direction), we push the point onto the stack, indicating that the point has been temporarily added to the hull boundary.
This checking of left or right turn is done by making use of orientation
again. An orientation greater than 0, considering the points on the line and the current point, indicates a counterclockwise direction or a right turn. A negative orientation indicates a left turn similarly.
If the current point happens to be occuring by taking a right turn from the previous line's direction, it means that the last point included in the hull was incorrect, since it needs to lie inside the boundary and not on the boundary(as is indicated by point 4 in the animation). Thus, we pop off the last point from the stack and consider the second last line's direction with the current point.
Thus, the same process continues, and the popping keeps on continuing till we reach a state where the current point can be included in the hull by taking a right turn. Thus, in this way, we ensure that the hull includes only the boundary points and not the points inside the boundary. After all the points have been traversed, the points lying in the stack constitute the boundary of the convex hull.
The below code is inspired by @yuxiangmusic solution.
Complexity Analysis

Time complexity : . Sorting the given points takes time. Further, after sorting the points can be considered in two cases, while being pushed onto the or while popping from the . Atmost, every point is touched twice(both push and pop) taking () time in the worst case.

Space complexity : . Stack size grows upto in worst case.
Approach #3 Monotone Chain [Accepted]
Algorithm
The idea behing Monotone Chain Algorithm is somewhat similar to Graham Scan Algorithm. It mainly differs in the order in which the points are considered while being included in the hull. Instead of sorting the points based on their polar angles as in Graham Scan, we sort the points on the basis of their xcoordinate values. If two points have the same xcoordinate values, the points are sorted based on their ycoordinate values. The reasoning behind this will be explained soon.
In this algorithm, we consider the hull as being comprised of two subboundaries The upper hull and the lower hull. We form the two portions in a slightly different manner.
We traverse over the sorted array after adding the initial two points in the hull temporarily(which are pushed over the stack ). For every new point considered, we check if the current point lies in the counterclockwise direction relative to the last two points. If so, the current point is staightaway pushed onto . If not(indicated by a positive orientation
), we again get the inference that the last point on the needs to lie inside the boundary and not on the boundary. Thus, we keep on popping the points from till the current point lies in a counterclockwise direction relative to the top two points on the .
Note that this time, we need not consider the case of collinear points explicitly, since the points have already been sorted based on their xcoordinate values. So, the collinear points, if any, will implicitly be considered in the correct order.
Doing so, we reach a state such that we reach the point with the largest xcoordinate. But, the hull isn't complete yet. The portion of the hull formed till now constitutes the lower poriton of the hull. Now, we need to form the upper portion of the hull.
Thus, we continue the process of finding the next counterclockwise points and popping in case of a conflict, but this time we consider the points in the reverse order of their xcoordinate values. For this, we can simply traverse over the sorted array in the reverse order. We append the new upper hull values obtained to the previous itself. At the end, gives the points on the required boundary.
The following animation depicts the process for a better understanding of the process:
!?!../Documents/587_Erect_Fence_3.json:1000,563!?!
Complexity Analysis

Time complexity : . Sorting the given points takes time. Further, after sorting the points can be considered in two cases, while being pushed onto the or while popping from the . Atmost, every point is touched twice(both push and pop) taking () time in the worst case.

Space complexity : . stack can grow upto size .
Analysis written by: @vinod23