2-Opt Moves and Flips for Area-optimal Polygonizations

DOI10.1145/3500913OpenAlexW4220863407MaRDI QIDQ5102068

Peter Palfrader, Günther Eder, Steinþór Jasonarson, Martin Held, Philipp A. Mayer

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

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
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Generating random polygons with given vertices
• Algorithms for Reporting and Counting Geometric Intersections
• A Method for Solving Traveling-Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• FIST: fast industrial-strength triangulation of polygons

This page was built for publication: 2-Opt Moves and Flips for Area-optimal Polygonizations