Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.

We strongly recommend to see the following post first.

How to check if two given line segments intersect?

The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction. The big question is, given a point p as current point, how to find the next point in output? The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, r, q) = counterclockwise”. Following is the detailed algorithm.

**1)** Initialize p as leftmost point.

**2)** Do following while we don’t come back to the first (or leftmost) point.

…..**a)** The next point q is the point such that the triplet (p, q, r) is counterclockwise for any other point r.

…..**b)** next[p] = q (Store q as next of p in the output convex hull).

…..**c)** p = q (Set p as q for next iteration).

Below is the implementation of above algorithm.

## C++

`// A C++ program to find convex hull of a set of points. Refer ` `// for explanation of orientation() ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `struct` `Point ` `{ ` ` ` `int` `x, y; ` `}; ` ` ` `// To find orientation of ordered triplet (p, q, r). ` `// The function returns following values ` `// 0 --> p, q and r are colinear ` `// 1 --> Clockwise ` `// 2 --> Counterclockwise ` `int` `orientation(Point p, Point q, Point r) ` `{ ` ` ` `int` `val = (q.y - p.y) * (r.x - q.x) - ` ` ` `(q.x - p.x) * (r.y - q.y); ` ` ` ` ` `if` `(val == 0) ` `return` `0; ` `// colinear ` ` ` `return` `(val > 0)? 1: 2; ` `// clock or counterclock wise ` `} ` ` ` `// Prints convex hull of a set of n points. ` `void` `convexHull(Point points[], ` `int` `n) ` `{ ` ` ` `// There must be at least 3 points ` ` ` `if` `(n < 3) ` `return` `; ` ` ` ` ` `// Initialize Result ` ` ` `vector<Point> hull; ` ` ` ` ` `// Find the leftmost point ` ` ` `int` `l = 0; ` ` ` `for` `(` `int` `i = 1; i < n; i++) ` ` ` `if` `(points[i].x < points[l].x) ` ` ` `l = i; ` ` ` ` ` `// Start from leftmost point, keep moving counterclockwise ` ` ` `// until reach the start point again. This loop runs O(h) ` ` ` `// times where h is number of points in result or output. ` ` ` `int` `p = l, q; ` ` ` `do` ` ` `{ ` ` ` `// Add current point to result ` ` ` `hull.push_back(points[p]); ` ` ` ` ` `// Search for a point 'q' such that orientation(p, x, ` ` ` `// q) is counterclockwise for all points 'x'. The idea ` ` ` `// is to keep track of last visited most counterclock- ` ` ` `// wise point in q. If any point 'i' is more counterclock- ` ` ` `// wise than q, then update q. ` ` ` `q = (p+1)%n; ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `{ ` ` ` `// If i is more counterclockwise than current q, then ` ` ` `// update q ` ` ` `if` `(orientation(points[p], points[i], points[q]) == 2) ` ` ` `q = i; ` ` ` `} ` ` ` ` ` `// Now q is the most counterclockwise with respect to p ` ` ` `// Set p as q for next iteration, so that q is added to ` ` ` `// result 'hull' ` ` ` `p = q; ` ` ` ` ` `} ` `while` `(p != l); ` `// While we don't come to first point ` ` ` ` ` `// Print Result ` ` ` `for` `(` `int` `i = 0; i < hull.size(); i++) ` ` ` `cout << ` `"("` `<< hull[i].x << ` `", "` ` ` `<< hull[i].y << ` `")\n"` `; ` `} ` ` ` `// Driver program to test above functions ` `int` `main() ` `{ ` ` ` `Point points[] = {{0, 3}, {2, 2}, {1, 1}, {2, 1}, ` ` ` `{3, 0}, {0, 0}, {3, 3}}; ` ` ` `int` `n = ` `sizeof` `(points)/` `sizeof` `(points[0]); ` ` ` `convexHull(points, n); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find convex hull of a set of points. Refer ` `// for explanation of orientation() ` `import` `java.util.*; ` ` ` `class` `Point ` `{ ` ` ` `int` `x, y; ` ` ` `Point(` `int` `x, ` `int` `y){ ` ` ` `this` `.x=x; ` ` ` `this` `.y=y; ` ` ` `} ` `} ` ` ` `class` `GFG { ` ` ` ` ` `// To find orientation of ordered triplet (p, q, r). ` ` ` `// The function returns following values ` ` ` `// 0 --> p, q and r are colinear ` ` ` `// 1 --> Clockwise ` ` ` `// 2 --> Counterclockwise ` ` ` `public` `static` `int` `orientation(Point p, Point q, Point r) ` ` ` `{ ` ` ` `int` `val = (q.y - p.y) * (r.x - q.x) - ` ` ` `(q.x - p.x) * (r.y - q.y); ` ` ` ` ` `if` `(val == ` `0` `) ` `return` `0` `; ` `// collinear ` ` ` `return` `(val > ` `0` `)? ` `1` `: ` `2` `; ` `// clock or counterclock wise ` ` ` `} ` ` ` ` ` `// Prints convex hull of a set of n points. ` ` ` `public` `static` `void` `convexHull(Point points[], ` `int` `n) ` ` ` `{ ` ` ` `// There must be at least 3 points ` ` ` `if` `(n < ` `3` `) ` `return` `; ` ` ` ` ` `// Initialize Result ` ` ` `Vector<Point> hull = ` `new` `Vector<Point>(); ` ` ` ` ` `// Find the leftmost point ` ` ` `int` `l = ` `0` `; ` ` ` `for` `(` `int` `i = ` `1` `; i < n; i++) ` ` ` `if` `(points[i].x < points[l].x) ` ` ` `l = i; ` ` ` ` ` `// Start from leftmost point, keep moving ` ` ` `// counterclockwise until reach the start point ` ` ` `// again. This loop runs O(h) times where h is ` ` ` `// number of points in result or output. ` ` ` `int` `p = l, q; ` ` ` `do` ` ` `{ ` ` ` `// Add current point to result ` ` ` `hull.add(points[p]); ` ` ` ` ` `// Search for a point 'q' such that ` ` ` `// orientation(p, x, q) is counterclockwise ` ` ` `// for all points 'x'. The idea is to keep ` ` ` `// track of last visited most counterclock- ` ` ` `// wise point in q. If any point 'i' is more ` ` ` `// counterclock-wise than q, then update q. ` ` ` `q = (p + ` `1` `) % n; ` ` ` ` ` `for` `(` `int` `i = ` `0` `; i < n; i++) ` ` ` `{ ` ` ` `// If i is more counterclockwise than ` ` ` `// current q, then update q ` ` ` `if` `(orientation(points[p], points[i], points[q]) ` ` ` `== ` `2` `) ` ` ` `q = i; ` ` ` `} ` ` ` ` ` `// Now q is the most counterclockwise with ` ` ` `// respect to p. Set p as q for next iteration, ` ` ` `// so that q is added to result 'hull' ` ` ` `p = q; ` ` ` ` ` `} ` `while` `(p != l); ` `// While we don't come to first ` ` ` `// point ` ` ` ` ` `// Print Result ` ` ` `for` `(Point temp : hull) ` ` ` `System.out.println(` `"("` `+ temp.x + ` `", "` `+ ` ` ` `temp.y + ` `")"` `); ` ` ` `} ` ` ` ` ` `/* Driver program to test above function */` ` ` `public` `static` `void` `main(String[] args) ` ` ` `{ ` ` ` ` ` `Point points[] = ` `new` `Point[` `7` `]; ` ` ` `points[` `0` `]=` `new` `Point(` `0` `, ` `3` `); ` ` ` `points[` `1` `]=` `new` `Point(` `2` `, ` `3` `); ` ` ` `points[` `2` `]=` `new` `Point(` `1` `, ` `1` `); ` ` ` `points[` `3` `]=` `new` `Point(` `2` `, ` `1` `); ` ` ` `points[` `4` `]=` `new` `Point(` `3` `, ` `0` `); ` ` ` `points[` `5` `]=` `new` `Point(` `0` `, ` `0` `); ` ` ` `points[` `6` `]=` `new` `Point(` `3` `, ` `3` `); ` ` ` ` ` `int` `n = points.length; ` ` ` `convexHull(points, n); ` ` ` ` ` `} ` `} ` ` ` `// This code is contributed by Arnav Kr. Mandal. ` |

*chevron_right*

*filter_none*

**Output:**The output is points of the convex hull.

(0, 3) (0, 0) (3, 0) (3, 3)

**Time Complexity:** For every point on the hull we examine all the other points to determine the next point. Time complexity is ?(m * n) where n is number of input points and m is number of output or hull points (m <= n). In worst case, time complexity is O(n ^{2}). The worst case occurs when all the points are on the hull (m = n)

Set 2- Convex Hull (Graham Scan)

**Sources:**

http://www.cs.uiuc.edu/~jeffe/teaching/373/notes/x05-convexhull.pdf

http://www.dcs.gla.ac.uk/~pat/52233/slides/Hull1x1.pdf

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

## Recommended Posts:

- Dynamic Convex hull | Adding Points to an Existing Convex Hull
- Quickhull Algorithm for Convex Hull
- Convex Hull using Divide and Conquer Algorithm
- Deleting points from Convex Hull
- Convex Hull | Set 2 (Graham Scan)
- Tangents between two Convex Polygons
- Find number of diagonals in n sided convex polygon
- Number of ways a convex polygon of n+2 sides can split into triangles by connecting vertices
- Stein's Algorithm for finding GCD
- Doolittle Algorithm : LU Decomposition
- Booth’s Multiplication Algorithm
- Bresenham's Algorithm for 3-D Line Drawing
- Computer Organization | Booth's Algorithm
- Pollard's Rho Algorithm for Prime Factorization
- LS3/NS3 sphere generation algorithm and its implementation