Triangle-Based Heuristics for Area Optimal Polygonizations

DOI10.1145/3504001OpenAlexW4281481719MaRDI QIDQ5102078

Pedro J. de Rezende, Natanael Ramos, Raí C. de Jesus, Fbio L. Usberti, Cid Carvalho De Souza

Publication date: 6 September 2022

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

Full work available at URL: https://doi.org/10.1145/3504001

zbMATH Keywords

combinatorial optimizationcomputational geometrypolygonizationcomputational heuristics

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

Optimal area polygonization problems: exact solutions through geometric duality ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Exact and heuristic solutions for the prize‐collecting geometric enclosure problem ⋮ Optimal Area Polygonization by Triangulation and Visibility Search ⋮ Unnamed Item

Cites Work

• Corrections to Lee's visibility polygon algorithm
• Efficiently testing digital convexity and recognizing digital convex polygons
• Computational Geometry in C
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Triangle-Based Heuristics for Area Optimal Polygonizations