Finding All Shortest Path Edge Sequences on a Convex Polyhedron.
Yie-Huei HwangRuei-Chuan ChangHung-Yi TuPublished in: WADS (1989)
Keyphrases
- shortest path
- weighted graph
- convex hull
- shortest path problem
- shortest path algorithm
- road network
- edge weights
- strictly convex
- path selection
- path length
- travel time
- flow graph
- routing algorithm
- edge detection
- shortest distance
- finding the shortest path
- dijkstra algorithm
- minimum spanning tree
- minimum cost flow
- optimal path
- geodesic distance
- euclidean space
- strongly connected components
- optimization problems