Triangle-Based Heuristics for Area Optimal Polygonizations
From MaRDI portal
Recommendations
- Algorithms for optimal area triangulations of a convex polygon
- Optimal Area Polygonization by Triangulation and Visibility Search
- Greedy and local search heuristics to build area-optimal polygons
- Computing area-optimal simple polygonizations
- scientific article; zbMATH DE number 1416198
- On simple polygonalizations with optimal area
- Optimal area polygonization problems: exact solutions through geometric duality
- Polygon triangulation: Efficiency and minimality
- Area optimal polygonization using simulated annealing
- Optimal higher order Delaunay triangulations of polygons
Cites work
- Computational Geometry in C
- Corrections to Lee's visibility polygon algorithm
- Efficiently testing digital convexity and recognizing digital convex polygons
- Handbook of parametric and nonparametric statistical procedures.
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- Introduction to algorithms.
- Statistical comparisons of classifiers over multiple data sets
Cited in
(17)- LMT-skeleton heuristics for several new classes of optimal triangulations
- On simple polygonalizations with optimal area
- On the effectiveness of the genetic paradigm for polygonization
- Optimal area polygonization problems: exact solutions through geometric duality
- A heuristic triangulation algorithm
- Connect-the-dots: A new heuristic
- scientific article; zbMATH DE number 1416198 (Why is no real title available?)
- 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
- Computing area-optimal simple polygonizations
- An empirical study on randomized optimal area polygonization of planar point sets
- Edge sparsification for geometric tour problems
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
- Optimal Area Polygonization by Triangulation and Visibility Search
- Optimal area polygonisation problems: mixed integer linear programming models
This page was built for publication: Triangle-Based Heuristics for Area Optimal Polygonizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102078)
