Routing through open spaces – A performance comparison of algorithms
Finding the shortest path through open spaces is a well-known challenge for pedestrian routing engines. A common solution is routing on the open space boundary, which causes in most cases an unnecessarily long route. A possible alternative is to create a subgraph within the open space. This paper as...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-07-01
|
| Series: | Geo-spatial Information Science |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/10095020.2017.1399675 |