Near optimal algorithm for the shortest descending path on the surface of a convex terrain.
Sasanka RoyPublished in: J. Discrete Algorithms (2012)
Keyphrases
- optimization algorithm
- dynamic programming
- np hard
- detection algorithm
- learning algorithm
- three dimensional
- shortest path
- configuration space
- optimal solution
- objective function
- similarity measure
- preprocessing
- simulated annealing
- globally optimal
- particle swarm optimization
- recognition algorithm
- image sequences
- optimal path
- quadratic optimization problems
- range data
- convex hull
- matching algorithm
- expectation maximization
- multi view
- significant improvement
- search space
- computational complexity