An optimal algorithm for solving collision distance between convex polygons in plane.
Yong YanPublished in: J. Comput. Sci. Technol. (1993)
Keyphrases
- dynamic programming
- optimal solution
- globally optimal
- worst case
- k means
- computational complexity
- detection algorithm
- quadratic optimization problems
- minimum distance
- piecewise linear
- convex hull
- optimization algorithm
- learning algorithm
- cost function
- preprocessing
- convergence rate
- minimum length
- multicommodity flow problems
- matching algorithm
- segmentation algorithm
- expectation maximization
- np hard
- distance transform
- convex optimization
- average distance
- parametric curves
- reinforcement learning