Greedy and Local Search Heuristics to Build Area-Optimal Polygons - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Journal of Experimental Algorithmics Année : 2022

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

Résumé

In this paper, we present our heuristic solutions to the problems of finding the maximum and minimum area polygons with a given set of vertices. Our solutions are based mostly on two simple algorithmic paradigms: greedy method and local search. The greedy heuristic starts with a simple polygon and adds vertices one by one, according to a weight function. A crucial ingredient to obtain good solutions is the choice of an appropriate weight function that avoids long edges. The local search part consists of moving consecutive vertices to another location in the polygonal chain. We also discuss the different implementation techniques that are necessary to reduce the running time.
Fichier principal
Vignette du fichier
CGSHOP19journal.pdf (482.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03559069 , version 1 (05-02-2022)

Identifiants

Citer

Loïc Crombez, Guilherme D da Fonseca, Yan Gerard. Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM Journal of Experimental Algorithmics, 2022, 27 (2.2), pp.1-11. ⟨10.1145/3503999⟩. ⟨hal-03559069⟩
54 Consultations
43 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More