Skip to content

Latest commit

 

History

History
27 lines (13 loc) · 643 Bytes

README.md

File metadata and controls

27 lines (13 loc) · 643 Bytes

Point-set-Polygonization-CGAL-C

In this project, we compare various algorithms for calculating the area of a polygon, including optimal local search, optimal simulated annealing, incremental, and onion methods, to determine the most efficient and effective approach.

National and Kapodistrian University of Athens Department of Informatics and Telecommunications

Authors:

PSYCHARIS EVANGELOS 1115201800217 SKORDAS CHARISIS 1115201900342

Supervisor: DR.EMIRIS

An Assignment submitted for the NKUoA:

(DI352) Software Development for Algorithmic Problems

November, 2022

FINAL VERSION AT final_no_cmake