Area Optimal Polygonization Using Simulated Annealing

DOI10.1145/3500911OpenAlexW4214829407WikidataQ114071097 ScholiaQ114071097MaRDI QIDQ5102071

Efi Fogel, Nir Goren, Dan Halperin

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/3500911

zbMATH Keywords

computational geometrygeometric optimizationexact algorithmsalgorithm engineeringpolygonizationarea 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

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• CGAL Arrangements and their applications. A step-by-step guide
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• On simple polygonalizations with optimal area
• Computational Geometry in C
• Slicing an ear using prune-and-search
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Area Optimal Polygonization Using Simulated Annealing