Optimal area polygonization problems: exact solutions through geometric duality
From MaRDI portal
Publication:2147134
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 2209713 (Why is no real title available?)
- 2-opt moves and flips for area-optimal polygonizations
- An empirical study on randomized optimal area polygonization of planar point sets
- Area optimal polygonization using simulated annealing
- Area-optimal simple polygonalizations: the CG challenge 2019
- Computational Geometry in C
- Curve reconstruction, the Traveling Salesman Problem, and Menger's theorem on length
- Enumerating order types for small point sets with applications
- Generating random polygons with given vertices
- Greedy and local search heuristics to build area-optimal polygons
- Improved upper bounds on the reflexivity of point sets
- On simple polygonalizations with optimal area
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Statistical comparisons of classifiers over multiple data sets
- Triangle-Based Heuristics for Area Optimal Polygonizations
Cited in
(7)- Computing nonsimple polygons of minimum perimeter
- scientific article; zbMATH DE number 988752 (Why is no real title available?)
- Triangle-Based Heuristics for Area Optimal Polygonizations
- Area-optimal simple polygonalizations: the CG challenge 2019
- Computing area-optimal simple polygonizations
- A dual bounding scheme for a territory design problem
- Area optimal polygonization using simulated annealing
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)