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 条
  • [21] An efficient technique for message flooding based on partial shortest-path trees in wired networks
    Ohtsuka, Kenji
    Sato, Takehiro
    Shioda, Shigeo
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 6425 - 6432
  • [22] MIGRATION USING THE SHORTEST-PATH METHOD
    MOSER, TJ
    [J]. GEOPHYSICS, 1994, 59 (07) : 1110 - 1120
  • [23] Optimal Allocation of Protective Resources in Shortest-Path Networks
    Cappanera, Paola
    Scaparra, Maria Paola
    [J]. TRANSPORTATION SCIENCE, 2011, 45 (01) : 64 - 80
  • [24] SEGMENTATION OF MERGED CHARACTERS BY NEURAL NETWORKS AND SHORTEST-PATH
    WANG, J
    JEAN, J
    [J]. PATTERN RECOGNITION, 1994, 27 (05) : 649 - 658
  • [25] A Shortest-Path Tree Approach for Routing in Space Networks
    Olivier De Jonckère
    Juan A.Fraire
    [J]. China Communications, 2020, 17 (07) : 52 - 66
  • [26] Primal and dual neural networks for shortest-path routing
    Wang, J
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1998, 28 (06): : 864 - 869
  • [27] A Shortest-Path Tree Approach for Routing in Space Networks
    De Jonckere, Olivier
    Fraire, Juan A.
    [J]. CHINA COMMUNICATIONS, 2020, 17 (07) : 52 - 66
  • [28] ON SHORTEST-PATH ALGORITHMS IN THE TOPOLOGICAL DESIGN OF COMPUTER-NETWORKS - A COMPARATIVE-STUDY
    SOI, IM
    AGGARWAL, KK
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1981, 12 (11) : 1379 - 1387
  • [29] Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    [J]. ALGORITHMICA, 2022, 84 (01) : 37 - 59
  • [30] Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
    Hirsch, Christian
    Neuhaeuser, David
    Gloaguen, Catherine
    Schmidt, Volker
    [J]. STATISTICS & PROBABILITY LETTERS, 2015, 107 : 122 - 130
12345