Feed on
Posts
Comments

Daily Archive for November 27th, 2017

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. In a recently published paper authors from GIScience Research [...]

Read Full Post »