k-Pairs Non-Crossing Shortest Paths in a Simple Polygon.
Evanthia PapadopoulouPublished in: Int. J. Comput. Geom. Appl. (1999)
Keyphrases
- shortest path
- simple polygon
- convex hull
- minimum length
- shortest path problem
- shortest path algorithm
- road network
- endpoints
- pairwise
- finding the shortest path
- travel time
- medial axis
- weighted graph
- geodesic distance
- minimum cost flow
- path length
- spatial networks
- optimal path
- distance transform
- line segments
- binary images
- strongly connected components
- feature space