Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108].
Markus AusserhoferSusanna DannZsolt LángiGéza TóthPublished in: Discret. Appl. Math. (2024)
Keyphrases
- convex hull
- experimental evaluation
- learning algorithm
- high accuracy
- np hard
- preprocessing
- optimal solution
- dynamic programming
- times faster
- theoretical analysis
- computational complexity
- discrete geometry
- recognition algorithm
- convergence rate
- detection algorithm
- similarity measure
- computational cost
- objective function
- cost function
- simulated annealing
- linear programming
- optimization algorithm
- worst case
- shortest path
- matching algorithm
- genetic algorithm
- improved algorithm
- search algorithm
- minimum length