Transit node routing: Difference between revisions

Revision as of 19:11, 15 July 2019

Revision as of 14:19, 16 July 2019

Line 36:

'''How are access-nodes selected?'''

[[File:Grid based transit node routing.png|thumb|Access nodes (red dots) for a cell C (red) with inner area I (orange) and outer area O (blue)]]

For each cell <math>C</math>, a set of access nodes can be found by looking at an inner area <math>I</math> of 5x5 cells and an outer area <math>O</math> of 9x9 cells around <math>C</math>. Focusing on crossing nodes (ends of edges that cross the boundary of <math>C</math>, <math>I</math> or <math>O</math>), the access nodes for <math>C</math> are those nodes of <math>I</math> that are part of a shortest path from some node in <math>C</math> to a node in <math>O</math>. As access nodes for an arbitrary node <math>v \in C</math> all access nodes of the cell containing <math>vC</math> are chosen (red dots in the image to the right).

'''How are transit-nodes selected?'''