Approximating Shortest Paths on Weighted Polyhedral Surfaces.
Mark LanthierAnil MaheshwariJörg-Rüdiger SackPublished in: Algorithmica (2001)
Keyphrases
- shortest path
- weighted graph
- minimal surface
- shortest path algorithm
- betweenness centrality
- shortest path problem
- edge weights
- three dimensional
- road network
- parametric curves
- finding the shortest path
- optimal path
- path length
- minimum cost flow
- shortest distance
- spatial networks
- convex hull
- travel time
- graph partitioning
- energy functional
- flow graph