An Optimal Algorithm for the Separating Common Tangents of two Polygons.
Mikkel AbrahamsenPublished in: CoRR (2015)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- learning algorithm
- detection algorithm
- computationally efficient
- high accuracy
- k means
- experimental evaluation
- path planning
- globally optimal
- np hard
- computational complexity
- similarity measure
- multi objective
- significant improvement
- preprocessing
- improved algorithm
- optimization algorithm
- data sets
- minimum length
- convex hull
- times faster
- closed form
- ant colony optimization
- clustering method
- expectation maximization
- linear programming
- probabilistic model
- neural network