Optimal area polygonization problems: exact solutions through geometric duality
From MaRDI portal
Publication:2147134
DOI10.1016/J.COR.2022.105842OpenAlexW4224276723WikidataQ114193071 ScholiaQ114193071MaRDI QIDQ2147134FDOQ2147134
Authors: Natanael Ramos, Pedro J. de Rezende, Cid Carvalho de Souza
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105842
Recommendations
Cites Work
- Statistical comparisons of classifiers over multiple data sets
- Title not available (Why is that?)
- Computational Geometry in C
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Enumerating order types for small point sets with applications
- Title not available (Why is that?)
- Improved upper bounds on the reflexivity of point sets
- Title not available (Why is that?)
- Generating random polygons with given vertices
- Area optimal polygonization using simulated annealing
- An empirical study on randomized optimal area polygonization of planar point sets
- On simple polygonalizations with optimal area
- Curve reconstruction, the Traveling Salesman Problem, and Menger's theorem on length
- Triangle-Based Heuristics for Area Optimal Polygonizations
- 2-opt moves and flips for area-optimal polygonizations
- Greedy and local search heuristics to build area-optimal polygons
- Area-optimal simple polygonalizations: the CG challenge 2019
Cited In (7)
- Area optimal polygonization using simulated annealing
- Area-optimal simple polygonalizations: the CG challenge 2019
- Title not available (Why is that?)
- Computing area-optimal simple polygonizations
- Triangle-Based Heuristics for Area Optimal Polygonizations
- A dual bounding scheme for a territory design problem
- Computing nonsimple polygons of minimum perimeter
Uses Software
This page was built for publication: Optimal area polygonization problems: exact solutions through geometric duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147134)