Shortest Paths with Arbitrary Clearance from Navigation Meshes.
Marcelo KallmannPublished in: Symposium on Computer Animation (2010)
Keyphrases
- euclidean space
- shortest path
- geodesic distance
- shortest path problem
- shortest path algorithm
- road network
- optimal path
- routing algorithm
- path length
- minimum cost flow
- minimal surface
- finding the shortest path
- similarity measure
- strongly connected components
- shortest distance
- flow graph
- navigation systems
- travel time
- weighted graph
- multi objective