Υπολογιστική Γεωμετρία (Computational Geometry)

This repository contains implementations of various computational geometry algorithms and linear programming problems, including convex hull algorithms, Voronoi diagrams, Delaunay triangulations, and the incremental algorithm for solving linear programming problems.

Course Information

This project is part of the course Υπολογιστική Γεωμετρία (Computational Geometry)
Course Code: ΘΠ11

Contents

1. Incremental Algorithm for Convex Hulls
   Implementation of an incremental algorithm for finding the convex hull of a set of 2D points.

2. Gift Wrapping (Jarvis March) Algorithm
   Implementation of the Gift Wrapping algorithm for convex hull construction.

3. QuickHull Algorithm
   A more efficient algorithm for finding the convex hull of a set of points.

4. Divide and Conquer Algorithm
   A divide and conquer approach for computing the convex hull of a set of points.

5. Linear Programming Problem (Siedel's Incremental Algorithm)
   Solving a linear programming problem using the incremental algorithm with constraints and an objective function.

6. Voronoi Diagram and Delaunay Triangulation
   Generation and plotting of Voronoi diagrams and Delaunay triangulations for a set of 2D points.

Requirements

To run the code in this repository, the following Python libraries must be installed:

• numpy
• matplotlib
• scipy

You can install the necessary dependencies using pip:

pip install numpy matplotlib scipy