Computing area-optimal simple polygonizations

DOI10.1145/3503607MaRDI QIDQ5102075zbMATH OpenOpenAlexWikidataFDO

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

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

algorithm engineeringarea optimizationcomputational geometryexact algorithmsgeometric optimizationpolygonization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Area-optimal simple polygonalizations: the CG challenge 2019
• Optimal area polygonization problems: exact solutions through geometric duality
• Triangle-Based Heuristics for Area Optimal Polygonizations
• Area optimal polygonization using simulated annealing
• On simple polygonalizations with optimal area

Cites work

• A simple min-cut algorithm
• An empirical study on randomized optimal area polygonization of planar point sets
• Area-optimal simple polygonalizations: the CG challenge 2019
• Maximal Flow Through a Network
• Multi-Terminal Network Flows
• On simple polygonalizations with optimal area
• Solving large-scale minimum-weight triangulation instances to provable optimality

Cited in

(24)

• Computing optimal diameter-bounded polygon partitions
• On simple polygonalizations with optimal area
• On the effectiveness of the genetic paradigm for polygonization
• Using symbolic calculations to determine largest small polygons
• Optimal area polygonization problems: exact solutions through geometric duality
• Memory-constrained algorithms for simple polygons
• scientific article; zbMATH DE number 988752 (Why is no real title available?)
• scientific article; zbMATH DE number 434882 (Why is no real title available?)
• Optimizing a Strip Separating Two Polygons
• scientific article; zbMATH DE number 701117 (Why is no real title available?)
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• scientific article; zbMATH DE number 1416198 (Why is no real title available?)
• An Algorithm to Compute Any Simple k-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
• 2-opt moves and flips for area-optimal polygonizations
• Greedy and local search heuristics to build area-optimal polygons
• Area optimal polygonization using simulated annealing
• Area-optimal simple polygonalizations: the CG challenge 2019
• Triangle-Based Heuristics for Area Optimal Polygonizations
• An empirical study on randomized optimal area polygonization of planar point sets
• Computing nonsimple polygons of minimum perimeter
• Edge sparsification for geometric tour problems
• Optimal Area Polygonization by Triangulation and Visibility Search
• Optimal area polygonisation problems: mixed integer linear programming models
• Area-preserving approximations of polygonal paths

This page was built for publication: Computing area-optimal simple polygonizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102075)