An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components.
Sukhamay KunduSridhar RadhakrishnanPublished in: Pattern Recognit. (1990)
Keyphrases
- worst case
- convex hull
- detection algorithm
- cost function
- simulated annealing
- initial set
- input data
- probabilistic model
- computational cost
- dynamic programming
- times faster
- convergence rate
- preprocessing
- computational complexity
- polynomial time complexity
- improved algorithm
- np complete
- decomposition algorithm
- particle swarm optimization
- high accuracy
- experimental evaluation
- significant improvement
- search space
- lower bound
- objective function
- similarity measure
- linear programming
- learning algorithm
- computationally efficient
- theoretical analysis
- optimization algorithm
- np hard
- association rules
- data structure