Querying two boundary points for shortest paths in a polygonal domain.
Sang Won BaeYoshio OkamotoPublished in: Comput. Geom. (2012)
Keyphrases
- shortest path
- boundary points
- shortest path algorithm
- shortest path problem
- road network
- finding the shortest path
- path length
- minimum length
- optimal path
- data sets
- travel time
- object boundaries
- strongly connected components
- weighted graph
- distance measure
- principal component analysis
- query processing
- flow graph
- decision trees