Let’s consider a 2D plane, where we plug pegs at the points mentioned. We enclose all the pegs with a elastic band and then release it to take its shape. The closed structure formed by elastic band is similar to that of convex hull. Find the perimeter of the convex hull for the points.
Let points[0…n-1] be the input array.
Find the bottom-most point by comparing y coordinate of all points. If there are two points with same y value, then the point with smaller x coordinate value is considered. Let the bottom-most point be P0. Put P0 at first position in output hull.
Consider the remaining n-1 points and sort them by polor angle in counterclockwise order around points. If polor angle of two points is same, then put the nearest point first.
3 After sorting, check if two or more points have same angle. If two more points have same angle, then remove all same angle points except the point farthest from P0. Let the size of new array be m.
Create an empty stack ‘S’ and push points, points and points to S.
Process remainning m-3 points one by one.Do following for every point ‘points[i]’.
5.1 Keep removing points from stack while orientation of following 3 is not counterclockwise
a)Point next to top in stack
b)Point at the top of stack
5.2 Push points[i] to S
Keep removing points from the stack and calculate the distance between the two adjacent points.the sum of all these distances of points will give the perimeter of the polygon