A new O(n*log n) algorithm for computing the intersection of convex polygons.
Sukhamay KunduPublished in: Pattern Recognit. (1987)
Keyphrases
- worst case
- convex hull
- dynamic programming
- experimental evaluation
- improved algorithm
- high accuracy
- computational cost
- objective function
- k means
- cost function
- learning algorithm
- times faster
- matching algorithm
- detection algorithm
- computational complexity
- significant improvement
- computationally efficient
- search space
- optimal solution
- input data
- particle swarm optimization
- expectation maximization
- classification algorithm
- lower bound
- convergence rate
- neural network
- globally optimal