Login / Signup
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles.
Jean-Daniel Boissonnat
Sylvain Lazard
Published in:
Int. J. Comput. Geom. Appl. (2003)
Keyphrases
</>
shortest path
dynamic programming
shortest path problem
worst case
objective function
expectation maximization
weighted graph
path length
similarity measure
binary images
path planning
shortest path algorithm
distance transformation
shortest distance