A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons.
Vitit KantabutraPublished in: J. Comput. Syst. Sci. (1994)
Keyphrases
- minimum length
- convex hull
- k means
- simple polygon
- learning algorithm
- worst case
- experimental evaluation
- np hard
- theoretical analysis
- matching algorithm
- preprocessing
- dynamic programming
- optimization algorithm
- times faster
- recognition algorithm
- segmentation algorithm
- objective function
- high accuracy
- computational complexity
- input data
- linear programming
- detection algorithm
- cost function
- significant improvement
- search space
- piecewise linear
- globally optimal
- optimal solution