ConvexHull is a school project about Convex Hull in C++. The goal is to get the smallest convex polygon containing a list of 2d points.
Convex Hull is achievable with different algorithms. In our case we use the Monotone chain algorithm.
Requirements:
- CMake (>= 3.0)
- gcc (C++ >= 17)
- SFML (>= 2.5.1)
Steps:
cd ConvexHull
cmake ./CMakeLists.txt -B ./output/
cd output/
make
ConvexHull
executable file is in the output
folder.
Coming soon...