Optimal area polygonization problems: exact solutions through geometric duality
From MaRDI portal
Publication:2147134
DOI10.1016/J.COR.2022.105842OpenAlexW4224276723WikidataQ114193071 ScholiaQ114193071MaRDI QIDQ2147134FDOQ2147134
Cid Carvalho de Souza, Pedro J. de Rezende, Natanael Ramos
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
- Title not available (Why is that?)
- 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 (3)
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)
