Flow map layout
- 15 November 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. The advantage of flow maps is that they reduce visual clutter by merging edges. Most flow maps are drawn by hand and there are few computer algorithms available. We present a method for generating flow maps using hierarchical clustering given a set of nodes, positions, and flow data between the nodes. Our techniques are inspired by graph layout algorithms that minimize edge crossings and distort node positions while maintaining their relative position to one another. We demonstrate our technique by producing flow maps for network traffic, census data, and trade data.Keywords
This publication has 9 references indexed in Scilit:
- Visualizing the global topology of the MBonePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Case study: 3D displays of Internet trafficPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Rendering effective route mapsPublished by Association for Computing Machinery (ACM) ,2001
- Data clusteringACM Computing Surveys, 1999
- Toward a Conceptual Framework for the Cartographic Visualization of Network InformationCartographica: The International Journal for Geographic Information and Geovisualization, 1997
- 3D geographic network displaysACM SIGMOD Record, 1996
- Layout Adjustment and the Mental MapJournal of Visual Languages & Computing, 1995
- Visualizing network dataIEEE Transactions on Visualization and Computer Graphics, 1995
- Experiments In Migration Mapping By ComputerThe American Cartographer, 1987