Area optimal polygonization using simulated annealing
From MaRDI portal
Recommendations
- Computing area-optimal simple polygonizations
- Triangle-Based Heuristics for Area Optimal Polygonizations
- Optimal area polygonization problems: exact solutions through geometric duality
- scientific article; zbMATH DE number 1416198
- An empirical study on randomized optimal area polygonization of planar point sets
Cites work
- CGAL Arrangements and their applications. A step-by-step guide
- Computational Geometry in C
- Computational geometry. Algorithms and applications.
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Equation of state calculations by fast computing machines
- On simple polygonalizations with optimal area
- Optimization by simulated annealing
- Slicing an ear using prune-and-search
- Strategies for the parallel implementation of metaheuristics
Cited in
(12)- On the effectiveness of the genetic paradigm for polygonization
- Optimal area polygonization problems: exact solutions through geometric duality
- scientific article; zbMATH DE number 1416198 (Why is no real title available?)
- 2-opt moves and flips for area-optimal polygonizations
- Area-optimal simple polygonalizations: the CG challenge 2019
- Computing area-optimal simple polygonizations
- Triangle-Based Heuristics for Area Optimal Polygonizations
- An empirical study on randomized optimal area polygonization of planar point sets
- Edge sparsification for geometric tour problems
- Optimal Area Polygonization by Triangulation and Visibility Search
- Optimal area polygonisation problems: mixed integer linear programming models
- Computing optimal triangulations using simulated annealing
This page was built for publication: Area optimal polygonization using simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102071)
