Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
Rendering effective route maps: improving usability through generalization
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Modeling Costs of Turns in Route Planning
Geoinformatica
Including landmarks in routing instructions
Journal of Location Based Services
Automatic generation of destination maps
ACM SIGGRAPH Asia 2010 papers
Efficient routing in road networks with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Evaluating and minimizing ambiguities in qualitative route instructions
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Real-time routing with OpenStreetMap data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Path schematization for route sketches
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Minimum time-dependent travel times with contraction hierarchies
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
This paper provides a detailed description of work in progress on the algorithmic challenges of generating textual route guidance. More specifically, we show how to transform the generation of meaningful turn instructions into a path search problem on a graph. We develop a thorough algorithmic framework with well-defined data structures. Subsequently, we show how to use this algorithmic framework in a way that gives flexible route guidance reflecting either user preferences of personal local knowledge. The structural properties of the graph allow us to generate guidance along the route in time linear in the number of junctions on the computed routes in theory and within milliseconds in practice. As the results are preliminary some of the explanations are given by example.