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)

Implemented various computational geometry algorithms such as Convex Hull construction, Voronoi Diagrams and Range Trees.

📐 This project implements various computational geometry algorithms, focusing on convex hulls, linear programming, Delaunay triangulation, and geometric search. The code is organized into multiple modules, each solving specific geometry-related problems and demonstrating core computational methods.