Routing über Flächen mit SpiderWebGraph
Navigation systems are able to determine the shortest, fastest and most energy efficient route. Whenever an area is encountered on a route it will be driven around. A realistic scenario would be a pedestrian going from point A to B crossing a market place or a parking lot. A common navigation system would lead the user around such areas instead of across. This paper accepts the challenge of efficient and direct routing across such areas.
As a first step the paper shows that eight established navigation systems do not route across polygons. Then the paper discusses an initial stage for a solution (BAUER et al. 2014). The main part of this paper presents the SpiderWebGraph (SWG) as an alternative and addition to (BAUER et al. 2014). Concluding the paper shows the advantages of SWG for the navigation system eNav and explains the challenges of efficient routing across area.