Cutting the Gordian knot of visualizing dense spatial networks: the case of the world city network, 2013
- 1 June 2015
- journal article
- research article
- Published by SAGE Publications in Environment and Planning A: Economy and Space
- Vol. 47 (6) , 1332-1340
Abstract
Networks have become ubiquitous in the analysis of socioeconomic patterns. Importantly, most of these networks have an inherent geographical dimension, and are therefore a relevant object for geographical research and related thinking on cartographic mapping and visualization. The visualization of spatial networks is, however, still in its infancy. In this paper, we present and discuss some of the typical issues associated with the visualization of spatial networks, as well as the emerging possibilities to tackle these issues. In particular, we focus on a state-of-the-art graph layout algorithm that uses edge bundling on network layers in conventional maps. We use the example of the geographies of the world city network in 2013 as researched by the Globalization and World Cities network (GaWC).Keywords
This publication has 15 references indexed in Scilit:
- An Alternative Approach to the Calculation and Analysis of Connectivity in the World City NetworkEnvironment and Planning B: Planning and Design, 2014
- The New Science of Cities2013
- Information-rich visualisation of dense geographical networksJournal of Maps, 2013
- Brute Force and Sorting Processes: Two Perspectives on World City Network FormationUrban Studies, 2012
- Two‐Mode Networks and the Interlocking World City Network Model: A Reply to NealGeographical Analysis, 2012
- The myth of global science collaboration—Collaboration patterns in epistemic communitiesJournal of Informetrics, 2012
- Spatial networksPhysics Reports, 2011
- Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical DataIEEE Transactions on Visualization and Computer Graphics, 2006
- A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations2005
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991