An algorithm to find maximum area polygons circumscribed about a convex polygon.
Markus AusserhoferSusanna DannZsolt LángiGéza TóthPublished in: Discret. Appl. Math. (2019)
Keyphrases
- convex hull
- learning algorithm
- cost function
- theoretical analysis
- experimental evaluation
- preprocessing
- detection algorithm
- optimization algorithm
- np hard
- worst case
- decision trees
- classification algorithm
- matching algorithm
- times faster
- recognition algorithm
- dynamic programming
- improved algorithm
- computational cost
- significant improvement
- linear program
- piecewise linear
- minkowski sum
- tree structure
- clustering method
- simulated annealing
- support vector machine
- probabilistic model
- multi objective
- feature space
- optimal solution