-Pairs Non-Crossing Shortest Paths in a Simple Polygon.
Evanthia PapadopoulouPublished in: ISAAC (1996)
Keyphrases
- shortest path
- simple polygon
- minimum length
- shortest path problem
- shortest path algorithm
- convex hull
- road network
- endpoints
- path length
- pairwise
- medial axis
- geodesic distance
- travel time
- flow graph
- weighted graph
- optimal path
- finding the shortest path
- computer vision
- recursive algorithm
- minimum cost flow
- strongly connected components
- optimal solution