This repository contains three interconnected projects, each addressing different aspects of polygonization, optimization and evaluation.
Project 1 focuses on creating simple polygons from 2D point sets using Incremental and Convex Hull algorithms.
Project 2 involves optimizing simple polygons created by the algorithms of Project 1, utilizing local search and simulated annealing algorithms.
Project 3 evaluates the various algorithms for polygon creation and optimization of the previous Projects, assessing maximizing and minimizing polygon area.
Directory Structure:
Project1_Polygonization: Files for polygonization using Incremental and Convex Hull algorithms.Project2_Polygon_Optimization: Files for optimizing polygons using local search and simulated annealing.Project3_Polygon_Evaluation: Files for evaluating polygon algorithms.instances: Contains input files of point sets for creating the polygons.
Creators:
- Efstathios Chatziloizos
- Evangelia Steiropoulou
For detailed instructions on using each project, refer to the respective README files in the corresponding project directories.