Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons.
Hans RohnertPublished in: Inf. Process. Lett. (1988)
Keyphrases
- shortest path
- shortest path problem
- shortest path algorithm
- minimal surface
- geodesic distance
- minimum length
- road network
- convex hull
- minkowski sum
- travel time
- higher dimensional
- vector space
- low dimensional
- flow graph
- image sequences
- weighted graph
- path length
- dimensionality reduction
- knn
- betweenness centrality
- reinforcement learning