Determining approximate shortest paths on weighted polyhedral surfaces.

Lyudmil Aleksandrov Anil Maheshwari Jörg-Rüdiger Sack

Published in: J. ACM (2005)

Keyphrases

shortest path
minimal surface
weighted graph
shortest path algorithm
shortest path problem
betweenness centrality
road network
edge weights
path length
three dimensional
optimal path
flow graph
minimum cost flow
geodesic distance
shortest distance
convex hull
complex networks
image sequences