(99+) Erect the Fence - LeetCode

(99+) Erect the Fence - LeetCode

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 $p$ considered, we try to find out a point $q$, such that this point $q$ is the most counterclockwise relative to $p$ than all the other points. For checking this, we make use of orientation() function in the current implementation. This function takes three arguments $p$, the current point added in the hull; $q$, the next point being considered to be added in the hull; $r$, any other point in the given point space. This function returns a negative value if the point $q$ is more counterclockwise to $p$ than the point $r$.

Read full article from (99+) Erect the Fence - LeetCode