DocumentCode :
2409437
Title :
Flow map layout
Author :
Ling Xiao ; Yeh, Ryan ; Hanrahan, P.
fYear :
2005
fDate :
23-25 Oct. 2005
Firstpage :
219
Lastpage :
224
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 :
cartography; computational geometry; data visualisation; flow graphs; cartography; data flow; edge crossing; edge merging; flow map layout; geographic information system; graph layout algorithm; hierarchical clustering; object movement; visual clutter;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Visualization, 2005. INFOVIS 2005. IEEE Symposium on
Print_ISBN :
0-7803-9464-X
Type :
conf
DOI :
10.1109/INFVIS.2005.1532150
Filename :
1532150
Link To Document :
بازگشت