A new algorithm for the two-polygon containment problem.
Roger GrindeTom M. CavalierPublished in: Comput. Oper. Res. (1997)
Keyphrases
- dynamic programming
- convex hull
- significant improvement
- genetic algorithm
- theoretical analysis
- particle swarm optimization
- preprocessing
- data sets
- objective function
- computational complexity
- cost function
- optimal solution
- experimental evaluation
- computational cost
- times faster
- high accuracy
- search space
- estimation algorithm
- matching algorithm
- detection algorithm
- k means
- optimization algorithm
- decision trees
- worst case
- np hard