A near optimal algorithm for finding Euclidean shortest path in polygonal domain
Rajasekhar InkuluSanjiv KapoorS. N. MaheshwariPublished in: CoRR (2010)
Keyphrases
- shortest path
- shortest path problem
- shortest path algorithm
- minimum length
- optimal path
- minimum cost flow
- np hard
- dynamic programming
- minimum spanning tree
- knapsack problem
- finding the shortest path
- path length
- weighted graph
- search space
- genetic algorithm
- convex hull
- path planning
- simulated annealing
- video sequences
- optimal solution
- dijkstra algorithm
- similarity measure