grantgasser / algorithms-project

Closest Pair and Convex Hull

Algorithms Project

Using C++ and the SDL, write an application to graphically represent the runtime characteristics of the following closest-pair algorithms.

• Brute-Force Closest-Pair
• Divide-And-Conquer Closest Pair
• Brute-Force Convex Hull
  • https://semisignal.com/brute-force-convex-hull-construction/
• Divide-And-Conquer Convex Hull
  • https://www.geeksforgeeks.org/convex-hull-set-2-graham-scan/