Computing Area-Optimal Simple Polygonizations

DOI10.1145/3503607OpenAlexW3212800592WikidataQ114071091 ScholiaQ114071091MaRDI QIDQ5102075

Sándor P. Fekete, Arne Schmidt, Andreas Haas, Phillip Keldenich, Michael Perk

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

zbMATH Keywords

computational geometrygeometric optimizationexact algorithmsalgorithm engineeringpolygonizationarea optimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Area-Optimal Simple Polygonalizations: The CG Challenge 2019, Optimal Area Polygonization by Triangulation and Visibility Search, Unnamed Item

Cites Work

• Unnamed Item
• On simple polygonalizations with optimal area
• Maximal Flow Through a Network
• Multi-Terminal Network Flows
• A simple min-cut algorithm
• Area-Optimal Simple Polygonalizations: The CG Challenge 2019
• An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets