An Optimal Algorithm for the Separating Common Tangents of Two Polygons.
Mikkel AbrahamsenPublished in: SoCG (2015)
Keyphrases
- dynamic programming
- detection algorithm
- optimal solution
- globally optimal
- worst case
- learning algorithm
- locally optimal
- improved algorithm
- optimization algorithm
- preprocessing
- np hard
- high accuracy
- objective function
- recognition algorithm
- convex hull
- closed form
- computational cost
- segmentation algorithm
- matching algorithm
- clustering method
- space complexity
- times faster
- computationally efficient
- exhaustive search
- computational complexity
- optimal parameters
- optimal path
- probabilistic model