Greedy and Local Search Heuristics to Build Area-Optimal Polygons

DOI10.1145/3503999OpenAlexW3173963119MaRDI QIDQ5102069

Loïc Crombez, Yan Gerard, Guilherme Dias da Fonseca

Publication date: 6 September 2022

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.14728

zbMATH Keywords

computational geometrygeometric optimizationalgorithm engineeringpolygonalizationarea optimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Optimal area polygonization problems: exact solutions through geometric duality ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Optimal Area Polygonization by Triangulation and Visibility Search ⋮ Unnamed Item

Cites Work

• On simple polygonalizations with optimal area
• Computational Geometry in C
• An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets

This page was built for publication: Greedy and Local Search Heuristics to Build Area-Optimal Polygons