Efficient Computation of Jogging Routes
We study the problem of computing jogging (running) routes in pedestrian networks: Given source vertex s and length L , it asks for a cycle (containing s) that approximates L while considering niceness criteria such as the surrounding area, shape of the route, and its complexity. Unfortunately, computing such routes is NP-hard, even if the only optimization goal is length. We therefore propose two heuristic solutions: The first incrementally extends the route by joining adjacent faces of the network. The other builds on partial shortest paths and is even able to compute sensible alternative routes. Our experimental study indicates that on realistic inputs we can compute jogging routes of excellent quality fast enough for interactive applications.
KeywordsShort Path Planar Graph Route Length Short Path Tree Source Vertex
Unable to display preview. Download preview PDF.
- 2.Dantzig, G.: Linear Programming and Extensions. Princeton University Press (1962)Google Scholar
- 7.Karp, R.M.: Reducibility among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
- 8.Liu, H., Wang, J.: A new way to enumerate cycles in graph. In: AICT and ICIW 2006, pp. 57–60. IEEE Computer Society (2006)Google Scholar
- 9.Sommer, C.: Shortest-Path Queries in Static Networks (2012) (submitted), Preprint available at http://www.sommer.jp/spq-survey.html
- 11.Zündorf, T.: Effiziente Berechnung guter Joggingrouten. Bachelor thesis, Karlsruhe Institute of Technology (October 2012)Google Scholar