A counterexample to an algorithm for computing monotone hulls of simple polygons.
Godfried T. ToussaintHossam A. ElGindyPublished in: Pattern Recognit. Lett. (1983)
Keyphrases
- experimental evaluation
- theoretical analysis
- times faster
- optimization algorithm
- detection algorithm
- matching algorithm
- learning algorithm
- computational complexity
- np hard
- dynamic programming
- computational cost
- probabilistic model
- high accuracy
- selection algorithm
- improved algorithm
- estimation algorithm
- classification algorithm
- clustering method
- single pass
- k means
- preprocessing
- minimum length
- recognition algorithm
- convex hull
- particle swarm optimization
- optimal solution