An algorithm for the MaxMin area triangulation of a convex polygon.
J. Mark KeilTzvetalin S. VassilevPublished in: CCCG (2003)
Keyphrases
- convex hull
- k means
- dynamic programming
- detection algorithm
- improved algorithm
- matching algorithm
- segmentation algorithm
- objective function
- computational complexity
- significant improvement
- experimental evaluation
- computational cost
- optimization algorithm
- learning algorithm
- piecewise linear
- times faster
- simulated annealing
- search space
- preprocessing
- data structure
- expectation maximization
- computationally efficient
- linear programming
- high accuracy
- ant colony optimization
- tree structure
- probabilistic model
- neural network
- delaunay triangulation