This Article 
 Bibliographic References 
 Add to: 
2005 IEEE Symposium on Information Visualization (InfoVis 2005)
Flow Map Layout
Minneapolis, MN USA
October 23-October 25
ISBN: 0-7803-9464-x
Doantam Phan, Stanford University
Ling Xiao, Stanford University
Ron Yeh, Stanford University
Pat Hanrahan, Stanford University
Terry Winograd, Stanford University
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.
Index Terms:
flow maps, GIS, hierarchical clustering
Doantam Phan, Ling Xiao, Ron Yeh, Pat Hanrahan, Terry Winograd, "Flow Map Layout," ieee_infovis, pp.29, 2005 IEEE Symposium on Information Visualization (InfoVis 2005), 2005
Usage of this product signifies your acceptance of the Terms of Use.