Parallel Convex-Hull solver
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
- Parallelization using OpenMPI in C++
- Graphical visualization using C++ Graphics library (Linux)
