**Based on the definition from Princeton, the convex hull of a set of points is: **

Formally: It is the smallest convex set containing the points.

Informally: It is a rubber band wrapped around the "outside" points.

This application was designed to compare time complexity of convex hull problem in both parallel and sequential algorithms. The convex hull problem is solved based on the Graham's scan algorithm.

**Techniques used in this application are:**

- Parallelization using OpenMPI in C++
- Graphical visualization using C++ Graphics library (Linux)

**Comparison of execution time for 100, 1000, 10000 and 30000 points for MPI runs with 1M 1P , 1M 4P and 2M 8P:**

**Source code:**

github.com/farshidtz/convexhull

ConvexHull.tar.gz

**Libgraph library:**

libgraph.tar.gz