Grid_based_transit_node_routing.png
No higher resolution available.
Summary
| Description |
English:
For each cell C, a set of access nodes (red dots) can be found by looking at an inner area I of 5x5 cells and an outer area O of 9x9 cells around C. Focusing on crossing nodes (ends of edges that cross the boundary of C, I or O (black dots), the access nodes for C are those nodes of I that are part of a shortest path (black path) from some node in C to a node in O.
|
| Date | |
| Source | Own work |
| Author | Mwoelkde |
Adapted from: Bast, Holger; Funke, Stefan; Matijevic, Domagoj; Sanders, Peter; Schultes, Dominik (2007-01-06), "In Transit to Constant Time Shortest-Path Queries in Road Networks", 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), Society for Industrial and Applied Mathematics, pp. 46–59, ISBN 9781611972870 , retrieved 2019-06-28
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication . |
|
The person who associated a work with this deed has dedicated the work to the
public domain
by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|