Login / Signup
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.
Sanjiv Kapoor
S. N. Maheshwari
Joseph S. B. Mitchell
Published in:
Discret. Comput. Geom. (1997)
Keyphrases
</>
shortest path
objective function
dynamic programming
shortest path problem
optimal solution
minimum length
shortest path algorithm
similarity measure
np hard
simulated annealing
path length
finding the shortest path
expectation maximization
path planning
graph structure
optimal path