Transit node routing: Difference between revisions

Revision as of 19:10, 15 July 2019

Revision as of 19:11, 15 July 2019

Line 37:

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

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>nv</math> all access nodes of the cell containing <math>nv</math>are chosen.

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