An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon.
T. C. HuM. T. ShingPublished in: J. Algorithms (1981)
Keyphrases
- convex hull
- cost function
- experimental evaluation
- k means
- learning algorithm
- preprocessing
- dynamic programming
- detection algorithm
- theoretical analysis
- computational cost
- optimal solution
- computational complexity
- data sets
- worst case
- high accuracy
- particle swarm optimization
- expectation maximization
- computationally efficient
- similarity measure
- times faster
- improved algorithm
- global optimum
- significant improvement
- clustering algorithm
- recognition algorithm