1st/2 Assignment of the "Computational Geometry" course (Spring Semester 2023 - NKUA). Python implementations of the following algorithms to compute the convex hull of N-points: Incremental (Graham's Scan) (2D and 3D), Quickhull (2D and 3D), Divide and Conquer (2D), Gift Wrapping (2D).

1. "Computational Assignment 1".pdf contains the objectives of the exercise (Spring Semester 2023)
2. files and functionalities:

   • divide_and_conquer_2D_no_live_plotting.py -> Divide and Conquer algorithm imlementation with static plotting of the 2D convex hull.

   • incremental_2D_live_plotting.py -> Incremental (Graham's Scan) algorithm imlementation with step by step plotting of the 2D convex hull. User can freeze the plotting using a 'Pause' button.

   • incremental_2D_no_live_plotting.py -> Incremental (Graham's Scan) algorithm imlementation with static plotting of the 2D convex hull.

   • quickhull_2D_no_live_plotting.py -> Quickhull algorithm imlementation with static plotting of the 2D convex hull.

   • quickhull_3D_interactive_plotting.py -> Quickhull algorithm imlementation with static plotting of the 3D convex hull.

   • wrapping_2D_no_live_plotting.py -> Gift Wrapping algorithm imlementation with static plotting of the 2D convex hull.

Run each Python file and see the results. Code comments explain anything you need to understand the code. Keep in mind that in some executions you will have interaction with the terminal, by inputing some data for the code to run.