Comparative visualizations of transport networks in Calgary using shortest-path trees

被引：0
|
作者：
Allen, Jeff J. [1 ]
机构：
[1] Univ Toronto, 100 St,George St,Room 5047, Toronto, ON M5S 3G3, Canada
来源：
ENVIRONMENT AND PLANNING A-ECONOMY AND SPACE | 2018年 / 50卷 / 01期
关键词：
Travel mode; visualization; networks; urban transport;
D O I：
10.1177/0308518X17739009
中图分类号：
X [环境科学、安全科学];
学科分类号：
08 ; 0830 ;
摘要：
Three maps are generated to visually compare the structure of transport networks, differences in travel times, and critical travel pathways for three travel modes in Calgary, Canada. The maps also highlight how the fractal-like structure of these urban transport networks are visually similar to natural phenomena.
引用
收藏
页码：9 / 13
页数：5
相关论文
共 50 条
  • [1] CONSTRUCTION OF CENTERED SHORTEST-PATH TREES IN NETWORKS
    WALL, DW
    OWICKI, S
    [J]. NETWORKS, 1983, 13 (02) : 207 - 231
  • [2] A NOTE ON FINDING SHORTEST-PATH TREES
    KERSHENBAUM, A
    [J]. NETWORKS, 1981, 11 (04) : 399 - 400
  • [3] Joint distributions for total lengths of shortest-path trees in telecommunication networks
    David Neuhäuser
    Christian Hirsch
    Catherine Gloaguen
    Volker Schmidt
    [J]. annals of telecommunications - annales des télécommunications, 2015, 70 : 221 - 232
  • [4] Joint distributions for total lengths of shortest-path trees in telecommunication networks
    Neuhaeuser, David
    Hirsch, Christian
    Gloaguen, Catherine
    Schmidt, Volker
    [J]. ANNALS OF TELECOMMUNICATIONS, 2015, 70 (5-6) : 221 - 232
  • [5] Indexing Network Structure with Shortest-Path Trees
    Maier, Marc
    Rattigan, Matthew
    Jensen, David
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2011, 5 (03)
  • [6] BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
    KHULLER, S
    RAGHAVACHARI, B
    YOUNG, N
    [J]. ALGORITHMICA, 1995, 14 (04) : 305 - 321
  • [7] Shortest-Path Percolation on Random Networks
    Kim, Minsuk
    Radicchi, Filippo
    [J]. Physical Review Letters, 2024, 133 (04)
  • [8] Shortest-Path Queries in Static Networks
    Sommer, Christian
    [J]. ACM COMPUTING SURVEYS, 2014, 46 (04)
  • [9] Shortest-path routing in arbitrary networks
    auf der Heide, FM
    Vöcking, B
    [J]. JOURNAL OF ALGORITHMS, 1999, 31 (01) : 105 - 131
  • [10] Fault-Tolerant Approximate Shortest-Path Trees
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 137 - 148
12345