Skip to content

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

Notifications You must be signed in to change notification settings

harrisskordas/PointSet-Polygonization-CGAL

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

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

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published